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

✍ Scribed by R. Battiti; G. Tecchiolli

• Publisher: Elsevier Science
• Year: 1994
• Tongue: English
• Weight: 694 KB
• Volume: 28
• Category: Article
• ISSN: 0898-1221
• DOI: 10.1016/0898-1221(94)00147-2

✦ Synopsis

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.