An Introduction to Tabu Search

This chapter presents the fundamental concepts of Tabu Search (TS) in a tutorial fashion. Special emphasis is put on showing the relationships with classical Local Search methods and on the basic elements of any TS heuristic, namely, the definition of the search space, the neighborhood structure, and the search memory. Other sections cover other important concepts such as search intensification and diversification and provide references to significant work on TS. Recent advances in TS are also briefly discussed.

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

[2]  Michel Gendreau,et al.  Recent Advances in Tabu Search , 2002 .

[3]  D. Werra,et al.  Tabu search: a tutorial and an application to neural networks , 1989 .

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

[5]  M. Gendreau,et al.  Fondements et applications des méthodes de recherche avec tabous , 1994 .

[6]  Tore Grünert.  Lagrangean Tabu Search , 2002 .

[7]  Constantino Tsallis,et al.  Optimization by Simulated Annealing: Recent Progress , 1995 .

[8]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[9]  Michel Gendreau,et al.  Solving the maximum clique problem using a tabu search approach , 1993, Ann. Oper. Res..

[10]  Michel Gendreau,et al.  Toward a Taxonomy of Parallel Tabu Search Heuristics , 1997, INFORMS J. Comput..

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

[12]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

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

[14]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

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

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

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

[18]  Michel Gendreau,et al.  A tabu search procedure for multicommodity location/allocation with balancing requirements , 1992, Ann. Oper. Res..

[19]  Charles Fleurent,et al.  Genetic and hybrid algorithms for graph coloring , 1996, Ann. Oper. Res..

[20]  Michel Gendreau,et al.  Metaheuristics for the Capacitated VRP , 2002, The Vehicle Routing Problem.

[21]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

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

[23]  Celso C. Ribeiro,et al.  Strategies for the Parallel Implementation of Metaheuristics , 2002 .

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

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

[26]  Michel Gendreau,et al.  Tabu Search heuristics for the Vehicle Routing Problem with Time Windows , 2002 .

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

[28]  Fred Glover,et al.  Probabilistic Move Selection in Tabu Search for Zero-One Mixed Integer Programming Problems , 1996 .

[29]  Jadranka Skorin-Kapov,et al.  Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..

[30]  Michel Gendreau,et al.  A Simplex-Based Tabu Search Method for Capacitated Network Design , 2000, INFORMS J. Comput..

[31]  Fred W. Glover,et al.  Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems , 1996, Discret. Appl. Math..

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

[33]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[34]  Michel Gendreau,et al.  Diversification strategies in tabu search algorithms for the maximum clique problem , 1996, Ann. Oper. Res..

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

[36]  Michel Gendreau,et al.  A Constraint Programming Framework for Local Search Methods , 1999, J. Heuristics.

[37]  C. Ribeiro,et al.  Essays and Surveys in Metaheuristics , 2002, Operations Research/Computer Science Interfaces Series.

[38]  Teodor Gabriel Crainic,et al.  SIMPLEX-BASED TABU SEARCH FOR THE MULTICOMMODITY CAPACITATED FIXED CHARGE NETWORK DESIGN PROBLEM. , 1996 .

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

[40]  Teodor Gabriel Crainic,et al.  Towards an Evolutionary Method — Cooperating Multi-Thread Parallel Tabu Search Hybrid , 1999 .

[41]  Gilbert Laporte,et al.  Metaheuristics in combinatorial optimization , 1996 .