A comprehensive review of quadratic assignment problem: variants, hybrids and applications

Mohamed Abdel-Basset, Gunasekaran Manogaran, Heba Rashad, Abdel Nasser H. Zaied

Research output: Contribution to journalArticlepeer-review

49 Citations (Scopus)


The quadratic assignment problem (QAP) has considered one of the most significant combinatorial optimization problems due to its variant and significant applications in real life such as scheduling, production, computer manufacture, chemistry, facility location, communication, and other fields. QAP is NP-hard problem that is impossible to be solved in polynomial time when the problem size increases, hence heuristic and metaheuristic approaches are utilized for solving the problem instead of exact approaches, because these approaches achieve quality in the solution in short computation time. The objectives of this paper are to describe QAP in details showing its types, nature of the problem, complexity of the problem, importance, and simple example. QAP formulations, problems related with QAP, solution techniques, QAP benchmark instances, applications of QAP, survey of QAP researches are also illustrated.

Original languageEnglish
Pages (from-to)1-24
Number of pages24
JournalJournal of Ambient Intelligence and Humanized Computing
Issue number3
Publication statusPublished - 20 Jun 2018
Externally publishedYes


Dive into the research topics of 'A comprehensive review of quadratic assignment problem: variants, hybrids and applications'. Together they form a unique fingerprint.

Cite this