Skip to main content
SpringerLink
Log in

Tabu Search

  • Chapter
Search Methodologies

Abstract

Over the last 15 years, hundreds of papers presenting applications of tabu search, a heuristic method originally proposed by (1986), to various combinatorial problems have appeared in the operations research literature: see, for example, (1997), (1993b), (1996), (2002), (2002) and (1999). In several cases, the methods described provide solutions very close to optimality and are among the most effective, if not the best, to tackle the difficult problems at hand. These successes have made tabu search extremely popular among those interested in finding good solutions to the large combinatorial problems encountered in many practical settings. Several papers, book chapters, special issues and books have surveyed the rich tabu search literature (a list of some of the most important references is provided at the end of this chapter). In spite of this abundant literature, there still seem to be many researchers who, while they are eager to apply tabu search to new problem settings, find it difficult to properly grasp the fundamental concepts of the method, its strengths and its limitations, and to come up with effective implementations. The purpose of this chapter is thus to focus on the fundamental concepts of tabu search.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Anderson, E. J., Glass, C. A. and Potts, C. N., 1997, Machine scheduling, in: Local Search in Combinatorial Optimization, E. H. L. Aarts and J. K. Lenstra, eds, Wiley, New York, pp. 361–414.

    Google Scholar 

  • Battiti, R. and Tecchiolli, G., 1994, The reactive tabu search, ORSA J. Comput. 6:126–140.

    MATH  Google Scholar 

  • Burke, E., De Causmaecker, P. and Vanden Berghe, G., 1999, A hybrid tabu search algorithm for the nurse rostering problem, in: Simulated Evolution and Learning, Selected papers from the 2nd Asia-Pacific Conf. on Simulated Evolution and Learning, SEAL’ 98, B. McKay, X. Yao, C. S. Newton, J.-H. Kim and T. Furuhashi, eds, Lecture Notes in Artificial Intelligence, Vol. 1585, Springer, Berlin, pp. 187–194.

    Google Scholar 

  • Crainic, T. G. and Gendreau, M., 1999, Towards an evolutionary method—cooperative multi-thread parallel tabu search heuristic hybrid, in: Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, S. Voss, S. Martello, I. H. Osman and C. Roucairol, eds, Kluwer, Dordrecht, pp. 331–344.

    Google Scholar 

  • Crainic, T. G., Gendreau, M. and Farvolden, J. M., 2000, Simplex-based tabu search for the multicommodity capacitated fixed charge network design problem, INFORMS J. Comput. 12:223–236.

    Article  MATH  MathSciNet  Google Scholar 

  • Crainic, T. G., Gendreau, M., Soriano, P. and Toulouse, M., 1993, A tabu search procedure for multicommodity location/allocation with balancing requirements, Ann. Oper. Res. 41:359–383.

    Article  MATH  Google Scholar 

  • Crainic, T. G., Toulouse, M. and Gendreau, M., 1997, Toward a taxonomy of parallel tabu search heuristics, INFORMS J. Comput. 9:61–72.

    MATH  Google Scholar 

  • Cung, V.-D., Martins, S. L., Ribeiro, C. C. and Roucairol, C., 2002, Strategies for the parallel implementation of metaheuristics, in: Essays and Surveys in Metaheuristics, C. C. Ribeiro and P. Hansen, eds, Kluwer, Dordrecht, pp. 263–308.

    Google Scholar 

  • Dorigo, M., 1992, Optimization, learning and natural algorithms, Ph.D. Dissertation, Departimento di Elettronica, Politecnico di Milano, Italy.

    Google Scholar 

  • Dueck, G. and Scheuer, T., 1990, Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing, J. Comput. Phys. 90:161–175.

    Article  MATH  MathSciNet  Google Scholar 

  • Fleurent, C. and Ferland, J. A., 1996, Genetic and hybrid algorithms for graph colouring, Ann. Oper. Res. 63:437–461.

    Article  MATH  Google Scholar 

  • Friden, C., Hertz, A. and de Werra, D., 1989, STABULUS: A technique for finding stable sets in large graphs with tabu search, Computing 42:35–44.

    Article  MATH  Google Scholar 

  • Gandibleux, X., Jaszkiewicz, A., Freville, A. and Slowinski, R., eds, 2000, J. Heuristics 6:291–431, Special issue: Multiple Objective Metaheuristics.

    Google Scholar 

  • Gendreau, M., 2002, Recent advances in tabu search, in: Essays and Surveys in Metaheuristics, C. C. Ribeiro and P. Hansen, eds, Kluwer, Dordrecht, pp. 369–377.

    Google Scholar 

  • Gendreau, M., Guertin, F., Potvin, J.-Y. and Taillard, É. D., 1999, Parallel tabu search for real-time vehicle routing and dispatching, Transport. Sci. 33:381–390.

    MATH  Google Scholar 

  • Gendreau, M., Hertz, A. and Laporte, G., 1994, A tabu search heuristic for the vehicle routing problem, Manage. Sci. 40:1276–1290.

    MATH  Google Scholar 

  • Gendreau, M., Soriano, P. and Salvail, L., 1993, Solving the maximum clique problem using a tabu search approach, Ann. Oper. Res. 41:385–403.

    Article  MATH  Google Scholar 

  • Glover, F., 1977, Heuristics for integer programming using surrogate constraints, Decision Sci. 8:156–166.

    Google Scholar 

  • Glover, F., 1986, Future paths for integer programming and links to artificial intelligence, Comput. Oper. Res. 13:533–549.

    Article  MATH  MathSciNet  Google Scholar 

  • Glover, F., 1989, Tabu search—Part I, ORSA J. Comput. 1:190–206.

    MATH  MathSciNet  Google Scholar 

  • Glover, F., 1990, Tabu search—Part II, ORSA J. Comput. 2:4–32.

    MATH  Google Scholar 

  • Glover, F., 1992, Ejection chains, reference structures and alternating path methods for traveling salesman problems, University of Colorado paper, shortened version published in Discr. Appl. Math. 65:223–253, 1996.

    Article  MathSciNet  Google Scholar 

  • Glover, F. and Kochenberger, G. A., eds, 2003, Handbook of Metaheuristics, Kluwer, Boston.

    MATH  Google Scholar 

  • Glover, F. and Laguna, M., 1993, Tabu search, in: Modern Heuristic Techniques for Combinatorial Problems, C. R. Reeves, ed., Blackwell, Oxford, pp. 70–150.

    Google Scholar 

  • Glover, F. and Laguna, M., 1997, Tabu Search, Kluwer, Boston, MA.

    MATH  Google Scholar 

  • Glover, F., Laguna, M., Taillard, É. D. and de Werra, D., eds, 1993a, Tabu Search, Annals of Operations Research, Vol. 41, Baltzer, Basel.

    Google Scholar 

  • Glover, F., Taillard, É. D. and de Werra, D., 1993b, A user’s guide to tabu search, Ann. Oper. Res. 41:3–28.

    Article  MATH  Google Scholar 

  • Grünert, T., 2002, Lagrangean tabu search, in: Essays and Surveys in Meta-heuristics, C. C. Ribeiro and P. Hansen, eds, Kluwer, Dordrecht, pp. 379–397.

    Google Scholar 

  • Hansen, P., 1986, The steepest ascent mildest descent heuristic for combinatorial programming, in: Proceedings of the Congress on Numerical Methods in Combinatorial Optimization, Capri, Italy.

    Google Scholar 

  • Hertz, A. and de Werra, D, 1987, Using tabu search for graph coloring, Computing 39:345–351.

    Article  MATH  MathSciNet  Google Scholar 

  • Hertz, A. and de Werra, D., 1991, The tabu search metaheuristic: how we used it, Ann. Math. Artif. Intell. 1:111–121.

    Article  Google Scholar 

  • Holland, J. H., 1975, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI.

    Google Scholar 

  • Kirkpatrick, S., Gelatt Jr., C. D. and Vecchi, M. P., 1983, Optimization by simulated annealing, Science 220:671–680.

    Article  MathSciNet  Google Scholar 

  • Laporte, G. and Osman, I. H., eds, 1996, Metaheuristics in Combinatorial Optimization, Annals of Operations Research, Vol. 63, Baltzer, Basel.

    Google Scholar 

  • Lokketangen, A. and Glover, F., 1996, Probabilistic move selection in tabu search for 0/1 mixed integer programming problems, in: Meta-Heuristics: Theory and Applications, I. H. Osman and J. P. Kelly, eds, Kluwer, Dordrecht, pp. 467–488.

    Google Scholar 

  • Lokketangen, A. and Woodruff, D. L., 1996, Progressive hedging and tabu search applied to mixed integer (0, 1) multistage stochastic programming, J. Heuristics 2:111–128.

    Article  Google Scholar 

  • Nilsson, N. J., 1980, Principles of Artificial Intelligence, Morgan Kaufmann, Los Altos, CA.

    MATH  Google Scholar 

  • Osman, I. H. and Kelly, J. P., eds, 1996, Meta-Heuristics: Theory and Applications, Kluwer, Boston, MA.

    MATH  Google Scholar 

  • Pardalos, P. M. and Resende, M. G. C., eds, 2002, Handbook of Applied Optimization, Oxford University Press, New York.

    MATH  Google Scholar 

  • Pesant, G. and Gendreau, M., 1999, A constraint programming framework for local search methods, J. Heuristics 5:255–280.

    Article  MATH  Google Scholar 

  • Ribeiro, C. C. and Hansen, P., eds, 2002, Essays and Surveys in Metaheuristics, Kluwer, Norwell, MA.

    MATH  Google Scholar 

  • Rochat, Y. and Taillard, É. D., 1995, Probabilistic diversification and intensification in local search for vehicle routing, J. Heuristics 1:147–167.

    Article  MATH  Google Scholar 

  • 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.

    Google Scholar 

  • Skorin-Kapov, J., 1990, Tabu search applied to the quadratic assignment problem, ORSA J. Comput. 2:33–45.

    MATH  Google Scholar 

  • Soriano, P. and Gendreau, M., 1996, Diversification strategies in tabu search algorithms for the maximum clique problems, Ann. Oper. Res. 63:189–207.

    Article  MATH  Google Scholar 

  • Soriano, P. and Gendreau, M., 1997, Fondements et applications des méthodes de recherche avec tabous, RAIRO (Recherche opérationnelle) 31:133–159.

    MATH  MathSciNet  Google Scholar 

  • Taillard, É. D., 1990, Some efficient heuristic methods for the flow shop sequencing problem, Eur. J. Oper. Res. 47:65–74.

    Article  MATH  MathSciNet  Google Scholar 

  • Taillard, É. D., 1991, Robust taboo search for the quadratic assignment problem, Parallel Comput. 17:443–455.

    Article  MathSciNet  Google Scholar 

  • Vaessens, R. J. M., Aarts E. H. L. and Lenstra, J. K., 1996, Job shop scheduling by local search, INFORMS J. Comput. 8:302–317.

    Article  MATH  Google Scholar 

  • Voss, S., Martello, S., Osman, I. H. and Roucairol, C., eds, 1999, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer, Boston, MA.

    MATH  Google Scholar 

  • de Werra, D. and Hertz, A., 1989, Tabu search techniques: a tutorial and an application to neural networks, OR Spektrum 11:131–141.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département d’informatique et de recherche opérationnelle and Centre de recherche sur les transports, Université de Montréal, Canada

    Michel Gendreau & Jean-Yves Potvin

Authors
  1. Michel Gendreau
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Yves Potvin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Nottingham, UK

    Edmund K. Burke  & Graham Kendall  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Gendreau, M., Potvin, JY. (2005). Tabu Search. In: Burke, E.K., Kendall, G. (eds) Search Methodologies. Springer, Boston, MA. https://doi.org/10.1007/0-387-28356-0_6

Download citation

Publish with us

Policies and ethics

Search

Navigation