Tabu Search Heuristics for the Vehicle Routing Problem

This article reviews some of the most important tabu search heuristics for the vehicle routing problem. Some of the main tabu search features are first described: neighbourhood structures, short term memory, long term memory, intensification. The tabu search algorithms are then described, followed by computational results and the conclusion.

[1]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[2]  Michel Gendreau,et al.  New Heuristics for the Vehicle Routing Problem , 2005 .

[3]  Bruce L. Golden,et al.  Routing Vehicles in the Real World: Applications in the Solid Waste, Beverage, Food, Dairy, and Newspaper Industries , 2002, The Vehicle Routing Problem.

[4]  Olli Bräysy,et al.  Active guided evolution strategies for large-scale vehicle routing problems with time windows , 2005, Comput. Oper. Res..

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

[6]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[7]  Alex Van Breedam,et al.  An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle-relatezd, customer-related, and time-related constraints , 1994 .

[8]  R. Jonker,et al.  The symmetric traveling salesman problem and edge exchanges in minimal 1-trees , 1983 .

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

[10]  Nicos Christofides,et al.  A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations , 1995, Ann. Oper. Res..

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

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

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

[14]  Paolo Toth,et al.  An Overview of Vehicle Routing Problems , 2002, The Vehicle Routing Problem.

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

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

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

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

[19]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[20]  Paolo Toth,et al.  The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..

[21]  James P. Kelly,et al.  A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem , 1996, Transp. Sci..

[22]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[23]  R. Fahrion,et al.  On a Principle of Chain-exchange for Vehicle-routeing Problems (1-VRP) , 1990 .

[24]  C. Reeves Modern heuristic techniques for combinatorial problems , 1993 .

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

[26]  Alain Hertz,et al.  The tabu search metaheuristic: How we used it , 1990, Annals of Mathematics and Artificial Intelligence.

[27]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[28]  James P. Kelly,et al.  The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results , 1998 .

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

[30]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

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

[32]  Michel Gendreau,et al.  An Introduction to Tabu Search , 2003, Handbook of Metaheuristics.

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

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

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

[36]  Catherine Roucairol,et al.  A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem , 1996 .

[37]  Ibrahim Hassan Osman,et al.  Metastrategy : simulated annealing and tabu search for combinatorial optimization problems , 1991 .

[38]  Gilbert Laporte,et al.  A tabu search heuristic and adaptive memory procedure for political districting , 2003, Eur. J. Oper. Res..

[39]  Gilbert Laporte,et al.  Classical Heuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.

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

[41]  Gilbert Laporte,et al.  A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem , 1996, INFORMS J. Comput..

[42]  李幼升,et al.  Ph , 1989 .

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

[44]  Edward K. Baker Evolution of Microcomputer-Based Vehicle Routing Software: Case Studies in the United States , 2002, The Vehicle Routing Problem.

[45]  Éric D. Taillard,et al.  Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..

[46]  Michel Gendreau,et al.  A guide to vehicle routing heuristics , 2002, J. Oper. Res. Soc..

[47]  Jack J. Dongarra,et al.  Performance of various computers using standard linear equations software in a FORTRAN environment , 1988, CARN.

[48]  Gülay Barbarosoglu,et al.  A tabu search algorithm for the vehicle routing problem , 1999, Comput. Oper. Res..

[49]  G. Croes A Method for Solving Traveling-Salesman Problems , 1958 .

[50]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..