Effective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons

Artikel

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.

Object Details

• Language: Englisch

References and Relationships

• Bibliographic citation: Journal: Journal of Industrial Engineering International ; ISSN: 2251-712X ; Volume: 8 ; Year: 2012 ; Pages: 1-9 ; Heidelberg: Springer

Classification and Topics

• Classification: Management
• Subject: quadratic assignment problem ; heuristics ; meta-heuristics ; tuning method

Contributors, Places and Time

• Event: Geistige Schöpfung
• (who): Bashiri, Mahdi ; Karimi, Hossein
• Event: Veröffentlichung
• (who): Springer
• (where): Heidelberg
• (when): 2012

Further information

• DOI: doi:10.1186/2251-712X-8-6
• Handle: http://hdl.handle.net/10419/78571
• Last update: 10.03.2025, 11:44 AM CET