Tabu Search

Part of the EURO Advanced Tutorials on Operational Research book series (EUROATOR)


In this chapter we describe one of the most successful methodologies for obtaining high quality solutions to difficult optimization problems. It was proposed by Fred Glover (Decision Sciences 8:371–392, 1997) [3] under the term Tabu Search, which refers to the way in which the method explores the solution region of a given problem. We will use Clustering Analysis as an example to apply this technique.


  1. 1.
    Duarte, A., M. Laguna, and R. Martí. 2011. Tabu search for the linear ordering problem with cumulative costs. Computational Optimization and Applications 48: 697–715.CrossRefGoogle Scholar
  2. 2.
    Gendreau, M., and Potvin, J. Y. (eds.) 2010. Handbook of metaheuristics. International Series in Operations Research and Management Science (vol. 146). Berlin: Springer.Google Scholar
  3. 3.
    Glover, F. 1977. Heuristics for integer programming using surrogate constraints. Decision Sciences 8: 371–392.CrossRefGoogle Scholar
  4. 4.
    Glover, F., and Laguna, M. 1997. Tabu search. Dordrecht: Kluwer Academic Publishers.Google Scholar
  5. 5.
    Hertz, A., and M. Widmer. 2003. Guidelines for the use of meta-heuristics in combinatorial optimization. European Journal of Operational Research 151: 247–252.CrossRefGoogle Scholar
  6. 6.
    Martí, R., M. Laguna, F. Glover, and V. Campos. 2001. Reducing the bandwidth of a sparse matrix with tabu search. European Journal of Operational Research 135: 450–459.CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.E.T.S. Ingeniería InformáticaUniversidad Rey Juan CarlosMadridSpain
  2. 2.Leeds School of BusinessBoulderUSA
  3. 3.Universidad de ValenciaBurjassot, ValenciaSpain

Personalised recommendations