The traveling purchaser problem with stochastic prices: Exact and approximate algorithms

European Journal of Operational Research

Volumn 209, Issue 3, 2011, Pages 265-272

  Kang, Seungmo ^a   Ouyang, Yanfeng ^b  

^a Korea University   (South Korea)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

Approximation; Dynamic programming; Heuristic; Stochastic price; Traveling purchaser problem

Indexed keywords

APPROXIMATE ALGORITHMS; APPROXIMATION; COMMODITY PRICES; COMPUTATIONAL PERFORMANCE; EXACT SOLUTION; EXPECTED COSTS; FAST SOLUTIONS; GREEDY HEURISTICS; HEURISTIC; LARGE-SCALE APPLICATIONS; NUMERICAL RESULTS; OPTIMAL ROUTING; OPTIMUM STRATEGY; PURCHASING COSTS; STOCHASTIC PRICE; TOTAL COSTS; TRAVELING PURCHASER PROBLEM;

COST BENEFIT ANALYSIS; DYNAMIC PROGRAMMING; HEURISTIC ALGORITHMS; PROBABILITY DISTRIBUTIONS; SALES; STOCHASTIC SYSTEMS;

COSTS;

EID: 78649630096     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2010.09.012     Document Type: Article

References (47)

1. Bar-Gera, H., 2001. Transportation Network Test Problems. (accessed 10.01.09).
2. R. Bellman Dynamic programming treatment of the travelling salesman problem Journal of ACM 9 1 1962 61 63
3. D. Bertsimas, and L.H. Howell Further results on the probabilistic traveling salesman problem European Journal of Operational Research 65 1 1993 68 95
4. L. Bianchi, and A.M. Campbell Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem European Journal of Operational Research 176 1 2007 131 144
5. F.F. Boctor, L. Gilbert, and R. Jacques Heuristics for the traveling purchaser problem Computers and Operations Research 30 4 2003 491 504
6. B. Bontoux, and D. Feillet Ant colony optimization for the traveling purchaser problem Computers and Operations Research 35 2 2008 628 637
7. N.E. Bowler, T.M.A. Fink, and R.C. Ball Characterization of the probabilistic traveling salesman problem Physical Review E 68 3 2003 036703
8. J. Branke, and M. Guntsch Solving the probabilistic TSP with ant colony optimization Journal of Mathematical Modelling and Algorithms 3 4 2004 403 425 (Pubitemid 40317585)
9. A.M. Campbell, and B.W. Thomas Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines Computers and Operations Research 36 4 2009 1231 1248
10. R.L. Carraway, T.L. Morin, and H. Moskowitz Generalized dynamic programming for stochastic combinatorial optimization Operations Research 37 5 1989 819 829
11. C. Derman, G.J. Lieberman, and M.R. Sheldon A sequential stochastic assignment problem Management Science 18 7 1972 349 355
12. M. Fischetti, J.J. Salazar Gonzalez, and P. Toth A branch-and-cut algorithm for the symmetric generalized traveling salesman problem Operations Research 45 3 1997 378 394
13. B. Golden, L. Levy, and R. Dahl Two generalizations of the traveling salesman problem Omega 9 4 1981 439 441
14. G. Gutin, and A.P. Punnen The Traveling Salesman Problem and Its Variations 2002 Springer
15. R. Hassin, and M. Henig Control of arrivals and departures in a state-dependent input-output system Operations Research Letters 5 1 1986 33 36
16. M. Held, and R.M. Karp A dynamic programming approach to sequencing problems Journal of the Society for Industrial and Applied Mathematics 10 1 1962 196 210
17. A.L. Henry-Labordere The record balancing problem: A dynamic programming solution of a generalized traveling salesman problem RIRO B 2 1969 43 49
18. P. Jaillet A priori solution of a travelling salesman problem in which a random subset of the customers are visited Operations Research 36 6 1988 929 936
19. Kang, S., Kim, T., 2009. Dynamic programming approach for a concierge service problem in location-based services. Presented at the 88th Annual Meeting of Transportation Research Board, Washington, DC, January 2009.
20. S. Kang, S. Oh, and T. Kim Heuristic algorithm for solving a multimodal location-based concierge service problem Transportation Research Record: Journal of the Transportation Research Board 1972 2006 123 132
21. E.P.C. Kao A preference order dynamic program for a stochastic traveling salesman problem Operations Research 26 6 1978 1033 1045
22. D.P. Kennedy Optimal sequential assignment Mathematics of Operations Research 11 4 1986 619 626
23. W. Krauth, and M. Mezard The cavity method and the travelling-salesman problem Europhysics Letters 8 1989 213 218
24. G. Laporte, and F.V. Louveaux A priori optimization of the probabilistic traveling salesman problem Operations Research 42 3 1994 543
25. G. Laporte, and I.R. Martin Locating a cycle in a transportation or a telecommunications network Networks 50 1 2007 92 108
26. G. Laporte, H.E. Mercure, and Y. Nobert Generalized travelling salesman problem through n sets of nodes: The asymmetrical case Discrete Applied Mathematics 18 2 1987 185 197
27. T. Leipala On the solutions of stochastic traveling salesman problems European Journal of Operational Research 2 4 1978 291 297
28. Y.-H. Liu A hybrid scatter search for the probabilistic traveling salesman problem Computers and Operations Research 34 10 2007 2949 2963
29. Y.-H. Liu Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem European Journal of Operational Research 191 2 2008 332 346
30. M. Mezard, and G. Parisi A replica analysis of the travelling salesman problem Journal de Physique 47 8 1986 1285 1296
31. Noon, C.E., 1988. The generalized traveling salesman problem. Dissertation, Department of Industrial and Operations Engineering, University of Michigan.
32. H.L. Ong Approximate algorithms for the travelling purchaser problem Operations Research Letters 1 5 1982 201 205
33. J.D. Papastavrou, S. Rajagopalan, and A.J. Kleywegt The dynamic and stochastic knapsack problem with deadlines Management Science 42 12 1996 1706 1718
34. W.L. Pearn, and R.C. Chien Improved solutions for the traveling purchaser problem Computers and Operations Research 25 11 1998 879 885
35. A.G. Percus, and O.C. Martin The stochastic traveling salesman problem: Finite size scaling and the cavity prediction Journal of Statistical Physics 94 5 1999 739 758
36. T. Ramesh Traveling purchaser problem Opsearch 18 1981 78 91
37. J. Renaud, and F.F. Boctor An efficient composite heuristic for the symmetric generalized traveling salesman problem European Journal of Operational Research 108 3 1998 571 584
38. K.W. Ross, and D.H.K. Tsang The stochastic knapsack problem IEEE Transactions on Communications 37 7 1989 740 747
39. F.A. Rossi, and I. Gavioli Aspects of heuristic methods in the probabilistic traveling salesman problem G. Andreatta, F. Mason, P. Serafini, Advanced School on Stochastics in Combinatorial Optimization 1987 World Scientific 214 227
40. J.P. Saskena Mathematical model of scheduling clients through welfare agencies Journal of the Canadian Operational Research Society 8 1970 185 200
41. K.N. Singh, and D.L. van Oudheusden A branch and bound algorithm for the traveling purchaser problem European Journal of Operational Research 97 3 1997 571 579
42. M. Sniedovich Analysis of a preference order traveling salesman problem Operations Research 29 6 1981 1234 1237 (Pubitemid 12468577)
43. M. Sniedovich A dynamic programming algorithm for the traveling salesman problem SIGAPL APL Quote Quad 23 4 1993 1 3
44. L.V. Snyder, and M.S. Daskin A random-key genetic algorithm for the generalized traveling salesman problem European Journal of Operational Research 174 1 2006 38 53
45. H. Tang, and E. Miller-Hooks A tabu search heuristic for the team orienteering problem Computers and Operations Research 32 6 2005 1379 1407
46. H. Tang, and E. Miller-Hooks Solving a generalized traveling salesperson problem with stochastic customers Computers and Operations Research 34 7 2007 1963 1987
47. S. Voß Dynamic tabu search strategies for the traveling purchaser problem Annals of Operations Research 63 2 1996 253 275 (Pubitemid 126729243)