The multi-path Traveling Salesman Problem with stochastic travel costs

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.

[1]  Richard W. Eglese,et al.  Disruption management of the vehicle routing problem with vehicle breakdown , 2011, J. Oper. Res. Soc..

[2]  Marius M. Solomon,et al.  The A Priori Dynamic Traveling Salesman Problem with Time Windows , 2004, Transp. Sci..

[3]  L. B. Fu,et al.  Expected Shortest Paths in Dynamic and Stochastic Traf c Networks , 1998 .

[4]  Nicola Secomandi,et al.  Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands , 2009, Oper. Res..

[5]  Tom Van Woensel,et al.  Vehicle routing problem with stochastic travel times including soft time windows and service costs , 2013, Comput. Oper. Res..

[6]  Guido Perboli,et al.  The stochastic generalized bin packing problem , 2012, Discret. Appl. Math..

[7]  Guido Perboli,et al.  The Multi-path traveling salesman problem with stochastic travel costs: building realistic instances for city logistics applications , 2014 .

[8]  J. Potvin,et al.  A dynamic capacitated arc routing problem with time-dependent service costs , 2011 .

[9]  Roberto Musmanno,et al.  Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies , 2003, Eur. J. Oper. Res..

[10]  John N. Tsitsiklis,et al.  Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs , 1993, Oper. Res..

[11]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[12]  Guido Perboli,et al.  The capacitated transshipment location problem under uncertainty: A computational study , 2012 .

[13]  Gilbert Laporte,et al.  The time-dependent pollution-routing problem , 2013 .

[14]  Michal Kaut,et al.  Stochastic optimization models for a single-sink transportation problem , 2009, Comput. Manag. Sci..

[15]  David P. Morton,et al.  Stochastic Vehicle Routing with Random Travel Times , 2003, Transp. Sci..

[16]  Marida Bertocchi,et al.  Bounds in Multistage Linear Stochastic Programming , 2014, J. Optim. Theory Appl..

[17]  Teodor Gabriel Crainic,et al.  Impact of generalized travel costs on satellite location in the Two-Echelon Vehicle Routing Problem , 2012 .

[18]  Michel Gendreau,et al.  A review of dynamic vehicle routing problems , 2013, Eur. J. Oper. Res..

[19]  Michel X. Goemans,et al.  Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem , 1991, Math. Oper. Res..

[20]  W. G. Hansen.  How Accessibility Shapes Land Use , 1959 .

[21]  Luca Bertazzi,et al.  The Stochastic Capacitated Traveling Salesmen Location Problem: A Computational Comparison for a United States Instance☆ , 2014 .

[22]  E. J. Gumbel,et al.  Statistics of Extremes. , 1960 .

[23]  Timo Leipälä,et al.  On the solutions of stochastic traveling salesman problems , 1978 .

[24]  Elisabetta Allevi,et al.  Stochastic Second-Order Cone Programming in Mobile Ad Hoc Networks , 2009 .

[25]  Bernhard Fleischmann,et al.  Dynamic Vehicle Routing Based on Online Traffic Information , 2004, Transp. Sci..

[26]  Guido Perboli,et al.  The Influence of Time Windows on the Costs of Urban Freight Distribution Services in City Logistics Applications , 2012 .

[27]  Hossein Soroush,et al.  Path Preferences and Optimal Paths in Probabilistic Networks , 1985, Transp. Sci..

[28]  Eiichi Taniguchi,et al.  INTELLIGENT TRANSPORTATION SYSTEM BASED DYNAMIC VEHICLE ROUTING AND SCHEDULING WITH VARIABLE TRAVEL TIMES , 2004 .

[29]  M. Figliozzi.  The impacts of congestion on time-definitive urban freight distribution networks CO2 emission levels: Results from a case study in Portland, Oregon , 2011 .

[30]  Kyungsik Lee,et al.  Robust vehicle routing problem with deadlines and travel time/demand uncertainty , 2012, J. Oper. Res. Soc..

[31]  Robert H. Storer,et al.  An approximate dynamic programming approach for the vehicle routing problem with stochastic demands , 2009, Eur. J. Oper. Res..

[32]  E. Ziegel.  Extreme Value Theory and Applications , 1994 .

[33]  Gilbert Laporte,et al.  STOCHASTIC VEHICLE ROUTING. , 1996 .

[34]  Gilbert Laporte,et al.  Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic , 2006, Transp. Sci..

[35]  Gilbert Laporte,et al.  A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems , 2007, Networks.

[36]  Denis Borenstein,et al.  Real-time vehicle rerouting problems with time windows , 2009, Eur. J. Oper. Res..

[37]  Alejandro Toriello,et al.  A Dynamic Traveling Salesman Problem with Stochastic Arc Costs , 2014, Oper. Res..

[38]  Anthony C. Davison,et al.  Statistics of Extremes , 2015, International Encyclopedia of Statistical Science.

[39]  John R. Birge,et al.  Introduction to Stochastic Programming , 1997 .

[40]  Dirk C. Mattfeld,et al.  A Computational Study , 1996 .

[41]  Gilbert Laporte,et al.  A review of recent research on green road freight transportation , 2014, Eur. J. Oper. Res..

[42]  José Ramón Gil-García,et al.  Understanding Smart Cities: An Integrative Framework , 2012, HICSS.

[43]  Gilbert Laporte,et al.  Waiting strategies for the dynamic pickup and delivery problem with time windows , 2004 .

[44]  Ratna Babu Chinnam,et al.  Dynamic routing under recurrent and non-recurrent congestion using real-time ITS information , 2012, Comput. Oper. Res..

[45]  Denis Borenstein,et al.  A Lagrangian Heuristic for the Real-Time Vehicle Rescheduling Problem , 2009 .

[46]  Lauri Häme,et al.  Dynamic journeying under uncertainty , 2013, Eur. J. Oper. Res..

[47]  Glen Weisbrod,et al.  ECONOMIC IMPLICATIONS OF CONGESTION , 2001 .

[48]  William J. Cook,et al.  In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation , 2011 .

[49]  Herbert Peremans,et al.  Vehicle routing with stochastic time-dependent travel times , 2009, 4OR.

[50]  Michel Gendreau,et al.  Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching , 1999, Transp. Sci..

[51]  Guido Perboli,et al.  The capacitated transshipment location problem with stochastic handling utilities at the facilities , 2012, Int. Trans. Oper. Res..

[52]  J. Lenstra,et al.  In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation , 2016 .

[53]  Patrick Jaillet,et al.  A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited , 1988, Oper. Res..

[54]  Jean-Yves Potvin,et al.  Vehicle Routing , 2009, Encyclopedia of Optimization.

[55]  Patrick Jaillet,et al.  Routing Optimization with Deadlines under Uncertainty , 2022 .

[56]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[57]  Bruce L. Golden,et al.  The vehicle routing problem : latest advances and new challenges , 2008 .

[58]  Miguel A. Figliozzi,et al.  Impacts of Congestion on Commercial Vehicle Tour Characteristics and Costs , 2010 .

[59]  Gilbert Laporte,et al.  Dynamic transportation of patients in hospitals , 2010, OR Spectr..

[60]  Daniele Vigo,et al.  The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics , 2011, Transp. Sci..

[61]  Miguel A. Figliozzi,et al.  An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows , 2010 .

[62]  Stein W. Wallace,et al.  Analyzing the quality of the expected value solution in stochastic programming , 2012, Ann. Oper. Res..

[63]  Dimitris Bertsimas,et al.  A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane , 1991, Oper. Res..

[64]  Michel Gendreau,et al.  Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching , 2006, Transp. Sci..

[65]  Mei-Shiang Chang,et al.  The real-time time-dependent vehicle routing problem , 2006 .

[66]  Gilbert Laporte,et al.  Dynamic pickup and delivery problems , 2010, Eur. J. Oper. Res..