Skip to main content
SpringerLink
Log in

Tabu Search

  • Living reference work entry
  • First Online:
Handbook of Heuristics

Abstract

Tabu search (TS) is a solution methodology within the area of metaheuristics. While the methodology applies to optimization problems in general, most TS applications have been and continue to be in discrete optimization. A key and distinguishing feature of tabu search is the use of special strategies based on adaptive memory. The underlying philosophy is that an effective search for optimal solutions should involve a flexible process that responds to the objective function landscape in a manner that allows it to learn appropriate directions to exploit specific areas of the solution space and useful departures to explore new terrain. The adaptive memory structures of tabu search enable the implementation of procedures that are capable of searching effectively and produce solutions of suitable quality within reasonable computational effort.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

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

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Glover F (1990) Tabu search: a tutorial. Interfaces 20(4):74–94

    Article  Google Scholar 

  4. Glover F, Laguna M (1997) Tabu search. Springer, New York

    Book  MATH  Google Scholar 

  5. Glover F, Laguna M (2002) Tabu search. In: Pardalos PM, Resende MGC (eds) Handbook of applied optimization. Oxford University Press, New York, pp 194–208

    Google Scholar 

  6. Glover F, Laguna M (2013) Tabu search. In: Du DZ, Pardalos PM (eds) Handbook of combinatorial optimization, 2nd edn. Springer, New York, pp 3261–3362

    Chapter  Google Scholar 

  7. Glover F, Laguna M, Martí R (2007) Principles of tabu search. In: Gonzalez T (ed) Approximation algorithms and metaheuristics, Chapter 23. Chapman & Hall/CRC, New York

    Google Scholar 

  8. Schneider U (2010) A tabu search tutorial based on a real-world scheduling problem. Cent Eur J Oper Res 19(4):467–493

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Leeds School of Business, University of Colorado Boulder, UCB 419, 80309, Boulder, CO, USA

    Manuel Laguna

Authors
  1. Manuel Laguna
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Manuel Laguna .

Editor information

Editors and Affiliations

  1. Department of Statistics and Operations, University of Valencia, Valencia, Spain

    Rafael Martí

  2. University of Florida Industrial and Systems Engineering, Gainesville, Florida, USA

    Pardalos Panos

  3. Modeling and Optimization Group, Amazon (United States) , Seattle, Washington, USA

    Mauricio G. C. Resende

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this entry

Cite this entry

Laguna, M. (2017). Tabu Search. In: Martí, R., Panos, P., Resende, M. (eds) Handbook of Heuristics. Springer, Cham. https://doi.org/10.1007/978-3-319-07153-4_24-1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07153-4_24-1

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07153-4

  • Online ISBN: 978-3-319-07153-4

  • eBook Packages: Springer Reference MathematicsReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation