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

Computers and Operations Research

Volumn 43, Issue , 2014, Pages 286-291

  Saifullah Hussin, Mohamed ^a   Stützle, Thomas ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Quadratic Assignment Problem; Simulated Annealing; Tabu Search

Indexed keywords

METAHEURISTIC; PERFORMANCE COMPARISON; QUADRATIC ASSIGNMENT PROBLEMS; RELATIVE PERFORMANCE; SIMULATED ANNEALING ALGORITHMS; TS-ALGORITHMS;

COMBINATORIAL OPTIMIZATION; SIMULATED ANNEALING; TABU SEARCH;

ALGORITHMS;

EID: 84886731787     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2013.10.007     Document Type: Article

References (18)

1. R.E. Burkard, E. Çela, P.M. Pardalos, and L.S. Pitsoulis The quadratic assignment problem P.M. Pardalos, D.-Z. Du, Handbook of combinatorial optimization vol. 2 1998 Kluwer Academic Publishers Dordrecht, The Netherlands 241 338
2. E. Çela The quadratic assignment problem theory and algorithms 1998 Kluwer Academic Publishers Dordrecht, The Netherlands
3. E.M. Loiola, N.M.M. de Abreu, P.O. Boaventura-Netto, P. Hahn, and T. Querido A survey for the quadratic assignment problem Eur J Oper Res 176 2 2007 657 690 (Pubitemid 44537635)
4. M.A. Arostegui, S. Kadipasaoglu, and B.M. Khumawala An empirical comparison of tabu search, simulated annealing, and genetic algorithms for facilities location problems Int J Prod Econ 103 2 2006 742 754 (Pubitemid 44038504)
5. R. Battiti, and G. Tecchiolli Simulated annealing and tabu search in the long run a comparison on QAP tasks Comput Math Appl 28 6 1994 1 8
6. M. Sinclair Comparison of the performance of modern heuristics for combinatorial optimization on real data Comput Oper Res 20 7 1993 687 695 10.1016/0305-0548(93)90056-O (Pubitemid 23674121)
7. W.-C. Chiang, and C. Chiang Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation Eur J Oper Res 106 2-3 1998 457 488 (Pubitemid 128399663)
8. L.M. Gambardella, É.D. Taillard, and M. Dorigo Ant colonies for the quadratic assignment problem J Oper Res Soc 50 2 1999 167 176
9. J. Paulli A computational comparison of simulated annealing and tabu search applied to the assignment problem Appl Simulated Annealing 46 1 1993 85 102
10. É.D. Taillard Robust taboo search for the quadratic assignment problem Parallel Comput 17 4-5 1991 443 455
11. G. Paul Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem Oper Res Lett 38 6 2010 577 581
12. É.D. Taillard Comparison of iterative searches for the quadratic assignment problem Locat Sci 3 2 1995 87 105
13. R. Battiti, and G. Tecchiolli The reactive tabu search ORSA J Comput 6 2 1994 126 140
14. D.T. Connolly An improved annealing scheme for the QAP Eur J Oper Res 46 1 1990 93 100
15. Wang J-C. Solving quadratic assignment problems by a tabu based simulated annealing algorithm. In: Proceedings of 2007 international conference on intelligent and advanced systems, ICIAS 2007, Kuala Lumpur, Malaysia; 2007. p. 75-80.
16. C. Nugent, T. Vollman, and J. Ruml An experimental comparison of techniques for the assignment of facilities to locations Oper Res 16 1 1968 150 173
17. J. Skorin-Kapov Tabu search applied to the quadratic assignment problem ORSA J Comput 2 1 1990 33 45
18. Birattari M. On the estimation of the expected performance of a metaheuristic on a class of instances. How many instances, how many runs?, Technical Report TR/IRIDIA/2004-001, IRIDIA. Belgium, Brussels: Université Libre de Bruxelles; 2004.