• Citer

Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances

par Bin Hussin, Mohamed Saifullah ;Stützle, Thomas
Référence Computers & operations research, 43, page (286-291)
Publication Publié, 2014

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

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. © 2013 Elsevier Ltd.