Skip to main content
SpringerLink
Log in

The multi-path Traveling Salesman Problem with stochastic travel costs

  • Research Paper
  • Published:
EURO Journal on Transportation and Logistics

Abstract

Given a set of nodes, where each pair of nodes is connected by several paths and each path shows a stochastic travel cost with unknown probability distribution, the multi-path Traveling Salesman Problem with stochastic travel costs aims at finding an expected minimum Hamiltonian tour connecting all nodes. Under a mild assumption on the unknown probability distribution, a deterministic approximation of the stochastic problem is given. The comparison of such approximation with a Monte Carlo simulation shows both the accuracy and the efficiency of the deterministic approximation, with a mean percentage gap around 2% and a reduction of the computational times of two orders of magnitude.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  • Applegate DL, Bixby RE, Chvátal V, Cook WJ (2007) The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton

    Google Scholar 

  • 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

    Article  Google Scholar 

  • Berbeglia G, Cordeau J-F, Laporte G (2010) Dynamic pickup and delivery problems. Eur J Operat Res 202:8–15

    Article  Google Scholar 

  • Bertsimas D, Van Ryzin G (1991) A stochastic and dynamic vehicle-routing problem in the Euclidean plane. Operat Res 39:601–615

    Article  Google Scholar 

  • Birge JR and Louveaux FV (1997) Introduction to stochastic programming. Springer

  • 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

    Chapter  Google Scholar 

  • CITYLOG Consortium (2010). CITYLOG European project

  • Cook WJ (2012) In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation. Princeton University Press, Princeton

    Google Scholar 

  • 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

    Google Scholar 

  • Demir E, Bektas T, Laporte G (2014) A Review of Recent Research on Green Road Freight Transportation. Eur J Operat Res 237:775–793

    Article  Google Scholar 

  • Eiger A, Mirchandani PB, Soroush H (1985) Path preferences and optimal paths in probabilistic networks. Transportation Science 19:75–84

    Article  Google Scholar 

  • Figliozzi MA (2010) The impacts of congestion on commercial vehicle tour characteristics and costs. Transp res part E: logist transp rev 46:496–506

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • Galambos J, Lechner J, Simiu E (1994) Extreme Value Theory and Applications. Kluwer

  • Gendreau M, Laporte G, Séguin R (1996) Stochastic vehicle routing. Eur J Operat Res 88:3–12

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • Golden BL, Raghavan S, Wasil EA (2008) The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, New York

  • Gumbel EJ (1958) Statistics of Extremes. Columbia University Press, Columbia

    Google Scholar 

  • 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

    Article  Google Scholar 

  • Hame L, Hakula H (2013) Dynamic journeying under uncertainty. Eur J Operat Res 225:455–471

    Article  Google Scholar 

  • Hansen W (1959) How accessibility shapes land use. J Am Inst Planners 25:73–76

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • Hvattum LM, Lokketangen A, Laporte G (2007) A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems. Networks 49:330–340

    Article  Google Scholar 

  • Ichoua S, Gendreau M, Potvin J-Y (2006) Exploiting knowledge about future demands for real-time vehicle dispatching. Transp Sci 40:211–225

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • Jaillet P, Melvyn Sim JQ (2013) Routing Optimization with Deadlines under Uncertainty. “Tech. Rep”. MIT

  • Kenyon AS, Morton DP (2003) Stochastic vehicle routing with random travel times. Transp Sci 37:69–82

    Article  Google Scholar 

  • Lecluyse C, van Woensel T, Peremans H (2009) Vehicle routing with stochastic time-dependent travel times. 4OR 7:363–377

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • Leipala T (1978) On the solutions of stochastic traveling salesman problems. EurJOperat Res 2:291–297

    Google Scholar 

  • Maggioni F, Kaut M, Bertazzi L (2009) Stochastic optimization models for a single-sink transportation problem.Comput Manag Sci 6:251–267

    Article  Google Scholar 

  • Maggioni F, Wallace S (2012) Analyzing the quality of the expected value solution in stochastic programming. Annals Operat Res 200:37–54

    Article  Google Scholar 

  • Perboli G, Tadei R, Baldi MM (2012) The stochastic generalized bin packing problem. Discrete Appl Math 160:1291–1297

    Article  Google Scholar 

  • Perboli G, Tadei R, Vigo D (2011) The two-echelon capacitated vehicle routing problem: Models and math-based heuristics.Transp Sci 45:364–380

    Article  Google Scholar 

  • Pillac V, Gendreau M, Guéret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur J Operat Res 225:1–11

    Article  Google Scholar 

  • Psaraftis HN, Tsitsiklis JN (1993) Dynamic shortest paths in acyclic networks with markovian arc costs. Operat Res 41:91–101

    Article  Google Scholar 

  • Reinelt G (1991) TSPLIB- a traveling salesman problem library. ORSA J Comput 3:376–384

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • Toriello A, Haskell WB,Poremba M (2012) A Dynamic Traveling Salesman Problem with Stochastic Arc Costs. Technical Report Optimization Online

  • Weisbrod G, Vary D, Treyz G (2001) Economic implications of congestion. Project A2–21 FY’97

Download references

Acknowledgments

Partial funding was provided by the Regional Council of Piedmont (Italy) under the ”PIE VERDE” project, P.O.R.— FESR 2007-2013— ”AUTOMOTIVE”, and by the Italian University and Research Ministry under the UrbeLOG project-Smart Cities and Communities.

Author information

Authors and Affiliations

  1. Politecnico di Torino, Turin, Italy

    Roberto Tadei, Guido Perboli & Francesca Perfetti

  2. CIRRELT, Montreal, Canada

    Guido Perboli

Authors
  1. Roberto Tadei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guido Perboli
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Francesca Perfetti
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Roberto Tadei.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tadei, R., Perboli, G. & Perfetti, F. The multi-path Traveling Salesman Problem with stochastic travel costs. EURO J Transp Logist 6, 3–23 (2017). https://doi.org/10.1007/s13676-014-0056-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13676-014-0056-2

Keywords

Search

Navigation