A multi-start local search algorithm for the vehicle routing problem with time windows

In this paper a multi-start local search (MSLS) heuristic is proposed for the vehicle routing problem with time windows (VRPTW). In VRPTW the objective is to design least cost routes for a fleet of identical capacitated vehicles to service geographically scattered customers within pre-specified service time windows. The suggested approach is based on a MSLS framework and several new improvement heuristics. A new speedup technique is introduced for the construction heuristics, and the results of the MSLS are post-optimized by a threshold accepting post-processor. Experimental results on 358 benchmark problems from the literature show that the suggested method is highly efficient and competitive.

[1]  Andrew Lim,et al.  Local search with annealing-like restarts to solve the VRPTW , 2003, Eur. J. Oper. Res..

[2]  O. Bräysy,et al.  A Threshold Accepting Metaheuristic for the Vehicle Routing Problem with Time Windows. , 2003 .

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

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

[5]  Hermann Gehring,et al.  A Parallel Hybrid Evolutionary Metaheuristic for the Vehicle Routing Problem with Time Windows , 1999 .

[6]  Fuh-Hwa Franklin Liu,et al.  A route-neighborhood-based metaheuristic for vehicle routing problem with time windows , 1999, Eur. J. Oper. Res..

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

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

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

[10]  Michel Gendreau,et al.  Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows , 2002, J. Heuristics.

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

[12]  Zbigniew J. Czech,et al.  Parallel simulated annealing for the vehicle routing problem with time windows , 2002, Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing.

[13]  GendreauMichel,et al.  Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows , 2002 .

[14]  Paul Shaw,et al.  A new local search algorithm providing high quality solutions to vehicle routing problems , 1997 .

[15]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[16]  Fred Glover.  New Ejection Chain and Alternating Path Methods for Traveling Salesman Problems , 1992, Computer Science and Operations Research.

[17]  Tong Sun,et al.  Algorithms for the vehicle routing problems with time deadlines , 1993 .

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

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

[20]  César Rego,et al.  Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms , 2001, Parallel Comput..

[21]  É. Taillard,et al.  MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .

[22]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[23]  Jörg Homberger,et al.  A two-phase hybrid metaheuristic for the vehicle routing problem with time windows , 2005, Eur. J. Oper. Res..

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

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

[26]  Christos D. Tarantilis,et al.  A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem , 2004, Eur. J. Oper. Res..

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

[28]  Wout Dullaert,et al.  Routing relatively few customers per route , 2003 .

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

[30]  O. Bräysy,et al.  A Route-Directed Hybrid Genetic Approach For The Vehicle Routing Problem With Time Windows , 2003 .

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

[32]  Jeffrey L. Rummel,et al.  A Subpath Ejection Method for the Vehicle Routing Problem , 1998 .

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

[34]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[35]  Russell Bent,et al.  A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows , 2004, Transp. Sci..

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

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

[38]  Jörg Homberger,et al.  Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows , 2002, J. Heuristics.

[39]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

[41]  George Ioannou,et al.  A greedy look-ahead heuristic for the vehicle routing problem with time windows , 2001, J. Oper. Res. Soc..

[42]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

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

[44]  Gilbert Laporte,et al.  New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..

[45]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[46]  Wout Dullaert,et al.  A Fast Evolutionary Metaheuristic for the Vehicle Routing Problem with Time Windows , 2003, Int. J. Artif. Intell. Tools.

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

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

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

[50]  François Laburthe,et al.  A Meta-Heuristic Factory for Vehicle Routing Problems , 1999, CP.

[51]  Martin Davies,et al.  Computer Science and Operations Research: New Developments in Their Interfaces , 1992 .

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

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