Please use this identifier to cite or link to this item:
Bashiri, Mahdi
Karimi, Hossein
Year of Publication: 
[Journal:] Journal of Industrial Engineering International [ISSN:] 2251-712X [Volume:] 8 [Year:] 2012 [Pages:] 1-9
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.
quadratic assignment problem
tuning method
Persistent Identifier of the first edition: 
Creative Commons License:
Document Type: 

Files in This Item:
858.96 kB

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.