Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies

Abstract In real-time fleet management, vehicle routes are built in an on-going fashion as vehicle locations, travel times and customer requests are revealed over the planning horizon. To deal with such problems, a new generation of fast on-line algorithms capable of taking into account uncertainty is required. Although several articles on this topic have been published, the literature on real-time vehicle routing is still disorganized. In this paper the research in this field is reviewed and some issues that have not received attention so far are highlighted. A particular emphasis is put on parallel computing strategies.

[1]  Richard F. Poist,et al.  Assigning Organisational Responsibility for Interface Activities: An Analysis of PD and Marketing Manager Preferences , 1984 .

[2]  Gilbert Laporte,et al.  Solving an ambulance location model by tabu search , 1997 .

[3]  Oli B. G. Madsen,et al.  A heuristic method for dispatching repair men , 1995, Ann. Oper. Res..

[4]  P. K. Bagchi,et al.  Dynamic Vehicle Scheduling: An Expert Systems Approach , 1991 .

[5]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[6]  Martin W. P. Savelsbergh,et al.  Drive: Dynamic Routing of Independent Vehicles , 1998, Oper. Res..

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

[8]  Marc Goetschalckx A Decision Support System for Dynamic Truck Despatching , 1988 .

[9]  Gilbert Laporte,et al.  Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem , 2004, Parallel Comput..

[10]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[11]  Harilaos N. Psaraftis,et al.  A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .

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

[13]  Pierre Hansen,et al.  Variable Neighbourhood Search , 2003 .

[14]  Teodor Gabriel Crainic,et al.  Fleet management and logistics , 1998 .

[15]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem , 2002 .

[16]  Jason D. Papastavrou,et al.  A stochastic and dynamic model for the single-vehicle pick-up and delivery problem , 1999, Eur. J. Oper. Res..

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

[18]  Jean-Yves Potvin,et al.  Neural networks for automated vehicle dispatching , 1992, Comput. Oper. Res..

[19]  Oli B. G. Madsen,et al.  A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives , 1995, Ann. Oper. Res..

[20]  Brian Kallehauge,et al.  The Vehicle Routing Problem with Time Windows , 2006, Vehicle Routing.

[21]  Gilbert Laporte,et al.  Ambulance location and relocation models , 2000, Eur. J. Oper. Res..

[22]  Michel Gendreau,et al.  A dynamic model and parallel tabu search heuristic for real-time ambulance relocation , 2001, Parallel Comput..

[23]  Warren B. Powell,et al.  Stochastic and dynamic networks and routing , 1995 .

[24]  Vladimir Vacic,et al.  VEHICLE ROUTING PROBLEM WITH TIME WINDOWS , 2014 .

[25]  Chryssi Malandraki,et al.  Time dependent vehicle routing problems : formulations, solution algorithms and computational experiments , 1989 .

[26]  Jean-Yves Potvin,et al.  Learning vehicle dispatching with linear programming models , 1993, Comput. Oper. Res..

[27]  D. H. Mellor,et al.  Real time , 1981 .

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

[29]  Rajkumar Buyya,et al.  High Performance Cluster Computing: Architectures and Systems , 1999 .

[30]  Michel Gendreau,et al.  DYNAMIC VEHICLE ROUTING AND DISPATCHING , 1998 .

[31]  Michel Gendreau,et al.  Diversion Issues in Real-Time Vehicle Dispatching , 2000, Transp. Sci..

[32]  M. Savelsbergh,et al.  The Inventory Routing Problem , 1998 .

[33]  Allan Larsen,et al.  The Dynamic Vehicle Routing Problem , 2000 .

[34]  J. Papastavrou A stochastic and dynamic routing policy using branching processes with state dependent immigration , 1996 .

[35]  Gerald G. Brown,et al.  Real-Time Dispatch of Petroleum Tank Trucks , 1981 .

[36]  S Roy ROUTING AND SCHEDULING OF TRANSPORTATION SERVICES FOR THE DISABLED: SUMMARY REPORT , 1984 .

[37]  C. Rego,et al.  Using Tabu search for solving a dynamic multi-terminal truck dispatching problem , 1995 .

[38]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

[39]  Michel Gendreau,et al.  TOWARDS A TAXONOMY OF PARALLEL TABU SEARCH ALGORITHMS. , 1993 .

[40]  G Laporte,et al.  An emergency vehicle dispatching system for an electric utility in Chile , 1999, J. Oper. Res. Soc..

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

[42]  Marius M. Solomon,et al.  Partially dynamic vehicle routing—models and algorithms , 2002, J. Oper. Res. Soc..

[43]  I H Osman,et al.  Meta-Heuristics Theory and Applications , 2011 .

[44]  Warren B. Powell,et al.  A Stochastic Model of the Dynamic Vehicle Allocation Problem , 1986, Transp. Sci..

[45]  Michel Gendreau,et al.  Toward a Taxonomy of Parallel Tabu Search Heuristics , 1997, INFORMS J. Comput..

[46]  Rajkumar Buyya,et al.  High Performance Cluster Computing , 1999 .

[47]  Gilbert Laporte,et al.  Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows , 2004 .

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

[49]  Harilaos N. Psaraftis,et al.  Dynamic vehicle routing: Status and prospects , 1995, Ann. Oper. Res..

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

[51]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[52]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..