Recent progress of local search in handling the time window constraints of the vehicle routing problem

Vehicle routing and scheduling problems have a wide range of applications and have been intensively studied in the past half century. The condition that enforces each vehicle to start service at each customer in the period specified by the customer is called the time window constraint. This paper reviews recent results on how to handle hard and soft time window constraints, putting emphasis on its different definitions and algorithms. With these diverse time windows, the problem becomes applicable to a wide range of real-world problems.

[1]  Yuichi Nagata.  Efficient evolutionary algorithm for the vehicle routing problem with time windows: edge assembly crossover for the VRPTW , 2007, 2007 IEEE Congress on Evolutionary Computation.

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

[3]  Hisashi Tamaki,et al.  Parallel Machine Scheduling Problem with a Non-Regular Objective Function , 1999 .

[4]  Andrew Lim,et al.  A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows , 2007, INFORMS J. Comput..

[5]  Gilbert Laporte,et al.  A Composite Very-Large-Scale Neighborhood Search Algorithm for the Vehicle Routing Problem , 2004, Handbook of Scheduling.

[6]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[7]  Ravindra K. Ahuja,et al.  A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints , 2001, Oper. Res..

[8]  Toshihide Ibaraki,et al.  Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT , 1999, J. Comb. Optim..

[9]  Yunchuan Sun,et al.  Using Ant Colony System and Local Search Methods to Solve VRPTW , 2008, 2008 IEEE Pacific-Asia Workshop on Computational Intelligence and Industrial Application.

[10]  Maurice Queyranne,et al.  Minimizing a Convex Cost Closure Set , 2003, SIAM J. Discret. Math..

[11]  Hideki Hashimoto,et al.  Recent progress of local search in handling the time window constraints of the vehicle routing problem , 2010, 4OR.

[12]  Francis Sourd,et al.  An improved earliness-tardiness timing algorithm , 2007, Comput. Oper. Res..

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

[14]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

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

[16]  Débora P. Ronconi,et al.  Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date , 2009, Comput. Oper. Res..

[17]  Shigenobu Kobayashi,et al.  Edge Assembly Crossover: A High-Power Genetic Algorithm for the Travelling Salesman Problem , 1997, ICGA.

[18]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

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

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

[21]  Wout Dullaert,et al.  A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows , 2010, Comput. Oper. Res..

[22]  Gilbert Laporte,et al.  Fifty Years of Vehicle Routing , 2009, Transp. Sci..

[23]  Mwp Martin Savelsbergh,et al.  VEHICLE ROUTING WITH TIME WINDOWS: OPTIMIZATION AND APPROXIMATION. VEHICLE ROUTING: METHOD AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1987 .

[24]  Toshihide Ibaraki,et al.  Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints , 2005, Transp. Sci..

[25]  Tore Grünert,et al.  Local Search for Vehicle Routing and Scheduling Problems: Review and Conceptual Integration , 2005, J. Heuristics.

[26]  Francis Sourd,et al.  Optimal timing of a sequence of tasks with general completion costs , 2005, Eur. J. Oper. Res..

[27]  Richard W. Eglese,et al.  A unified tabu search algorithm for vehicle routing problems with soft time windows , 2008, J. Oper. Res. Soc..

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

[29]  Hideki Hashimoto,et al.  A Path Relinking Approach with an Adaptive Mechanism to Control Parameters for the Vehicle Routing Problem with Time Windows , 2008, EvoCOP.

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

[31]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

[32]  Daniel J. Rosenkrantz,et al.  An analysis of several heuristics for the traveling salesman problem , 2013, Fundamental Problems in Computing.

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

[34]  Jacques Desrosiers,et al.  Technical Note - Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs , 1989, Transp. Sci..

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

[36]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[37]  Hisashi Tamaki,et al.  A heuristic approach to parallel machine scheduling with earliness and tardiness penalties , 1999, 1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467).

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

[39]  Jacques Desrosiers,et al.  Chapter 2 Time constrained routing and scheduling , 1995 .

[40]  Olli Bräysy,et al.  A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows , 2003, INFORMS J. Comput..

[41]  Safia Kedad-Sidhoum,et al.  Fast neighborhood search for the single machine earliness-tardiness scheduling problem , 2008, Comput. Oper. Res..

[42]  Lawrence Bodin,et al.  Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling , 1985, Transp. Sci..

[43]  Toshihide Ibaraki,et al.  The vehicle routing problem with flexible time windows and traveling times , 2006, Discret. Appl. Math..

[44]  Yuichi Nagata,et al.  A powerful route minimization heuristic for the vehicle routing problem with time windows , 2009, Oper. Res. Lett..

[45]  Francis Sourd,et al.  Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem , 2006, Eur. J. Oper. Res..

[46]  John J. Kanet,et al.  Single-machine scheduling with early and tardy completion costs , 1993 .

[47]  Robert E. Tarjan,et al.  One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties , 1988, Math. Oper. Res..

[48]  Giovanni Righini,et al.  A column generation algorithm for the vehicle routing problem with soft time windows , 2011, 4OR.

[49]  Hideki Hashimoto,et al.  An iterated local search algorithm for the time-dependent vehicle routing problem with time windows , 2008, Discret. Optim..

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

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

[52]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..

[53]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..

[54]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[55]  Wen-Chyuan Chiang,et al.  A metaheuristic for the vehicle-routeing problem with soft time windows , 2004, J. Oper. Res. Soc..

[56]  Toshihide Ibaraki,et al.  An iterated local search algorithm for the vehicle routing problem with convex time penalty functions , 2008, Discret. Appl. Math..

[57]  Michael J. Best,et al.  Active set algorithms for isotonic regression; A unifying framework , 1990, Math. Program..

[58]  Nagraj Balakrishnan,et al.  Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows , 1993 .

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