The multi-path Traveling Salesman Problem with stochastic travel costs

EURO Journal on Transportation and Logistics

Volumn 6, Issue 1, 2017, Pages 3-23

  Tadei, Roberto ^a   Perboli, Guido ^a,b   Perfetti, Francesca ^a  

^a POLITECNICO DI TORINO   (Italy)

^b INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

Author keywords

Deterministic approximation; Multiple paths; Stochastic travel costs; TSP

Indexed keywords

COSTS; INTELLIGENT SYSTEMS; MONTE CARLO METHODS; PROBABILITY DISTRIBUTIONS; STOCHASTIC SYSTEMS;

COMPUTATIONAL TIME; DETERMINISTIC APPROXIMATION; HAMILTONIAN TOUR; MEAN PERCENTAGE; MULTIPLE-PATH; ORDERS OF MAGNITUDE; STOCHASTIC PROBLEMS; TRAVEL COSTS;

TRAVELING SALESMAN PROBLEM;

EID: 85064288967     PISSN: 21924376     EISSN: 21924384     Source Type: Journal    
DOI: 10.1007/s13676-014-0056-2     Document Type: Article

References (44)

1. Applegate DL, Bixby RE, Chvátal V, Cook WJ (2007) The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton
2. Baldi MM, Ghirardi M, Perboli G, Tadei R (2012) The capacitated transshipment location problem under uncertainty: A computational study. Procedia - Social and Behavioral Sciences 39:424–436
3. Berbeglia G, Cordeau J-F, Laporte G (2010) Dynamic pickup and delivery problems. Eur J Operat Res 202:8–15
4. Bertsimas D, Van Ryzin G (1991) A stochastic and dynamic vehicle-routing problem in the Euclidean plane. Operat Res 39:601–615
5. Birge JR and Louveaux FV (1997) Introduction to stochastic programming. Springer
6. Chourabi H, Nam T, Walker S, Gil-Garcia JR, Mellouli S, Nahon K, Pardo TA, Scholl HJ (2012) Understanding smart cities: An integrative framework. Proceedings of the 2012 45th Hawaii International Conference on System Sciences HICSS ’12. IEEE Computer Society, Washington, pp 2289–2297
7. CITYLOG Consortium (2010). CITYLOG European project
8. Cook WJ (2012) In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation. Princeton University Press, Princeton
9. Cordeau J-F, Laporte G, Savelsbergh M, Vigo D (2007) Vehicle Routing. In: Barnhart C, Laporte G (eds) Transportation Handbooks on Operations Research and Management Science. North Holland, Amsterdam, pp 367–428
10. Demir E, Bektas T, Laporte G (2014) A Review of Recent Research on Green Road Freight Transportation. Eur J Operat Res 237:775–793
11. Eiger A, Mirchandani PB, Soroush H (1985) Path preferences and optimal paths in probabilistic networks. Transportation Science 19:75–84
12. Figliozzi MA (2010) The impacts of congestion on commercial vehicle tour characteristics and costs. Transp res part E: logist transp rev 46:496–506
13. Figliozzi MA (2010) An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows. Transp Res Part C: Emerg Technol 18:668–679
14. Figliozzi MA (2011) The impacts of congestion on time-definitive urban freight distribution networks CO2 emission levels: Results from a case study in Portland, Oregon. Transp Res Part C: Emerg Technol 19:766–778
15. Franceschetti A, Honhon D, Van Woensel T, Bektaş T, Laporte G (2013) The time-dependent pollution-routing problem. Transp Res Part B: Methodol 56:265–293
16. Galambos J, Lechner J, Simiu E (1994) Extreme Value Theory and Applications. Kluwer
17. Gendreau M, Laporte G, Séguin R (1996) Stochastic vehicle routing. Eur J Operat Res 88:3–12
18. Ghiani G, Guerriero F, Laporte G, Musmanno R (2003) Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. Eur J Operat Res 151:1–11
19. Goemans MX, Bertsimas D (1991) Probabilistic analysis of the Held and Karp lower bound for the Euclidean traveling salesman problem. Math Operat Res 16:72–89
20. Golden BL, Raghavan S, Wasil EA (2008) The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, New York
21. Gumbel EJ (1958) Statistics of Extremes. Columbia University Press, Columbia
22. Güner AR, Murat A, Chinnam RB (2012) Dynamic routing under recurrent and non-recurrent congestion using real-time ITS information. Comput Operat Res 39:358–373
23. Hame L, Hakula H (2013) Dynamic journeying under uncertainty. Eur J Operat Res 225:455–471
24. Hansen W (1959) How accessibility shapes land use. J Am Inst Planners 25:73–76
25. Hvattum LM, Lokketangen A, Laporte G (2006) Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic. Transp Sci 40:421–438
26. Hvattum LM, Lokketangen A, Laporte G (2007) A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems. Networks 49:330–340
27. Ichoua S, Gendreau M, Potvin J-Y (2006) Exploiting knowledge about future demands for real-time vehicle dispatching. Transp Sci 40:211–225
28. Jaillet P (1988) A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Operat Res 36:929–936
29. Jaillet P, Melvyn Sim JQ (2013) Routing Optimization with Deadlines under Uncertainty. “Tech. Rep”. MIT
30. Kenyon AS, Morton DP (2003) Stochastic vehicle routing with random travel times. Transp Sci 37:69–82
31. Lecluyse C, van Woensel T, Peremans H (2009) Vehicle routing with stochastic time-dependent travel times. 4OR 7:363–377
32. Lee C, Lee K, Park S (2012) Robust vehicle routing problem with deadlines and travel time/demand uncertainty. J Operat Res Soc 63:1294–1306
33. Leipala T (1978) On the solutions of stochastic traveling salesman problems. EurJOperat Res 2:291–297
34. Maggioni F, Kaut M, Bertazzi L (2009) Stochastic optimization models for a single-sink transportation problem.Comput Manag Sci 6:251–267
35. Maggioni F, Wallace S (2012) Analyzing the quality of the expected value solution in stochastic programming. Annals Operat Res 200:37–54
36. Perboli G, Tadei R, Baldi MM (2012) The stochastic generalized bin packing problem. Discrete Appl Math 160:1291–1297
37. Perboli G, Tadei R, Vigo D (2011) The two-echelon capacitated vehicle routing problem: Models and math-based heuristics.Transp Sci 45:364–380
38. Pillac V, Gendreau M, Guéret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur J Operat Res 225:1–11
39. Psaraftis HN, Tsitsiklis JN (1993) Dynamic shortest paths in acyclic networks with markovian arc costs. Operat Res 41:91–101
40. Reinelt G (1991) TSPLIB- a traveling salesman problem library. ORSA J Comput 3:376–384
41. Tadei R, Perboli G, Ricciardi N, Baldi MM (2012) The capacitated transshipment location problem with stochastic handling utilities at the facilities. Int Trans Operat Res 19:789–807
42. Taş D, Dellaert N, Van Woensel T, De Kok T (2013) Vehicle routing problem with stochastic travel times including soft time windows and service costs. Comput Biomed Res Operat Res 40:214–224
43. Toriello A, Haskell WB,Poremba M (2012) A Dynamic Traveling Salesman Problem with Stochastic Arc Costs. Technical Report Optimization Online
44. Weisbrod G, Vary D, Treyz G (2001) Economic implications of congestion. Project A2–21 FY’97