A Comparative Study of Meta-heuristic Algorithms for Solving Quadratic Assignment Problem

Quadratic Assignment Problem (QAP) is an NP-hard combinatorial optimization problem, therefore, solving the QAP requires applying one or more of the meta-heuristic algorithms. This paper presents a comparative study between Meta-heuristic algorithms: Genetic Algorithm, Tabu Search, and Simulated annealing for solving a real-life (QAP) and analyze their performance in terms of both runtime efficiency and solution quality. The results show that Genetic Algorithm has a better solution quality while Tabu Search has a faster execution time in comparison with other Meta-heuristic algorithms for solving QAP.

[1]  Ping Ji,et al.  Solving the Quadratic Assignment Problems by a Genetic Algorithm with a New Replacement Strategy , 2007 .

[2]  Sanjay Silakari,et al.  Survey of Metaheuristic Algorithms for Combinatorial Optimization , 2012 .

[3]  M. Bashiri,et al.  Effective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons , 2012 .

[4]  Basheer M. Khumawala,et al.  An empirical comparison of tabu search, simulated annealing, and genetic algorithms for facilities location problems , 1997 .

[5]  S. E. Karisch,et al.  QAPLIB-A quadratic assignment problem library , 1991 .

[6]  N. Jawahar,et al.  A new iterated fast local search heuristic for solving QAP formulation in facility layout design , 2009 .

[7]  Franz Rendl,et al.  QAPLIB – A Quadratic Assignment Problem Library , 1997, J. Glob. Optim..

[8]  Gerald Paul,et al.  Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem , 2010, Oper. Res. Lett..

[9]  Bajeh Optimization: A Comparative Study of Genetic and Tabu Search Algorithms , 2011 .

[10]  Carsten Witt,et al.  Bioinspired Computation in Combinatorial Optimization , 2010, Bioinspired Computation in Combinatorial Optimization.

[11]  Harold W. Lewis,et al.  A New Optimization Algorithm For Combinatorial Problems , 2013 .

[13]  I. Chorbev,et al.  The Adaptive Tabu Search and Its Application to the Quadratic Assignment Problem , 2006 .

[14]  Panos M. Pardalos,et al.  Quadratic Assignment Problem , 1997, Encyclopedia of Optimization.

[15]  S. M. H. Seyedkashi,et al.  New Simulated Annealing Algorithm for Quadratic Assignment Problem , 2010 .

[16]  A P Adewole,et al.  A Comparative Study of Simulated Annealing and Genetic Algorithm for Solving the Travelling Salesman Problem , 2012 .

[17]  Clayton W. Commander,et al.  A Survey of the Quadratic Assignment Problem, with Applications , 2003 .

[18]  M. S. Hussin,et al.  Tabu Search vs. Simulated Annealing for Solving Large Quadratic Assignment Instances , 2010 .