Time-dependent vehicle routing subject to time delay perturbations

This paper extends the existing vehicle routing models by incorporating unanticipated delays at the customers' docking stations in time-dependent environments, i.e., where speeds are not constant throughout the planning horizon. A model is presented that is capable of optimizing the relevant costs taking into account these unplanned delays. The theoretical implications on the composition of the routing schedules are examined in detail. Experiments using a Tabu Search heuristic on a large number of datasets are provided. Based on these experiments, the generated routing schedules are analyzed and the cost-benefit trade-off between routing schedules that are protected against delays and routing schedules that are not protected against these delays are examined. Structural properties of the different solutions that have higher endurance capabilities with regards to the disruptions are highlighted.

[1]  Ángel Corberán,et al.  Separating capacity constraints in the CVRP using tabu search , 1998, Eur. J. Oper. Res..

[2]  Arkadi Nemirovski,et al.  Robust Convex Optimization , 1998, Math. Oper. Res..

[3]  D. Bertsimas,et al.  STOCHASTIC AND DYNAMIC VEHICLE ROUTING PROBLEM IN THE EUCLIDEAN PLANE WITH MULTIPLE CAPACITATED VEHICLES. , 1993 .

[4]  D. Bertsimas,et al.  Stochastic and dynamic vehicle routing with general demand and interarrival time distributions , 1993, Advances in Applied Probability.

[5]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Capacitated Arc Routing Problem , 2000, Oper. Res..

[6]  Chryssi Malandraki,et al.  A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem , 1996 .

[7]  Roel Leus,et al.  Meta-heuristics for stable scheduling on a single machine , 2008, Comput. Oper. Res..

[8]  A Ben Tal,et al.  ROBUST SOLUTIONS TO UNCERTAIN PROGRAMS , 1999 .

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

[10]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[11]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[12]  Arthur V. Hill,et al.  Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems , 1992 .

[13]  Michel Gendreau,et al.  Vehicle dispatching with time-dependent travel times , 2003, Eur. J. Oper. Res..

[14]  Dimitris Bertsimas,et al.  Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles , 1993, Oper. Res..

[15]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers , 1996, Oper. Res..

[16]  Gilbert Laporte,et al.  What you should know about the vehicle routing problem , 2007 .

[17]  János Barta,et al.  The Robust Traveling Salesman Problem with Interval Data , 2006, Transp. Sci..

[18]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

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

[20]  David Simchi-Levi,et al.  A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty , 1996, Oper. Res..

[21]  Nico Vandaele,et al.  Empirical validation of a queueing approach to uninterrupted traffic flows , 2006, 4OR.

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

[23]  Shigeyoshi Tsutsui,et al.  Genetic algorithms with a robust solution searching scheme , 1997, IEEE Trans. Evol. Comput..

[24]  Mark S. Daskin,et al.  Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms , 1992, Transp. Sci..

[25]  Jean-Yves Potvin,et al.  A computer assistant for vehicle dispatching with learning capabilities , 1995, Ann. Oper. Res..

[26]  Kenneth Sörensen,et al.  Finding Robust Solutions Using Local Search , 2004, J. Math. Model. Algorithms.

[27]  Ali Haghani,et al.  A dynamic vehicle routing problem with time-dependent travel times , 2005, Comput. Oper. Res..

[28]  Gilbert Laporte,et al.  The Vehicle Routing Problem with Stochastic Travel Times , 1992, Transp. Sci..

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

[30]  Arkadi Nemirovski,et al.  Robust solutions of uncertain linear programs , 1999, Oper. Res. Lett..

[31]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[32]  F. Ordóñez,et al.  A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty , 2008 .

[33]  Willy Herroelen,et al.  The construction of stable project baseline schedules , 2004, Eur. J. Oper. Res..

[34]  Nico Vandaele,et al.  Vehicle routing with dynamic travel times: A queueing approach , 2008, Eur. J. Oper. Res..

[35]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[36]  Kenneth Sörensen,et al.  Finding robust solutions using local search , 2004 .

[37]  Bernhard Fleischmann,et al.  Time-Varying Travel Times in Vehicle Routing , 2004, Transp. Sci..

[38]  Ali Haghani,et al.  Genetic Algorithm for the Time-Dependent Vehicle Routing Problem , 2001 .

[39]  Willy Herroelen,et al.  Scheduling for stability in single-machine production systems , 2007, J. Sched..

[40]  Gerald G. Brown,et al.  Real-Time, Wide Area Dispatch of Mobil Tank Trucks , 1987 .

[41]  Willy Herroelen,et al.  The complexity of machine scheduling for stability with a single disrupted job , 2005, Oper. Res. Lett..