Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Battiti, R.: Reactive search: Toward self-tuning heuristics. In: Rayward-Smith, V.J., Osman, I.H., Reeves, C.R., Smith, G.D. (eds.) Modern Heuristic Search Methods, pp. 61–83. Wiley, Chichester (1996)
Battiti, R., Tecchiolli, G.: The reactive tabu search. ORSA Journal on Computing 6, 126–140 (1994)
Fink, A., Voß, S.: HotFrame: A heuristic optimization framework. In: Voß, S., Woodruff, D.L. (eds.) Optimization Software Class Libraries, pp. 81–154. Springer (2002)
Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: An experimental evaluation; part I, graph partitioning. Operations Research 37, 865–892 (1989)
Myung, Y.-S., Kim, H.-G., Tcha, D.-W.: Optimal load balancing on SONET bidirectional rings. Operations Research 45, 148–152 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Voß, S., Fink, A. (2012). Hybridizing Reactive Tabu Search with Simulated Annealing. In: Hamadi, Y., Schoenauer, M. (eds) Learning and Intelligent Optimization. LION 2012. Lecture Notes in Computer Science, vol 7219. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34413-8_53
Download citation
DOI: https://doi.org/10.1007/978-3-642-34413-8_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34412-1
Online ISBN: 978-3-642-34413-8
eBook Packages: Computer ScienceComputer Science (R0)