Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Battiti, R. and Tecchiolli, G. (1994) The reactive tabu search. ORSA Journal on Computing, 6, 126–140.
Bräysy, O. and Gendreau, M. (2001) Tabu search heuristics for the vehicle routing problem with time windows. Report STF42 A01022, SINTEF Applied Mathematics, Oslo, Norway. Forthcoming in TOP.
Crainic, T.G. and Gendreau, M. (1999). Towards an evolutionary method—cooperative multi-thread parallel tabu search heuristic Hybrid. In S. Voss, S. Martello, I.H. Osman and C. Roucairol (Eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer Academic Publishers, pp. 331–344.
Crainic, T.G., Gendreau, M., and Farvolden, J.M. (2000) Simplex-based tabu search for the multicommodity capacitated fixed charge network design problem. INFORMS Journal on Computing, 12, 223–236.
Crainic, T.G., Gendreau, M., Soriano, P., and Toulouse, M. (1993) A tabu search procedure for multicommodity location/allocation with balancing requirements. Annals of Operations Research, 41, 359–383.
Crainic, T.G., Toulouse, M., and Gendreau, M. (1997) Toward a taxonomy of parallel tabu search heuristics. INFORMS Journal on Computing, 9, 61–72.
Cung, V.-D., Martins, S.L., Ribeiro, C.C., and Roucairol, C. (2002) Strategies for the parallel implementation of metaheuristics. In C.C. Ribeiro and P. Hansen (Eds.), Essays and Surveys in Metaheuristics, Kluwer Academic Publishers, pp. 263–308.
Fleurent, C. and Ferland, J.A. (1996) Genetic and hybrid algorithms for graph colouring. Annals of Operations Research, 63, 437–461.
Gendreau, M. (2002) Recent advances in tabu search. In C.C. Ribeiro and P. Hansen (eds.), Essays and Surveys in Metaheuristics, Kluwer Academic Publishers, pp. 369–377.
Gendreau, M., Guertin, F., Potvin, J.-Y. and Taillard, É.D. (1999) Paralle tabu search for real-time vehicle routing and dispatching. Transportation Science, 33, 381–390.
Gendreau, M., Hertz, A., and Laporte, G. (1994) A tabu search heuristic for the vehicle routing problem. Management Science, 40, 1276–1290.
Gendreau, M., Laporte, G. and Potvin, J.-Y. (2002) Metaheuristics for the capacitated VRP. In P. Toth and D. Vigo (Eds.), The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, pp. 129–154.
Gendreau, M., Soriano, P. and Salvail, L. (1993) Solving the maximum clique problem using a tabu search approach. Annals of Operations Research, 41, 385–403.
Glover, F. (1977) Heuristics for integer programming using surrogate constraints. Decision Sciences, 8, 156–166.
Glover, F. (1986) Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 13, 533–549.
Glover, F. (1989) Tabu Search—Part I. ORSA Journal on Computing, 1, 190–206.
Glover, F. (1990) Tabu Search—Part II. ORSA Journal on Computing, 2, 4–32.
Glover, F. (1992) Ejection chains, reference structures and alternating path methods for traveling salesman problems. University of Colorado. Shortened version published in Discrete Applied Mathematics, 65, 223–253, 1996.
Glover, F. and Laguna, M. (1993) Tabu search. In C.R. Reeves (Ed.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell, pp. 70–150.
Glover, F. and Laguna, M. (1997) Tabu Search, Kluwer Academic Publishers, Norwell, MA.
Glover, F., Laguna, M., Taillard, É., and de Werra, D. (Eds.) (1993) Tabu search. Annals of Operations Research, 41, J.C. Baltzer Science Publishers, Basel, Switzerland.
Glover, F., Taillard, É. and de Werra, D. (1993) A user’s guide to tabu search. Annals of Operations Research, 41, 3–28.
Grünert, T. (2002) Lagrangean tabu search. In C.C. Ribeiro and P. Hansen (Eds.) Essays and Surveys in Metaheuristics, Kluwer Academic Publishers, pp. 379–397.
Hertz, A. and de Werra, D. (1991) The tabu search metaheuristic: how we used it. Annals of Mathematics and Artificial Intelligence, 1, 111–121.
Holland, J.H. (1975) Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI.
Kirkpatrick, S., Gelatt Jr., C.D., and Vecchi, M.P. (1983) Optimization by simulated annealing. Science, 220, 671–680.
Laporte, G. and Osman, I.H. (Eds.) (1996) Metaheuristics in combinatorial optimization. Annals of Operations Research, 63, J.C. Baltzer Science Publishers, Basel, Switzerland.
Lokketangen, A. and Glover, F. (1996) Probabilistic move selection in tabu search for 0/1 mixed integer programming problems. In I.H. Osman and J.P. Kelly (Eds.), Meta-Heuristics: Theory and Applications, Kluwer Academic Publishers, pp. 467–488.
Osman, I.H. (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 41, 421–451.
Osman, I.H. and Kelly, J.P. (Eds.) (1996) Meta-Heuristics: Theory and Applications, Kluwer Academic Publishers, Norwell, MA.
Pesant, G. and Gendreau, M. (1999) A constraint programming framework for local search methods. Journal of Heuristics, 5, 255–280.
Rego, C. and Roucairol, C. (1996) A parallel tabu search algorithm using ejection chains for the vehicle routing problem. In I.H. Osman and J.P. Kelly (Eds.), Meta-Heuristics: Theory and Applications, Kluwer Academic Publishers, pp. 661–675.
Ribeiro, C.C. and Hansen, P. (Eds.) (2002) Essays and Surveys in Metaheuristics, Kluwer Academic Publishers, Norwell, MA.
Rochat, Y. and Taillard, É.D. (1995) Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1, 147–167.
Rolland, E. (1996) A tabu search method for constrained real-number search: applications to portfolio selection. Working Paper, The Gary Anderson Graduate School of Management, University of California, Riverside.
Skorin-Kapov, J. (1990) Tabu search applied to the quadratic assignment problem. ORSA Journal on Computing, 2, 33–45.
Soriano, P. and Gendreau, M. (1996) Diversification strategies in tabu search algorithms for the maximum clique problems. Annals of Operations Research, 63, 189–207.
Soriano, P. and Gendreau, M. (1997) Fondements et applications des méthodes de recherche avec tabous. RAIRO (Recherche opérationnelle), 31, 133–159 (in French).
Taillard, É. (1990) Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research, 47, 65–74.
Taillard, É. (1991) Robust taboo search for the quadratic assignment problem. Parallel Computing, 17, 443–455.
Taillard, É.D., Badeau, P., Gendreau, M. Guertin, F. and Potvin, J.-Y. (1997) A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science, 31, 170–186.
Voss, S., Martello, S., Osman, I.H. and Roucairol, C. (Eds.) (1999) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer Academic Publishers, Norwell, MA.
de Werra, D. and Hertz, A. (1989) Tabu search techniques: a tutorial and an application to neural networks. OR Spektrum, 11, 131–141.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Kluwer Academic Publishers
About this chapter
Cite this chapter
Gendreau, M. (2003). An Introduction to Tabu Search. In: Glover, F., Kochenberger, G.A. (eds) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol 57. Springer, Boston, MA. https://doi.org/10.1007/0-306-48056-5_2
Download citation
DOI: https://doi.org/10.1007/0-306-48056-5_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-7263-5
Online ISBN: 978-0-306-48056-0
eBook Packages: Springer Book Archive