Cover Image

Quadratic Assignment Problem (Model, Applications, Solutions): Review Paper

n operations research, Quadratic Assignment Problem (QAP) is a significant combinatorial optimization problem. When the size of the QAP problem increases, it becomes impossible to solve the problem in polynomial time. Several practical problems such as hospital and campus la...

Full description

Saved in:
Bibliographic Details
Main Authors: Hameed, Asaad Shakir, Mohd Aboobaider, Burhanuddin, Mutar, Modhi Lafta, Ngo, Hea Choon
Format: Article
Language:English
Published: Science and Engineering Research Support Society 2020
Online Access:http://eprints.utem.edu.my/id/eprint/25021/2/ASAADSHAKIRHAMEEDMABURHANUDDIN%20QUADRATIC%20ASSIGNMENT%20PROBLEM.PDF
http://eprints.utem.edu.my/id/eprint/25021/
http://sersc.org/journals/index.php/IJAST/article/view/13243/6781
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utem.eprints.25021
record_format eprints
spelling my.utem.eprints.250212021-04-20T12:59:08Z http://eprints.utem.edu.my/id/eprint/25021/ Quadratic Assignment Problem (Model, Applications, Solutions): Review Paper Hameed, Asaad Shakir Mohd Aboobaider, Burhanuddin Mutar, Modhi Lafta Ngo, Hea Choon n operations research, Quadratic Assignment Problem (QAP) is a significant combinatorial optimization problem. When the size of the QAP problem increases, it becomes impossible to solve the problem in polynomial time. Several practical problems such as hospital and campus layout, allocation of gates to airplanes in airports and electrical backboard wiring problems can bemodeled as QAP. The QAP model seeks to identify the optimal distribution of N facilities to N locations in a way that minimizes the total traveling cost based on the distance between every pair of a location and the amount of traffic between every pair of facilities of organizational units within a building. Against this background, there are two main approaches have been suggested to deal with QAP, and they are, the Exact and Approximate (Heuristic and Metaheuristic) approaches. The exact approach provides a global optimal solution for the small size of QAP, while the approximate approaches can find the optimal or a near-optimal solution at a reasonable time for large-sized QAP. The objectives of this study are as follows: (i) To analysis the QAP model, (ii) To conduct a comprehensive survey of the methods that have been used to solve the QAP model, (iii) To identify the issues and limitations of the methods in (ii), and (iv) to explore the best approach that can be used in enhancing the solutions of QAPmodel within a reasonable time based on the accuracy of algorithm. The results show that the hybrid metaheuristic approach has the capability of finding the best results within a reasonable time for the large sized problem. Science and Engineering Research Support Society 2020-05 Article PeerReviewed text en http://eprints.utem.edu.my/id/eprint/25021/2/ASAADSHAKIRHAMEEDMABURHANUDDIN%20QUADRATIC%20ASSIGNMENT%20PROBLEM.PDF Hameed, Asaad Shakir and Mohd Aboobaider, Burhanuddin and Mutar, Modhi Lafta and Ngo, Hea Choon (2020) Quadratic Assignment Problem (Model, Applications, Solutions): Review Paper. International Journal of Advanced Science and Technology, 29 (7). pp. 450-460. ISSN 2005-4238 http://sersc.org/journals/index.php/IJAST/article/view/13243/6781
institution Universiti Teknikal Malaysia Melaka
building UTEM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknikal Malaysia Melaka
content_source UTEM Institutional Repository
url_provider http://eprints.utem.edu.my/
language English
description n operations research, Quadratic Assignment Problem (QAP) is a significant combinatorial optimization problem. When the size of the QAP problem increases, it becomes impossible to solve the problem in polynomial time. Several practical problems such as hospital and campus layout, allocation of gates to airplanes in airports and electrical backboard wiring problems can bemodeled as QAP. The QAP model seeks to identify the optimal distribution of N facilities to N locations in a way that minimizes the total traveling cost based on the distance between every pair of a location and the amount of traffic between every pair of facilities of organizational units within a building. Against this background, there are two main approaches have been suggested to deal with QAP, and they are, the Exact and Approximate (Heuristic and Metaheuristic) approaches. The exact approach provides a global optimal solution for the small size of QAP, while the approximate approaches can find the optimal or a near-optimal solution at a reasonable time for large-sized QAP. The objectives of this study are as follows: (i) To analysis the QAP model, (ii) To conduct a comprehensive survey of the methods that have been used to solve the QAP model, (iii) To identify the issues and limitations of the methods in (ii), and (iv) to explore the best approach that can be used in enhancing the solutions of QAPmodel within a reasonable time based on the accuracy of algorithm. The results show that the hybrid metaheuristic approach has the capability of finding the best results within a reasonable time for the large sized problem.
format Article
author Hameed, Asaad Shakir
Mohd Aboobaider, Burhanuddin
Mutar, Modhi Lafta
Ngo, Hea Choon
spellingShingle Hameed, Asaad Shakir
Mohd Aboobaider, Burhanuddin
Mutar, Modhi Lafta
Ngo, Hea Choon
Quadratic Assignment Problem (Model, Applications, Solutions): Review Paper
author_facet Hameed, Asaad Shakir
Mohd Aboobaider, Burhanuddin
Mutar, Modhi Lafta
Ngo, Hea Choon
author_sort Hameed, Asaad Shakir
title Quadratic Assignment Problem (Model, Applications, Solutions): Review Paper
title_short Quadratic Assignment Problem (Model, Applications, Solutions): Review Paper
title_full Quadratic Assignment Problem (Model, Applications, Solutions): Review Paper
title_fullStr Quadratic Assignment Problem (Model, Applications, Solutions): Review Paper
title_full_unstemmed Quadratic Assignment Problem (Model, Applications, Solutions): Review Paper
title_sort quadratic assignment problem (model, applications, solutions): review paper
publisher Science and Engineering Research Support Society
publishDate 2020
url http://eprints.utem.edu.my/id/eprint/25021/2/ASAADSHAKIRHAMEEDMABURHANUDDIN%20QUADRATIC%20ASSIGNMENT%20PROBLEM.PDF
http://eprints.utem.edu.my/id/eprint/25021/
http://sersc.org/journals/index.php/IJAST/article/view/13243/6781
_version_ 1698700619997511680
score 13.211869

Similar Items