VRP with Time Windows

This paper presents a survey of the research on the Vehicle Routing Problem with Time Windows (VRPTW), an extension of the Capacitated Vehicle Routing Problem. In the VRPTW, the service at each customer must start within an associated time window and the vehicle must remain at the customer location during service. Soft time windows can be violated at a cost while hard time windows do not allow for a vehicle to arrive at a customer after the latest time to begin service. We first present a multi-commodity network flow formulation with time and capacity constraints for the VRPTW. Approximation methods proposed in the literature to derive upper bounds are then reviewed. Then we explain how lower bounds can be obtained using optimal approaches, namely, Lagrangean relaxation and column generation. Next, we provide branching and cutting strategies that can be embedded within these optimal approaches to produce integer solutions. Special cases and extensions to the VRPTW follow as well as our conclusions.

[1]  Michel Gendreau,et al.  A PARALLEL TABU SEARCH HEURISTIC FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS , 1997 .

[2]  Amos Levin.  Scheduling and Fleet Routing Models for Transportation Systems , 1971 .

[3]  Sylvie Gélinas,et al.  A new branching strategy for time constrained routing problems with application to backhauling , 1992, Ann. Oper. Res..

[4]  David Simchi-Levi,et al.  On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows , 1997, Oper. Res..

[5]  Niklas Kohl,et al.  An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation , 1997, Oper. Res..

[6]  Jonathan F. Bard,et al.  A GRASP for the Vehicle Routing Problem with Time Windows , 1995, INFORMS J. Comput..

[7]  Martin W. P. Savelsbergh,et al.  The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..

[8]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[9]  Niklas Kohl,et al.  Exact methods for time constrained routing and related scheduling problems , 1995 .

[10]  Jacques Desrosiers,et al.  A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems , 1998 .

[11]  Jacques Desrosiers,et al.  Crew pairing for a regional carrier , 1997 .

[12]  Robert A. Russell,et al.  Technical Note - An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions , 1977, Oper. Res..

[13]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[14]  Jacques Desrosiers,et al.  Daily Aircraft Routing and Scheduling , 1994 .

[15]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[16]  Kamlesh Mathur,et al.  Vehicle Routing and Scheduling with Full Truckloads , 2003, Transp. Sci..

[17]  David Simchi-Levi,et al.  The logic of logistics , 1997 .

[18]  Pierre Hansen,et al.  Stabilized column generation , 1998, Discret. Math..

[19]  David Simchi-Levi,et al.  A Location Based Heuristic for General Routing Problems , 1995, Oper. Res..

[20]  Gerhard Reinelt,et al.  The travelling salesman problem , 1995 .

[21]  Paul M. Thompson,et al.  Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems , 1993, Oper. Res..

[22]  Jacques Desrosiers,et al.  An Optimal Algorithm for the Traveling Salesman Problem with Time Windows , 1991, Oper. Res..

[23]  David Simchi-Levi,et al.  A computerized approach to the New York City school bus routing problem , 1997 .

[24]  Jesper Larsen,et al.  Parallelization of the Vehicle Routing Problem with Time Windows , 1999 .

[25]  David R. Karger,et al.  Global min-cuts in RNC, and other ramifications of a simple min-out algorithm , 1993, SODA '93.

[26]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[27]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[28]  K. W. Knight,et al.  Vehicle Scheduling with Timed and Connected Calls: A Case Study , 1968 .

[29]  Gilbert Laporte,et al.  A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..

[30]  William J. Cook,et al.  Parallel Mixed Integer Programming , 1995 .

[31]  Marius M. Solomon,et al.  On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints , 1986, Networks.

[32]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

[33]  Lucio Bianco,et al.  An Exact Algorithm for Combining Vehicle Trips , 1995 .

[34]  Arthur J. Swersey,et al.  Scheduling School Buses , 1984 .

[35]  Jacques Desrosiers,et al.  2-Path Cuts for the Vehicle Routing Problem with Time Windows , 1997, Transp. Sci..

[36]  M M Solomon,et al.  VEHICLE ROUTING AND SCHEDULING PROBLEMS WITH TIME WINDOW CONSTRAINTS: EFFICIENT IMPLEMENTATIONS OF SOLUTION IMPROVEMENT PROCEDURES , 1988 .

[37]  Marshall L. Fisher,et al.  Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees , 1994, Oper. Res..

[38]  Éric D. Taillard,et al.  Solving real-life vehicle routing problems efficiently using tabu search , 1993, Ann. Oper. Res..

[39]  Guy Desaulniers,et al.  Multi-depot vehicle scheduling problems with time windows and waiting costs , 1996, Eur. J. Oper. Res..

[40]  Jacques Desrosiers,et al.  Survey Paper - Time Window Constrained Routing and Scheduling Problems , 1988, Transp. Sci..

[41]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

[42]  Patrick Prosser,et al.  Guided Local Search for the Vehicle Routing Problem , 1997 .

[43]  H. G. M. Pullen,et al.  A computer application to a transport scheduling problem , 1967, Comput. J..

[44]  Jean-Yves Potvin,et al.  The Vehicle Routing Problem with Time Windows Part I: Tabu Search , 1996, INFORMS J. Comput..

[45]  Jacques Desrosiers,et al.  Time Window Constrained Routing and Scheduling Problems: a Survey , 1987 .

[46]  Alexander H. G. Rinnooy Kan,et al.  Vehicle Routing with Time Windows , 1987, Oper. Res..

[47]  Robert A. Russell,et al.  Hybrid Heuristics for the Vehicle Routing Problem with Time Windows , 1995, Transp. Sci..

[48]  David Simchi-Levi,et al.  Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows , 1996, Oper. Res..

[49]  G. Dantzig,et al.  The decomposition algorithm for linear programming: notes on linear programming and extensions-part 57. , 1961 .

[50]  Warren B. Powell,et al.  An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints , 1992, Transp. Sci..

[51]  Michel Gendreau,et al.  A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows , 1998, Oper. Res..

[52]  Gilbert Laporte,et al.  A Tabu Search Algorithm For The Site Dependent Vehicle Routing Problem With Time Windows , 2001 .

[53]  J. Desrosiers,et al.  A dynamic programming algorithm for the shortest path problem with time windows and linear node costs , 1998 .

[54]  José Brandão.  Metaheuristic for the vehicle routing problem with time windows , 1999 .

[55]  M. Savelsbergh.  An efficient implementation of local search algorithms for constrained routing problems , 1990 .

[56]  Samy Bengio,et al.  The Vehicle Routing Problem with Time Windows Part II: Genetic Search , 1996, INFORMS J. Comput..

[57]  Jürgen Schulze,et al.  A parallel algorithm for the vehicle routing problem with time window constraints , 1999, Ann. Oper. Res..

[58]  Pavel Petrovic,et al.  Introduction to genetic heuristics and vehicle routing problems with complex constraints , 1997 .

[59]  M. Desrochers,et al.  A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows , 1988 .

[60]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[61]  Jacques Desrosiers,et al.  The Pickup and Delivery Problem with Time Windows , 1989 .

[62]  R. Cordone,et al.  A Heuristic for the Vehicle Routing Problem with Time Windows , 2001 .

[63]  Lucio Bianco,et al.  Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints , 1997, Oper. Res..

[64]  Ibrahim H. Osman,et al.  Hybrid Genetic Algorithm, Simulated Annealing and Tabu Search Methods for Vehicle Routing Problems with Time Windows , 1997 .

[65]  Sylvie Gélinas,et al.  A dynamic programming algorithm for the shortest path problem with time windows and linear node costs , 1994, Networks.

[66]  Jean-Yves Potvin,et al.  A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

[67]  William R. Cook,et al.  A Parallel Cutting-Plane Algorithm for the Vehicle Routing Problem With Time Windows , 1999 .

[68]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.

[69]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

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

[71]  Roger L. Wainwright,et al.  Multiple Vehicle Routing with Time and Capacity Constraints Using Genetic Algorithms , 1993, ICGA.

[72]  Jörg Homberger,et al.  Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows , 1999 .

[73]  Leif H. Appelgren,et al.  A Column Generation Algorithm for a Ship Scheduling Problem , 1969 .

[74]  Marshall L. Fisher,et al.  Vehicle Routing with Time Windows: Two Optimization Algorithms , 1997, Oper. Res..

[75]  Thomas M. Cook,et al.  A SIMULATION AND STATISTICAL ANALYSIS OF STOCHASTIC VEHICLE ROUTING WITH TIMING CONSTRAINTS , 1978 .

[76]  G. Dantzig,et al.  THE DECOMPOSITION ALGORITHM FOR LINEAR PROGRAMS , 1961 .

[77]  Fuh-hwa Franklin Liu,et al.  An overview of a heuristic for vehicle routing problem with time windows , 1999 .

[78]  Wen-Chyuan Chiang,et al.  Simulated annealing metaheuristics for the vehicle routing problem with time windows , 1996, Ann. Oper. Res..

[79]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[80]  Wen-Chyuan Chiang,et al.  A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows , 1997, INFORMS J. Comput..

[81]  L. Appelgren.  Integer Programming Methods for a Vessel Scheduling Problem , 1971 .

[82]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[83]  Jean-Yves Potvin,et al.  An Exchange Heuristic for Routeing Problems with Time Windows , 1995 .