Tabu Search Fundamentals and Uses

Tabu search has achieved widespread successes in solving practical optimization problems. Applications are rapidly growing in areas such as resource management, process design, logistics, technology planning, and general combinatorial optimization. Hybrids with other procedures, both heuristic and algorithmic, have also produced productive results. We examine some of the principal features of tabu search that are most responsible for its successes, and that offer a basis for improved solution methods in the future. Note: This expanded version contains additional illustrations and information on candidate list strategies, probabilistic tabu search, strategic oscillation and parallel processing options. Sections have also been added on principles of intelligent search. Acknowledgement: This work has been supported in part by the National Science and Engineering Council of Canada under Grants 5-83998 and 5-84181.

[1]  Claude Berge Theory of graphs and its applications , 1962 .

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

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

[4]  A. Fréville,et al.  Heuristics and reduction methods for multiple constraints 0-1 linear programming problems , 1986 .

[5]  P. Ow,et al.  Filtered beam search in scheduling , 1988 .

[6]  Harvey J. Greenberg,et al.  New approaches for heuristic search: A bilateral linkage with artificial intelligence , 1989 .

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

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

[9]  David S. Johnson,et al.  Local Optimization and the Traveling Salesman Problem , 1990, ICALP.

[10]  Fred Glover,et al.  Tabu Search: A Tutorial , 1990 .

[11]  Pierre Hansen,et al.  Average-Linkage Divisive Hierarchical Clustering , 1991 .

[12]  D. A. Beyer,et al.  Tabu learning: a neural network search method for solving nonconvex optimization problems , 1991, IJCNN-91-Seattle International Joint Conference on Neural Networks.

[13]  Edward W. Felten,et al.  Large-step markov chains for the TSP incorporating local search heuristics , 1992, Oper. Res. Lett..

[14]  Roberto Battiti,et al.  Parallel biased search for combinatorial optimization: genetic algorithms and TABU , 1992, Microprocess. Microsystems.

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

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

[17]  Stefan Voß,et al.  Tabu Search: Applications and Prospects , 1993 .

[18]  F. Glover,et al.  Bandwidth packing: a tabu search approach , 1993 .

[19]  Michel Gendreau,et al.  A STUDY OF SYNCHRONOUS PARALLELIZATION STRATEGIES FOR TABU SEARCH. , 1993 .

[20]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[21]  Jennifer Ryan,et al.  A column generation algorithm for bandwidth packing , 1993, Telecommun. Syst..

[22]  Joseph B. Mazzola,et al.  A tabu-search heuristic for the flexible-resource flow shop scheduling problem , 1993, Ann. Oper. Res..

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

[24]  Jadranka Skorin-Kapov,et al.  Connection Machine implementation of a tabu search algorithm for the traveling salesman problem , 1993 .

[25]  Pablo Moscato,et al.  An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search , 1993, Ann. Oper. Res..

[26]  Fred Glover,et al.  Integrating target analysis and tabu search for improved scheduling systems , 1993 .

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

[28]  James P. Kelly,et al.  Large-scale controlled rounding using tabu search with strategic oscillation , 1993, Ann. Oper. Res..

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

[30]  Stefan Voß,et al.  Dynamic tabu list management using the reverse elimination method , 1993, Ann. Oper. Res..

[31]  David L. Woodruff,et al.  Hashing vectors for tabu search , 1993, Ann. Oper. Res..

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

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

[34]  Jadranka Skorin-Kapov,et al.  Massively parallel tabu search for the quadratic assignment problem , 1993, Ann. Oper. Res..

[35]  Fred W. Glover,et al.  Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms) , 1994, Discret. Appl. Math..

[36]  Erwin Pesch,et al.  Fast Clustering Algorithms , 1994, INFORMS J. Comput..

[37]  Nicos Christofides,et al.  Capacitated clustering problems by hybrid simulated annealing and tabu search , 1994 .

[38]  Andrew H. Gee,et al.  Polyhedral Combinatorics and Neural Networks , 1994, Neural Computation.

[39]  Yves Rochat,et al.  A Tabu Search Approach for Delivering Pet Food and Flour in Switzerland , 1994 .

[40]  Fred W. Glover,et al.  A study of diversification strategies for the quadratic assignment problem , 1994, Comput. Oper. Res..

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

[42]  Fred W. Glover,et al.  Applying tabu search with influential diversification to multiprocessor scheduling , 1994, Comput. Oper. Res..

[43]  Local Optimization and the Job-shop Scheduling Problem , 1994 .

[44]  J. P. Kelly,et al.  Tabu search for the multilevel generalized assignment problem , 1995 .

[45]  Roberto Battiti,et al.  Training neural nets with the reactive tabu search , 1995, IEEE Trans. Neural Networks.

[46]  Fred W. Glover,et al.  Tabu Thresholding: Improved Search by Nonmonotonic Trajectories , 1995, INFORMS J. Comput..

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

[48]  C. Ribeiro,et al.  A Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints , 1995, Int. J. High Speed Comput..

[49]  Stefan Voß,et al.  Solving Quadratic Assignment Problems Using the Reverse Elimination Method , 1995 .

[50]  Fred Glover,et al.  Critical Event Tabu Search for Multidimensional Knapsack Problems , 1996 .

[51]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

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

[53]  NowickiEugeniusz,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[54]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

[55]  Fred Glover,et al.  TSP Ejection Chains , 1997, Discret. Appl. Math..