Hybridizing reactive tabu search with simulated annealing

Authors:
Stefan Voß;Andreas Fink
Affiliations:
Institute of Information Systems (IWI), University of Hamburg, Hamburg, Germany;Chair of Information Systems, Helmut-Schmidt-University / UniBw Hamburg, Hamburg, Germany
Venue:
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Year:
2012

Citing 1
Cited 1

Optimization by simulated annealing: an experimental evaluation. Part I, graph partitioning

Operations Research

A hybridized tabu search approach for the minimum weight vertex cover problem

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

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.