A comprehensive review of quadratic assignment problem: variants, hybrids and applications
Search citation statements
Paper Sections
Citation Types
Year Published
Publication Types
Relationship
![](http://nandemo.space/777/templates/cheerup1/res/banner1.gif)
Cited by 39 publication s
References 176 publication s, exact extended formulation of the linear assignment problem (lap) polytope for solving the traveling salesman and quadratic assignment problems.
We present an O(n 6 ) linear programming model for the traveling salesman (TSP) and quadratic assignment (QAP) problems. The basic model is developed within the framework of the TSP. It does not involve the city-to-city variables-based, traditional TSP polytope referred to in the literature as "the TSP polytope." We do not model explicit Hamiltonian cycles of the cities. Instead, we use a time-dependent abstraction of TSP tours and develop a direct extended formulation of the linear assignment problem (LAP) polytope. The model is exact in the sense that it has integral extreme points which are in one-to-one correspondence with TSP tours. It can be solved optimally using any linear programming (LP) solver, hence offering a new (incidental) proof of the equality of the computational complexity classes "P " and "N P ." The extensions of the model to the time-dependent traveling salesman problem (TDTSP) as well as the quadratic assignment problem (QAP) are straightforward. The reasons for the non-applicability of existing negative extended formulations results for "the TSP polytope" to the model in this paper as well as our software implementation and the computational experimentation we conducted are briefly discussed.
A Hybrid Genetic-Hierarchical Algorithm for the Quadratic Assignment Problem
In this paper, we present a hybrid genetic-hierarchical algorithm for the solution of the quadratic assignment problem. The main distinguishing aspect of the proposed algorithm is that this is an innovative hybrid genetic algorithm with the original, hierarchical architecture. In particular, the genetic algorithm is combined with the so-called hierarchical (self-similar) iterated tabu search algorithm, which serves as a powerful local optimizer (local improvement algorithm) of the offspring solutions produced by the crossover operator of the genetic algorithm. The results of the conducted computational experiments demonstrate the promising performance and competitiveness of the proposed algorithm.
A new hybrid approach based on discrete differential evolution algorithm to enhancement solutions of quadratic assignment problem
The Combinatorial Optimization Problem (COPs) is one of the branches of applied mathematics and computer sciences, which is accompanied by many problems such as Facility Layout Problem (FLP), Vehicle Routing Problem (VRP), etc. Even though the use of several mathematical formulations is employed for FLP, Quadratic Assignment Problem (QAP) is one of the most commonly used. One of the major problems of Combinatorial NP-hard Optimization Problem is QAP mathematical model. Consequently, many approaches have been introduced to solve this problem, and these approaches are classified as Approximate and Exact methods. With QAP, each facility is allocated to just one location, thereby reducing cost in terms of aggregate distances weighted by flow values. The primary aim of this study is to propose a hybrid approach which combines Discrete Differential Evolution (DDE) algorithm and Tabu Search (TS) algorithm to enhance solutions of QAP model, to reduce the distances between the locations by finding the best distribution of N facilities to N locations, and to implement hybrid approach based on discrete differential evolution (HDDETS) on many instances of QAP from the benchmark. The performance of the proposed approach has been tested on several sets of instances from the data set of QAP and the results obtained have shown the effective performance of the proposed algorithm in improving several solutions of QAP in reasonable time. Afterwards, the proposed approach is compared with other recent methods in the literature review. Based on the computation results, the proposed hybrid approach outperforms the other methods.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
Contact Info
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.
- Sociocultural Anthropology
- Cultural Evolution
- Anthropology
- Cultural Anthropology
Quadratic assignment problem variants: A survey and an effective parallel memetic iterated tabu search
- November 2020
- European Journal of Operational Research 292(3):1066-1084
- 292(3):1066-1084
![a comprehensive review of quadratic assignment problem variants hybrids and applications Allyson Silva at 1QBit](https://i1.rgstatic.net/ii/profile.image/827624083439617-1574332366490_Q64/Allyson-Silva.jpg)
- Université Laval
![a comprehensive review of quadratic assignment problem variants hybrids and applications Maryam Darvish at Université Laval](https://i1.rgstatic.net/ii/profile.image/360941712625665-1463066618430_Q64/Maryam-Darvish.jpg)
Discover the world's research
- 25+ million members
- 160+ million publication pages
- 2.3+ billion citations
No full-text available
![a comprehensive review of quadratic assignment problem variants hybrids and applications Request Full-text Paper PDF](https://www.researchgate.net/images/symbols/publication/publication_pdf_icon.png)
To read the full-text of this research, you can request a copy directly from the authors.
- BUILD ENVIRON
![a comprehensive review of quadratic assignment problem variants hybrids and applications Jinwoo Choi](https://i1.rgstatic.net/ii/profile.image/872203868446723-1584961015593_Q64/Jinwoo-Choi-11.jpg)
- COMPUT ELECTR ENG
![a comprehensive review of quadratic assignment problem variants hybrids and applications Seyed Mehdi Mohtavipour](https://i1.rgstatic.net/ii/profile.image/11431281200479219-1697963363977_Q64/Seyed-Mohtavipour.jpg)
- Hadi Shahriar Shahhoseini
- Frederick L. Jatzkowski
- Antonia Schmidt
- Robert Mank
![a comprehensive review of quadratic assignment problem variants hybrids and applications Matthias Müller-Hannemann](https://i1.rgstatic.net/ii/profile.image/272396024283144-1441955681305_Q64/Matthias-Mueller-Hannemann.jpg)
- Sébastien Verel
- Sarah L. Thomson
![a comprehensive review of quadratic assignment problem variants hybrids and applications Desi Novianti](https://c5.rgstatic.net/m/4671872220764/images/template/default/profile/profile_default_m.jpg)
- ENG APPL ARTIF INTEL
![a comprehensive review of quadratic assignment problem variants hybrids and applications Amir M. Fathollahi-Fard](https://i1.rgstatic.net/ii/profile.image/11431281148952180-1681760178415_Q64/Amir-Fathollahi-Fard.jpg)
- Mohammed Aljuaid
- Karuna Panwar
![a comprehensive review of quadratic assignment problem variants hybrids and applications Kusum Deep](https://i1.rgstatic.net/ii/profile.image/272812195708933-1442054904366_Q64/Kusum-Deep-2.jpg)
- Dominic Schuhmacher
- Leoni Carla Wirth
![a comprehensive review of quadratic assignment problem variants hybrids and applications Toufik Mzili](https://i1.rgstatic.net/ii/profile.image/1164355592822784-1654615414190_Q64/Toufik-Mzili-2.jpg)
- Quang Anh Pham
- Hoong Chuin Lau
- Minh Hoàng Hà
![a comprehensive review of quadratic assignment problem variants hybrids and applications Lam Vu](https://i1.rgstatic.net/ii/profile.image/11431281207370440-1701186196557_Q64/Lam-Vu-18.jpg)
- Abolfazl Ghanbari
![a comprehensive review of quadratic assignment problem variants hybrids and applications Meysam Argany](https://i1.rgstatic.net/ii/profile.image/517216090824705-1500325333997_Q64/Meysam-Argany.jpg)
- Yameng Wang
- Xiumei Wang
![a comprehensive review of quadratic assignment problem variants hybrids and applications Jonathan Duque Gallego](https://c5.rgstatic.net/m/4671872220764/images/template/default/profile/profile_default_m.jpg)
- Mahdis Bayani
![a comprehensive review of quadratic assignment problem variants hybrids and applications Borzou Rostami](https://i1.rgstatic.net/ii/profile.image/11431281078521961-1660076119213_Q64/Borzou-Rostami.jpg)
- Yossiri Adulyasak
![a comprehensive review of quadratic assignment problem variants hybrids and applications Louis-Martin Rousseau](https://i1.rgstatic.net/ii/profile.image/372899761410049-1465917639885_Q64/Louis-Martin-Rousseau.jpg)
- Said Mohsine
- Mohammed Essaid Riffi
- Daniel Soto
- Wilson Soto
- COMPUT IND ENG
![a comprehensive review of quadratic assignment problem variants hybrids and applications Haibo Wang](https://c5.rgstatic.net/m/4671872220764/images/template/default/profile/profile_default_m.jpg)
- Seungmo Kim
- Yeonho Jeong
- Jae-Won Nam
- NEURAL COMPUT APPL
![a comprehensive review of quadratic assignment problem variants hybrids and applications Tansel Dökeroğlu](https://i1.rgstatic.net/ii/profile.image/1062902735859712-1630427168427_Q64/Tansel-Doekeroglu.jpg)
- APPL SOFT COMPUT
- Oylum Şeker
![a comprehensive review of quadratic assignment problem variants hybrids and applications Neda Tanoumand](https://i1.rgstatic.net/ii/profile.image/279895709110273-1443743745195_Q64/Neda-Tanoumand.jpg)
- EUR J OPER RES
![a comprehensive review of quadratic assignment problem variants hybrids and applications Qing Zhou](https://i1.rgstatic.net/ii/profile.image/922533318651904-1596960491226_Q64/Qing-Zhou-52.jpg)
- Gunasekaran Manogaran
- Heba Rashad
![a comprehensive review of quadratic assignment problem variants hybrids and applications Abdel Nasser H. Zaied](https://i1.rgstatic.net/ii/profile.image/836672199614465-1576489605911_Q64/Abdel-Nasser-Zaied.jpg)
- Abhilash Chaparala
- EXPERT SYST APPL
![a comprehensive review of quadratic assignment problem variants hybrids and applications Una Benlic](https://i1.rgstatic.net/ii/profile.image/285338334449670-1445041368838_Q64/Una-Benlic-2.jpg)
- Michele Monaci
![a comprehensive review of quadratic assignment problem variants hybrids and applications Domenico Salvagnin](https://i1.rgstatic.net/ii/profile.image/272189870047234-1441906530577_Q64/Domenico-Salvagnin.jpg)
- Maciej Drwal
![a comprehensive review of quadratic assignment problem variants hybrids and applications Axel Nyberg](https://c5.rgstatic.net/m/4671872220764/images/template/default/profile/profile_default_m.jpg)
- APPL MATH COMPUT
![a comprehensive review of quadratic assignment problem variants hybrids and applications Thé Van Luong](https://i1.rgstatic.net/ii/profile.image/276978881056776-1443048319853_Q64/The-Van-Luong.jpg)
- Mohamed Abdel-Baset
- M. Gunsekaran
![a comprehensive review of quadratic assignment problem variants hybrids and applications Doaa El-Shahat](https://i1.rgstatic.net/ii/profile.image/735487807479812-1552365366646_Q64/Doaa-El-Shahat.jpg)
- Krešimir Mihić
- R.E. Burkard
- Yagmur Aksan
![a comprehensive review of quadratic assignment problem variants hybrids and applications Alan Mckendall](https://c5.rgstatic.net/m/4671872220764/images/template/default/profile/profile_default_m.jpg)
- Gerhard J. Woeginger
- Matthew Harris
![a comprehensive review of quadratic assignment problem variants hybrids and applications Regina Berretta](https://c5.rgstatic.net/m/4671872220764/images/template/default/profile/profile_default_m.jpg)
- M.A. Pollatschek
- N. Gershoni
- Y.T. Radday
![a comprehensive review of quadratic assignment problem variants hybrids and applications Abraham P. Punnen](https://i1.rgstatic.net/ii/profile.image/272476924018702-1441974969682_Q64/Abraham-Punnen.jpg)
- Bronislovas Kilda
![a comprehensive review of quadratic assignment problem variants hybrids and applications Hanif D. Sherali](https://i1.rgstatic.net/ii/profile.image/273755591147537-1442279827613_Q64/Hanif-Sherali.jpg)
- Warren P. Adams
- Nav Res Logist Q
- Harold Greenberg
- Yusuf Ziya Ünal
![a comprehensive review of quadratic assignment problem variants hybrids and applications Özgür Uysal](https://c5.rgstatic.net/m/4671872220764/images/template/default/profile/profile_default_m.jpg)
- J PARALLEL DISTR COM
- Michał Czapiński
![a comprehensive review of quadratic assignment problem variants hybrids and applications Huizhen Zhang](https://i1.rgstatic.net/ii/profile.image/278866095558661-1443498266138_Q64/Huizhen-Zhang-2.jpg)
- Alwalid N. Elshafei
![a comprehensive review of quadratic assignment problem variants hybrids and applications Weihang Zhu](https://i1.rgstatic.net/ii/profile.image/272629009481767-1442011229966_Q64/Weihang-Zhu.jpg)
- James Curry
![a comprehensive review of quadratic assignment problem variants hybrids and applications Alberto Marquez](https://i1.rgstatic.net/ii/profile.image/272809612017695-1442054288415_Q64/Alberto-Marquez-3.jpg)
- J OPER RES SOC
- H. A. Eiselt
- Gilbert Laporte
- Wolfgang Domschke
- Peter Forst
![a comprehensive review of quadratic assignment problem variants hybrids and applications Stefan Voss](https://i1.rgstatic.net/ii/profile.image/272211420381197-1441911668590_Q64/Stefan-Voss-3.jpg)
- Eugene Woolsey
- Leon Steinberg
- Transport Res
- J. W. Dickey
- J. W. Hopkins
- OPER RES LETT
![a comprehensive review of quadratic assignment problem variants hybrids and applications Ioannis Milis](https://i1.rgstatic.net/ii/profile.image/272802766913557-1442052656808_Q64/Ioannis-Milis.jpg)
- Alain Sutter
![a comprehensive review of quadratic assignment problem variants hybrids and applications Panos Pardalos](https://i1.rgstatic.net/ii/profile.image/272239648047117-1441918398828_Q64/Panos-Pardalos.jpg)
- James V. Crouse
![a comprehensive review of quadratic assignment problem variants hybrids and applications Martin Skutella](https://i1.rgstatic.net/ii/profile.image/941537928179726-1601491543993_Q64/Martin-Skutella-2.jpg)
- Michael C. Fu
- Bharat K. Kaku
- Eugene L. Lawler
- Recruit researchers
- Join for free
- Login Email Tip: Most researchers use their institutional email address as their ResearchGate login Password Forgot password? Keep me logged in Log in or Continue with Google Welcome back! Please log in. Email · Hint Tip: Most researchers use their institutional email address as their ResearchGate login Password Forgot password? Keep me logged in Log in or Continue with Google No account? Sign up
A comprehensive review of quadratic assignment problem: variants, hybrids and applications
Research output : Contribution to journal › Article › peer-review
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 language | English |
---|---|
Pages (from-to) | 1-24 |
Number of pages | 24 |
Journal | |
Volume | 9 |
Issue number | 3 |
DOIs | |
Publication status | Published - 20 Jun 2018 |
Externally published | Yes |
Access to Document
- 10.1007/s12652-018-0917-x
Other files and links
- Link to publication in Scopus
Fingerprint
- Combinatorial optimization Engineering & Materials Science 100%
- NP-hard Engineering & Materials Science 88%
- Polynomials Engineering & Materials Science 70%
- Scheduling Engineering & Materials Science 62%
- Communication Engineering & Materials Science 45%
T1 - A comprehensive review of quadratic assignment problem
T2 - variants, hybrids and applications
AU - Abdel-Basset, Mohamed
AU - Manogaran, Gunasekaran
AU - Rashad, Heba
AU - Zaied, Abdel Nasser H.
N1 - Publisher Copyright: © 2018 Springer-Verlag GmbH Germany, part of Springer Nature
PY - 2018/6/20
Y1 - 2018/6/20
N2 - 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.
AB - 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.
KW - Complexity
KW - Exact approaches
KW - Formulations
KW - Heuristics approaches
KW - Metaheuristic approaches
KW - NP-hard
KW - Quadratic assignment problem
UR - http://www.scopus.com/inward/record.url?scp=85049559984&partnerID=8YFLogxK
U2 - 10.1007/s12652-018-0917-x
DO - 10.1007/s12652-018-0917-x
M3 - Article
AN - SCOPUS:85049559984
SN - 1868-5137
JO - Journal of Ambient Intelligence and Humanized Computing
JF - Journal of Ambient Intelligence and Humanized Computing
![a comprehensive review of quadratic assignment problem variants hybrids and applications ACM Digital Library home](https://dl.acm.org/specs/products/acm/releasedAssets/images/acm-dl-logo-white-1ecfb82271e5612e8ca12aa1b1737479.png)
- Advanced Search
Selection hyper-heuristics for the multi and many-objective quadratic assignment problem
New citation alert added.
This alert has been successfully added and will be sent to:
You will be notified whenever a record that you have chosen has been cited.
To manage your alert preferences, click on the button below.
New Citation Alert!
Please log in to your account
Information & Contributors
Bibliometrics & citations, view options, graphical abstract.
- Irawan C Salhi S Jones D Dai J Liu M (2024) A dry port hub-and-spoke network design Computers and Operations Research 10.1016/j.cor.2024.106646 167 :C Online publication date: 1-Jul-2024 https://dl.acm.org/doi/10.1016/j.cor.2024.106646
- Torres F Júnior V Costa D Cardoso D Oliveira R (2023) Radio resource allocation in a 6G D-OMA network with imperfect SIC Engineering Applications of Artificial Intelligence 10.1016/j.engappai.2023.105830 119 :C Online publication date: 1-Mar-2023 https://dl.acm.org/doi/10.1016/j.engappai.2023.105830
- Bouaziz H Bardou D Berghida M Chouali S Lemouari A (2023) A novel hybrid multi-objective algorithm to solve the generalized cubic cell formation problem Computers and Operations Research 10.1016/j.cor.2022.106069 150 :C Online publication date: 1-Feb-2023 https://dl.acm.org/doi/10.1016/j.cor.2022.106069
- Show More Cited By
Index Terms
Computing methodologies
Artificial intelligence
Search methodologies
Heuristic function construction
Mathematics of computing
Mathematical analysis
Mathematical optimization
Theory of computation
Design and analysis of algorithms
Recommendations
Hyper-heuristic based nsga-iii for the many-objective quadratic assignment problem.
The Quadratic Assignment Problem (QAP) can be subdivided into different versions, being present in several real-world applications. In this work, it is used a version that considers many objectives. QAP is an NP-hard problem, so approximate ...
Evolutionary many-objective optimization based on linear assignment problem transformations
The selection mechanisms that are most commonly adopted by multi-objective evolutionary algorithms (MOEAs) are based on Pareto optimality. However, recent studies have provided theoretical and experimental evidence regarding the unsuitability of Pareto-...
Transgenetic Algorithms for the Multi-objective Quadratic Assignment Problem
The multi-objective Quadratic Assignment Problem (mQAP) is a hard optimization problem with many real-world applications, such as in hospital layouts. The main purposes of this paper are: (1) the investigation of hybrid algorithms combining Transgenetic ...
Information
Published in.
Elsevier Science Ltd.
United Kingdom
Publication History
Author tags.
- Multi-objective optimization
- Many-objective optimization hyper-heuristics
- Research-article
![](http://nandemo.space/777/templates/cheerup1/res/banner1.gif)
Contributors
Other metrics, bibliometrics, article metrics.
- 4 Total Citations View Citations
- 0 Total Downloads
- Downloads (Last 12 months) 0
- Downloads (Last 6 weeks) 0
- Wang H Alidaee B (2023) A new hybrid-heuristic for large-scale combinatorial optimization Computers and Industrial Engineering 10.1016/j.cie.2023.109220 179 :C Online publication date: 1-May-2023 https://dl.acm.org/doi/10.1016/j.cie.2023.109220
View options
Login options.
Check if you have access through your login credentials or your institution to get full access on this article.
Full Access
Share this publication link.
Copying failed.
Share on social media
Affiliations, export citations.
- Please download or close your previous search result export first before starting a new bulk export. Preview is not available. By clicking download, a status dialog will open to start the export process. The process may take a few minutes but once it finishes a file will be downloadable from your browser. You may continue to browse the DL while the export process is in progress. Download
- Download citation
- Copy citation
We are preparing your search results for download ...
We will inform you here when the file is ready.
Your file of search results citations is now ready.
Your search export query has expired. Please try again.
A Hybrid Optimization GNA Algorithm for the Quadratic Assignment Problem Solving
- Conference paper
- First Online: 06 February 2019
- Cite this conference paper
- Kefaya Qaddoum 6 &
- Azmi Al Azzam 6
Part of the book series: Lecture Notes on Data Engineering and Communications Technologies ((LNDECT,volume 29))
Included in the following conference series:
- International Conference on Emerging Internetworking, Data & Web Technologies
730 Accesses
1 Citations
The quadratic assignment problem (QAP) was considered one of the most significant combinatorial optimization problems due to its variant and substantial applications in real life such as scheduling, production, computer manufacture, chemistry, facility location, communication, and other fields. QAP is an 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 methods. Optimization plays a significant role in easing this problem. In this paper, we will provide a solution to optimize QAP. In the QAP problem, there is a total of facilities (departments, company’s,…etc.) that must be located to minimize the flow (amount of material to be exchanged). Thus, the objective function is composed by multiplying both distances between the locations and the flow among these facilities. Global Neighborhood (GNA) Algorithm will be used to optimize the QAP problem, and the solution will also be compared to the well-known Genetic Algorithm (GA).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Subscribe and save.
- Get 10 units per month
- Download Article/Chapter or eBook
- 1 Unit = 1 Article or 1 Chapter
- Cancel anytime
- Available as PDF
- Read on any device
- Instant download
- Own it forever
- Available as EPUB and PDF
- Compact, lightweight edition
- Dispatched in 3 to 5 business days
- Free shipping worldwide - see info
Tax calculation will be finalised at checkout
Purchases are for personal use only
Institutional subscriptions
Similar content being viewed by others
Metaheuristics with Local Search Miscellany Applied to the Quadratic Assignment Problem for Large-Scale Instances
A Comparative Analysis of Genetic Algorithms and QAP Formulation for Facility Layout Problem: An Application in a Real Context
A comprehensive review of quadratic assignment problem: variants, hybrids and applications.
Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1 , 67–82 (1997)
Article Google Scholar
Glover, F.: The future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13 (5), 533–549 (1986)
Article MathSciNet Google Scholar
Reeves, C.R.: Modern Heuristic Techniques for Combinatorial Optimization Problems. Blackwell Scientific, Oxford (1993)
Google Scholar
Lee, K.S., Geem, Z.W.: A new structural optimization method based on the harmony search algorithm. Comput. Struct. 82 , 781–798 (2004)
Lee, K.S., Geem, Z.W.: A new meta-heuristic algorithm for continuous engineering optimization. Comput. Methods Appl. Mech. Eng. 194 (2005), 3902–3933 (2005)
Omran, M.G., Mahdavi, M.: Global-best harmony search. Appl. Math. Comput. 198 , 643–656 (2008)
MathSciNet MATH Google Scholar
Rechenberg, I.: Cybernetic solution path of an experimental problem, Royal Aircraft Establishment, Library Translation no. 1122 (1965)
Fogel, L.J., Owens, A.J., Walsh, M.J.: Artificial Intelligence Through Simulated Evolution. Wiley, Chichester (1996)
MATH Google Scholar
De Jong, K.: Analysis of the behavior of a class adaptive systems, Ph.D. Thesis. University of Michigan, Ann Arbor, MI (1975)
Koza, J.R.: Genetic programming: a paradigm for genetically breeding populations of computer programs to solve problems, Report No. STAN-CS-90- 1314. Stanford University, Stanford, CA (1990)
Goldberg, D.E.: Genetic Algorithms in Search Optimization and Machine Learning. Addison-Wesley, Boston (1989)
Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)
Glover, F.: Heuristic for integer programming using surrogate constraints. Decis. Sci. 8 (1), 156–166 (1977)
Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybernet. 26 (1), 29–41 (1996)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: IEEE International Conference on Neural Networks Perth, Australia, pp. 1942–1948 (1995)
Geem, Z.W., Kim, J.H., Loganathan, G.: A new heuristic optimization algorithm: harmony search. Simulation 76 (2), 60 (2001)
Nakrani, S., Tovey, C.: On honey bees and dynamic server allocation in internet hosting centers. Adapt. Behav. 12 (3–4), 223 (2004)
Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 220 (4598), 671–680 (1983)
Rashedi, E., Nezamabadi, H., Saryazdi, S.: GSA: a gravitational search algorithm. Inform. Sci. 179 (13), 2232–2248 (2009)
Engelbrecht, A.P.: Fundamentals of Computational Swarm Intelligence. Wiley, Hoboken (2006)
Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1 (1), 53–66 (1997)
Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science MHS 1995, pp. 39–43. IEEE (1995)
Alazzam, A., Lewis III, H.: A new optimization algorithm for combinatorial problems. (IJARAI) Int. J. Adv. Res. Artif. Intell. 2 (5) (2013)
Nugent, C.E., Vollman, T.E., Ruml, J.: An experimental comparison of techniques for the assignment of facilities to locations. Operations (1968)
Download references
Author information
Authors and affiliations.
Higher Colleges of Technology, Abu Dhabi, UAE
Kefaya Qaddoum & Azmi Al Azzam
You can also search for this author in PubMed Google Scholar
Corresponding author
Correspondence to Kefaya Qaddoum .
Editor information
Editors and affiliations.
Department of Information and Communication Engineering, Faculty of Information Engineering, Fukuoka Institute of Technology, Fukuoka, Japan
Leonard Barolli
Technical University of Catalonia, Barcelona, Spain
Fatos Xhafa
Computer Information Science (CIS), Higher Colleges of Technology, Fujairah Campus, Fujairah, United Arab Emirates
Zahoor Ali Khan
Faculty of Computer Information Science, Higher Colleges of Technology, Dubai Campus, Dubai, United Arab Emirates
Hamad Odhabi
Rights and permissions
Reprints and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper.
Qaddoum, K., Azzam, A.A. (2019). A Hybrid Optimization GNA Algorithm for the Quadratic Assignment Problem Solving. In: Barolli, L., Xhafa, F., Khan, Z., Odhabi, H. (eds) Advances in Internet, Data and Web Technologies. EIDWT 2019. Lecture Notes on Data Engineering and Communications Technologies, vol 29. Springer, Cham. https://doi.org/10.1007/978-3-030-12839-5_42
Download citation
DOI : https://doi.org/10.1007/978-3-030-12839-5_42
Published : 06 February 2019
Publisher Name : Springer, Cham
Print ISBN : 978-3-030-12838-8
Online ISBN : 978-3-030-12839-5
eBook Packages : Intelligent Technologies and Robotics Intelligent Technologies and Robotics (R0)
Share this paper
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative
- Publish with us
Policies and ethics
- Find a journal
- Track your research
- DOI: 10.5120/17693-8662
- Corpus ID: 61123582
A Survey of Quadratic Assignment Problems
- A. H. Zaied , Laila A. Shawky
- Published 18 September 2014
- Computer Science, Mathematics
- International Journal of Computer Applications
13 Citations
Solving the quadratic assignment problem with cooperative parallel extremal optimization, hybridization as cooperative parallelism for the quadratic assignment problem, solving quadratic assignment problem with fixed assignment (qapfa) using branch and bound approach, a comprehensive review of quadratic assignment problem: variants, hybrids and applications, quantum and digital annealing for the quadratic assignment problem, a variable neighbourhood search enhanced estimation of distribution algorithm for quadratic assignment problems, a new method for improving the performance of fast local search in solving qap for optimal exploration of state space, comparing qubo models for quantum annealing: integer encodings for permutation problems, a cooperative gpu-based parallel multistart simulated annealing algorithm for quadratic assignment problem, learning optimal parameters for multi-target tracking, 19 references, the quadratic assignment problem: a survey and recent developments, the quadratic assignment problem, a new lower bound for the quadratic assignment problem, applications of parametric programming and eigenvalue maximization to the quadratic assignment problem, breakout local search for the quadratic assignment problem, hospital layout as a quadratic assignment problem, a branch-and-bound algorithm for the quadratic assignment problem based on the hungarian method, on the use of exact and heuristic cutting plane methods for the quadratic assignment problem, optimal and suboptimal algorithms for the quadratic assignment problem, a survey of meta-heuristic solution methods for the quadratic assignment problem, related papers.
Showing 1 through 3 of 0 Related Papers
![](http://nandemo.space/777/templates/cheerup1/res/banner1.gif)
IMAGES
VIDEO
COMMENTS
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 ...
A comprehensive review of quadratic assignment problem: variants, hybrids and applications 1 3 These formulation has been applied in several researches such as Bazaraa and Elshafei (1979), Drezner (1995), Hahn and Grant (1998) and Gong et al. (1999). 2.3 Mixed integer linear programming (MILP) formulations
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 ...
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 quadratic assignment problem (QAP) has considered one of the most significant combinatorial ...
The assignment problem, with applications in supply chains, healthcare logistics, and production scheduling, represents a prominent optimization challenge. This paper focuses on addressing the Generalized Quadratic Assignment Problem (GQAP), a well-known NP-hard combinatorial optimization problem. To tackle the GQAP, we propose an OR analytical ...
The quadratic assignment problem (QAP) was introduced by Koopmans and Beckmann in 1957 as a mathematical model for the location of indivisible economical activities [].Consider the problem of allocating n facilities to n locations, with the cost being a function of the distance and flow between the facilities plus costs associated with placing a facility at a certain location.
A comprehensive review of quadratic assignment problem: variants, hybrids and applications. ... as a variant of the quadratic assignment problem, an Integer Programming model is proposed to solve ...
Abdel-Basset, M., Manogaran, G., Rashad, H., & Zaied, A. N. H. (2018). A comprehensive review of quadratic assignment problem: variants, hybrids and applications.
A comprehensive review of quadratic assignment problem: variants, hybrids and applications. https: ... Hezam I (2016a) Cuckoo search and genetic algorithm hybrid schemes for optimization problems. Appl Math 10(3):1185-1192 ... Abdel-Basset M, Hessin AN, Abdel-Fatah L (2016) A comprehensive study of cuckoo-inspired algorithms. Neural Comput ...
The quadratic assignment problem (QAP) is a well-known challenging combinatorial optimization problem that has received many researchers' attention with varied real-world and industrial applications areas. ... that a plethora of nature-inspired optimization algorithms have successfully been used to solve various optimization problems, including ...
The present paper is about describing these ideas and their impact in solving esc instances. Our method was able to solve, in a matter of seconds or minutes on a single PC, all easy cases (all esc16* plus esc32e and esc32g ). The three very hard instances esc32c, esc32d, and esc64a were solved in less than half an hour, in total, on a single PC.
Mentioning: 11 - A comprehensive review of quadratic assignment problem: variants, hybrids and applications - Abdel-Basset, Mohamed, Manogaran, Gunasekaran, Rashad ...
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 ...
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.
The Quadratic Assignment Problem (QAP) is NP-hard and models many real-world applications, such as scheduling, wiring problems in electronics, parallel and distributed computing, statistical data analysis, design of control panels and typewriter keyboards, sports, chemistry, archeology, balancing of turbine runners, computer manufacturing, and ...
Mohamed Abdel-Basset, Gunasekaran Manogaran, Heba Rashad, and Abdel Nasser H Zaied. 2018. A comprehensive review of quadratic assignment problem: variants, hybrids and applications. Journal of Ambient Intelligence and Humanized Computing (2018), 1--24.
A comprehensive review of quadratic assignment problem: variants, hybrids and applications 20 June 2018 | Journal of Ambient Intelligence and Humanized Computing, Vol. 10 Hybrid chicken swarm optimization with a GRASP constructive procedure using multi-threads to solve the quadratic assignment problem
A comprehensive review of quadratic assignment problem: variants, hybrids and applications, J. Ambient Intell. Humaniz. Comput. ... Périaux J., Papailiou K.D., Fogarty T. (Eds.), Evolutionary Methods for Design Optimization and Control with Applications to Industrial Problems, International Center for Numerical Methods in Engineering, Athens, ...
The quadratic assignment problem (QAP) was considered one of the most significant combinatorial optimization problems due to its variant and substantial applications in real life such as scheduling, production, computer manufacture, chemistry, facility location, communication, and other fields. QAP is an NP-hard problem that is impossible to be ...
A comprehensive review of quadratic assignment problem: variants, hybrids and applications Mohamed Abdel-Basset Gunasekaran Manogaran Heba Rashad A. H. Zaied Mathematics, Chemistry
The Tree QAP is a special case of the Quadratic Assignment Problem (QAP) where the nonzero flows form a tree. No condition is required for the distance matrix. This problem is NP-complete and is also a generalization of the Traveling Salesman Problem. In this paper, we present a branch-and-bound algorithm for the exact solution of the Tree QAP ...
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. Keywords--Metaheuristic algorithms, Combinatorial Optimization Problem, Facility Layout Problem; Quadratic Assignment Problem 1. Introduction
The quadratic assignment problem (QAP) is a combinatorial optimization problem that arises in many real-world applications, such as equipment allocation in industry. ... A comprehensive review of quadratic assignment problem: variants, hybrids and applications. 20 June 2018 | Journal of Ambient Intelligence and Humanized Computing, Vol. 10 ...