Waiting Strategies for Dynamic Vehicle Routing

Many real-world vehicle routing problems are dynamic optimization problems, with customer requests arriving over time, requiring a repeated reoptimization. In this paper, we consider a dynamic vehicle routing problem where one additional customer arrives at a beforehand unknown location when the vehicles are already under way. Our objective is to maximize the probability that the additional customer can be integrated into one of the otherwise fixed tours without violating time constraints. This is achieved by letting the vehicles wait at suitable locations during their tours, thus influencing the position of the vehicles at the time when the new customer arrives. For the cases of one and two vehicles, we derive theoretical results about the best waiting strategies. The general problem is shown to be NP-complete. Several deterministic waiting strategies and an evolutionary algorithm to optimize the waiting strategy are proposed and compared empirically. It is demonstrated that a proper waiting strategy can significantly increase the probability of being able to service the additional customer, at the same time reducing the average detour to serve that customer.

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

[2]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

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

[4]  Hani S. Mahmassani,et al.  Evaluation of Dynamic Fleet Management Systems: Simulation Framework , 1998 .

[5]  Patrick Prosser,et al.  Dynamic VRPs: A Study of Scenarios , 1998 .

[6]  Jürgen Branke,et al.  Anticipation in Dynamic Optimization: The Scheduling Case , 2000, PPSN.

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[9]  Hani S. Mahmassani,et al.  IMPROVING EFFICIENCY OF COMMERCIAL VEHICLE OPERATIONS USING REAL-TIME INFORMATION: POTENTIAL USES AND ASSIGNMENT STRATEGIES , 1995 .

[10]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

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

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

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

[14]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[15]  Jürgen Branke,et al.  Evolutionary Optimization in Dynamic Environments , 2001, Genetic Algorithms and Evolutionary Computation.

[16]  Chelsea C. White,et al.  Anticipatory Route Selection , 2004, Transp. Sci..

[17]  Hani S. Mahmassani,et al.  On-Line Algorithms for Truck Fleet Assignment and Scheduling Under Real-Time Information , 1999 .

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

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

[20]  Warren B. Powell,et al.  On the Value of Optimal Myopic Solutions for Dynamic Routing and Scheduling Problems in the Presence of User Noncompliance , 2000, Transp. Sci..

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

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

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

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

[25]  Leonora Bianchi.  Notes on dynamic vehicle routing - the state of the art - , 2000 .

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

[27]  J. Branke.  Reducing the sampling variance when searching for robust solutions , 2001 .

[28]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (3rd ed.) , 1996 .

[29]  Michel Gendreau,et al.  A SOLUTION PROCEDURE FOR REAL-TIME ROUTING AND DISPATCHING OF COMMERCIAL VEHICLES , 1996 .

[30]  Hani S. Mahmassani,et al.  Dynamic Decision Making for Commercial Fleet Operations Using Real-Time Information , 1996 .

[31]  Warren B. Powell,et al.  A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers , 1996, Transp. Sci..