Skip to main content
SpringerLink
Log in
Book cover

Search Methodologies pp 243–263Cite as

Tabu Search

  • Chapter
  • First Online:

Abstract

This chapter is an introductory tutorial on tabu search. It emphasizes the basic mechanisms of this search method and illustrates their application on two classical combinatorial problems. Some more advanced concepts, like diversification and intensification, are also introduced. The chapter ends with useful tips for designing a successful tabu search implementation.

This is a preview of subscription content, 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   89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

References

  • Alba E (ed) (2005) Parallel metaheuristics: a new class of algorithms. Wiley, Hoboken

    Google Scholar 

  • Anderson EJ, Glass CA, Potts CN (1997) Machine scheduling, in local search in combinatorial optimization. In: Aarts EHL, Lenstra JK (eds). Wiley, New York, pp 361–414

    Google Scholar 

  • Ateme-Nguema B, Dao T-M (2009) Quantized Hopfield networks and tabu search for manufacturing cell formation problems. Int J Product Econ 121:88–98

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Blum C, Blesa Aguilera MJ, Roli A, Sampels M (eds) (2008) Hybrid metaheuristics: an emerging approach to optimization. Springer, Berlin

    Google Scholar 

  • Burke E, De Causmaecker P, Vanden Berghe G (1998) A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem. In: Selected papers from the 2nd Asia Pacific conference on simulated evolution and learning, LNAI 1585. Springer, Berlin, Canberra, Australia, pp 187–194

    Google Scholar 

  • Crainic TG, Gendreau M (1999) Towards an evolutionary method—cooperative multi-thread parallel tabu search heuristic hybrid. In: Voss S et al (eds) Meta-heuristics: advances and trends in local search paradigms for optimization. Kluwer, Norwell, pp 331–344

    Chapter  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Crainic TG, Gendreau M, Rousseau L-M (eds) (2010) J Heuristics 16:235–535 (Special issue: Recent advances in metaheuristics)

    Google Scholar 

  • Cung V-D, Martins SL, Ribeiro CC, Roucairol C (2002) Strategies for the parallel implementation of metaheuristics. In: Ribeiro CC, Hansen P (eds) Essays and surveys in metaheuristics. Kluwer, Norwell, pp 263–308

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  • Doerner KF, Gendreau M, Greistorfer P, Gutjahr WJ, Hartl RF, Reimann M (eds) (2007) Metaheuristics: progress in complex systems optimization. Springer, New York

    Google Scholar 

  • Dorigo M (1992) Optimization, learning and natural algorithms. PhD Dissertation, Departimento di Elettronica, Politecnico di Milano

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Gandibleux X, Jaszkiewicz A, Freville A, 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: Ribeiro CC, Hansen P (eds) Essays and surveys in metaheuristics. Kluwer, Norwell, pp 369–377

    Chapter  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Gendreau M, Guertin F, Potvin J-Y, Séguin R (2006) Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transp Res C 14:157–174

    Article  Google Scholar 

  • Glover F (1977) Heuristics for integer programming using surrogate constraints. Decis Sci 8:156–166

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Glover F (1989) Tabu search I. ORSA J Comput 1:190–206

    Article  Google Scholar 

  • Glover F (1990) Tabu search II. ORSA J Comput 2:4–32

    Article  Google Scholar 

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

    Google Scholar 

  • Glover F, Kochenberger GA (eds) (2003) Handbook of metaheuristics. Kluwer, Norwell

    Google Scholar 

  • Glover F, Laguna M (1993) Tabu search. In: Reeves CR (ed) Modern heuristic techniques for combinatorial problems. Halsted Press, New York, pp 70–150

    Google Scholar 

  • Glover F, Laguna M (1997) Tabu search. Kluwer, Norwell

    Book  Google Scholar 

  • Glover F, Laguna M, Taillard ED, de Werra D (eds) (1993) Tabu search. Ann Oper Res 41, Baltzer Science, Basel, pp 1–490

    Google Scholar 

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

    Article  Google Scholar 

  • Grünert T (2002) Lagrangean tabu search. In: Ribeiro CC, Hansen P (eds) Essays and surveys in metaheuristics. Kluwer, Norwell, pp 379–397

    Chapter  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Hindsberger M, Vidal RVV (2000) Tabu search—a guided tour. Control Cybern 29:631–651

    Google Scholar 

  • Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor

    Google Scholar 

  • Ibaraki T, Nonobe K, Yagiura M (eds) (2005) Metaheuristics: progress as real problem solvers. Springer, New York

    Google Scholar 

  • Jaziri W (2008) Local search techniques: focus on tabu search. In-Teh, Croatia

    Book  Google Scholar 

  • Kirkpatrick S, Gelatt CD Jr, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671–680

    Article  Google Scholar 

  • Laporte G, Osman IH (eds) (1996) Metaheuristics in combinatorial optimization. Ann Oper Res 63, Baltzer Science, Basel, pp 1–630

    Google Scholar 

  • Lokketangen A, Glover F (1996) Probabilistic move selection in tabu search for 0/1 mixed integer programming problems. In: Osman IH, Kelly JP (eds) Meta-heuristics: theory and applications. Kluwer, Norwell, pp 467–488

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  • Nilsson NJ (1980) Principles of artificial intelligence. Morgan Kaufmann, Los Altos

    Google Scholar 

  • Osman IH, Kelly JP (eds) (1996) Meta-heuristics: theory and applications. Kluwer, Norwell

    Google Scholar 

  • Pardalos PM, Resende MGC (eds) (2002) Handbook of applied optimization. Oxford University Press, New York

    Google Scholar 

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

    Article  Google Scholar 

  • Rego C, Alidaee B (eds) (2005) Metaheuristic optimization via memory and evolution: tabu search and scatter search. Kluwer, Norwell

    Google Scholar 

  • Resende MGC, de Sousa JP (eds) (2004) Metaheuristics: computer decision-making, Kluwer, Norwell

    Google Scholar 

  • Ribeiro CC, Hansen P (eds) (2002) Essays and surveys in metaheuristics. Kluwer, Norwell

    Google Scholar 

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

    Article  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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  • Taillard ED (1990) Some efficient heuristic methods for the flow shop sequencing problem. Eur J Oper Res 47:65–74

    Article  Google Scholar 

  • Taillard ED (1991) Robust taboo search for the quadratic assignment problem. Parallel Comput 17:443–455

    Article  Google Scholar 

  • Vaessens RJM, Aarts EHL, Lenstra JK (1996) Job shop scheduling by local search. INFORMS J Comput 8:302–317

    Article  Google Scholar 

  • Voss S, Martello S, Osman IH, Roucairol C (eds) (1999) Meta-heuristics: advances and trends in local search paradigms for optimization. Kluwer, Norwell

    Google Scholar 

  • Wang Y, Li L, Ni J, Huang S (2009) Feature selection using tabu search with long-term memories and probabilistic neural networks. Pattern Recognit Lett 30:661–670

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département de mathématiques et de génie industriel, École Polytechnique de Montréal and CIRRELT, Montréal, Canada

    Michel Gendreau

  2. Département d’informatique et de recherche opérationnelle, Université de Montréal and CIRRELT, Montréal, Canada

    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

Corresponding author

Correspondence to Jean-Yves Potvin .

Editor information

Editors and Affiliations

  1. Computing Science and Mathematics, University of Stirling, Scotland, United Kingdom

    Edmund K. Burke

  2. Research and Knowledge Transfer, University of Nottingham, Malaysia & UK, Semenyih, Malaysia

    Graham Kendall

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this chapter

Cite this chapter

Gendreau, M., Potvin, JY. (2014). Tabu Search. In: Burke, E., Kendall, G. (eds) Search Methodologies. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-6940-7_9

Download citation

Publish with us

Policies and ethics

Search

Navigation