Simulated annealing and Tabu search in the long run: A comparison on QAP tasks

Simulated Annealing (SA) and Tabu Search (TS) are compared on the Quadratic Assignment Problem. A recent work on the same benchmark suite argued that SA could achieve a reasonable solution quality with fewer function evaluations than TS. The discussion is extended by showing that the conclusions mus...

Full description

Saved in:
Bibliographic Details
Published inComputers & mathematics with applications (1987) Vol. 28; no. 6; pp. 1 - 8
Main Authors Battiti, R., Tecchiolli, G.
Format Journal Article
LanguageEnglish
Published Oxford Elsevier Ltd 01.09.1994
Elsevier
Subjects
Applied sciences
Combinatorial optimization
Exact sciences and technology
Flows in networks. Combinatorial problems
Heuristic search
Operational research and scientific management
Operational research. Management science
Quadratic assignment problem
Simulated annealing
Tabu search
Heuristic search
Quadratic assignment problem
Tabu search
Combinatorial optimization
Simulated annealing
Quadratic assignment
Comparative study
Heuristic method
Online AccessGet full text

Cover

More Information
Summary:Simulated Annealing (SA) and Tabu Search (TS) are compared on the Quadratic Assignment Problem. A recent work on the same benchmark suite argued that SA could achieve a reasonable solution quality with fewer function evaluations than TS. The discussion is extended by showing that the conclusions must be changed if the task is hard or a very good approximation of the optimal solution is desired, or if CPU time is the relevant parameter. In addition, a recently proposed version of TS (the Reactive Tabu Search) solves the problem of finding the proper list size with an automatic memory-based reaction mechanism.
ISSN:0898-1221
1873-7668
DOI:10.1016/0898-1221(94)00147-2