Skip to main content

Part of the book series: Natural Computing Series ((NCS))

  • 1792 Accesses

Abstract

Tabu search was proposed in 1986 by F. Glover [36]. This metaheuristic gives good results on combinatorial optimization problems such as quadratic assignment.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Chopard, B., Tomassini, M. (2018). Tabu Search. In: An Introduction to Metaheuristics for Optimization. Natural Computing Series. Springer, Cham. https://doi.org/10.1007/978-3-319-93073-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-93073-2_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-93072-5

  • Online ISBN: 978-3-319-93073-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics