%0 Journal Article
%T Effective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
%J Journal of Industrial Engineering, International
%I Islamic Azad University, South Tehran Branch
%Z 1735-5702
%A Bashiri, Mahdi
%A Karimi, Hossein
%D 2012
%\ 01/01/2012
%V 8
%N 1
%P -
%! Effective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
%K quadratic assignment problem
%K Heuristics
%K Meta-heuristics
%K Tuning method
%R
%X Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and particle swarm optimization as meta-heuristic methods for the QAP. This research is dedicated to compare the relative percentage deviation of these solution qualities from the best known solution which is introduced in QAPLIB. Furthermore, a tuning method is applied for meta-heuristic parameters. Results indicate that TS is the best in 31% of QAPs, and the IFLS method, which is in the literature, is the best in 58 % of QAPs; these two methods are the same in 11% of test problems. Also, TS has a better computational time among heuristic and meta-heuristic methods.
%U http://jiei.azad.ac.ir/article_676441_3e4cf8fb85f693fc7267a69cf98012e1.pdf