Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances |
| |
| Affiliation: | 1. Tufts University School of Medicine, 136 Harrison Ave, Boston, MA, 02111;2. Department of Anesthesia, Critical Care and Pain Medicine, Massachusetts General Hospital, 55 Fruit Street, Boston, MA, 02114;3. University of California, 252 Irvine Hall, Irvine, CA, 92697;4. Department of Surgery, Massachusetts General Hospital, 55 Fruit Street, Boston, MA, 02114;5. Harvard Medical School, 25 Shattuck Street, Boston, MA, 02115;6. Department of Emergency Medicine, Brigham and Women''s Hospital, 75 Francis Street, Boston, MA, 02115;7. Department of Nutrition and Food Services, Massachusetts General Hospital, 55 Fruit Street, Boston, MA, 02114 |
| |
| Abstract: | Performance comparisons between algorithms have a long tradition in metaheuristic research. An early example is comparisons between Tabu Search (TS) and Simulated Annealing (SA) algorithms for tackling the Quadratic Assignment Problem (QAP). The results of these comparisons are to a certain extent inconclusive, even when focusing on only these two types of algorithms. While comparisons of SA and TS algorithms were based on rather small-sized instances, here we focus on possible dependencies of the relative performance between SA and TS algorithms on instance size. In fact, our experimental results show that the assertion whether one algorithm is better than the other can depend strongly on QAP instance size even if one focuses on instances with otherwise same characteristics. |
| |
| Keywords: | Tabu Search Simulated Annealing Quadratic Assignment Problem |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
