Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
Tabu Search
verfasst von : Michel Gendreau, Jean-Yves Potvin
Erschienen in: Search Methodologies
Verlag: Springer US
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.