Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
Hybridizing Reactive Tabu Search with Simulated Annealing
verfasst von : Stefan Voß, Andreas Fink
Erschienen in: Learning and Intelligent Optimization
Verlag: Springer Berlin Heidelberg
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
Reactive tabu search (RTS) aims at the automatic adaptation of the tabu list length. The idea is to increase the tabu list length when the tabu memory indicates that the search is revisiting formerly traversed solutions. Once too many repetitions are encountered, an escape mechanism constituting a random walk is an essential part of the method. We propose to replace this random walk by a controlled simulated annealing (SA). Excellent results are presented for various combinatorial optimization problems.