Review on the Methods to Solve Combinatorial Optimization Problems Particularly: Quadratic Assignment Model

The quadratic assignment problem (QAP) is one of the fundamental combinatorial optimization problem (COPs) in the branch of optimization or operation research in mathematics,from the category of the Facilities Location Problems (FLPs).The quadratic assignment problem (QAP) be appropriate to the group of NP-hard issues and is measured as a challenging problem of the combinatorial optimization.QAP in Location Theory considers one of the problems of facilities tracing which the rate of locating a facility be determined by the spaces between facilities as well as the communication among the further facilities.QAP was presented in 1957 by Beckman and Koopmans as they were attempting to model a problem of facilities location.To survey the researcher’s works for QAP and applied,the mapped research landscape outlines literature into a logical classification and discovers this field basic characteristics represented on the motivation to use the quadratic assignment problem applied in hospital layout and campus planning.This survey achieved a concentrated each QAP article search in three key databases:Web of Science,Science Direct,and IEEE Xplore.Those databases are regarded extensive adequate in covering QAP and the methods utilized in solving QAP.

[1]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[2]  Jin-Kao Hao,et al.  Breakout local search for the quadratic assignment problem , 2013, Appl. Math. Comput..

[3]  Hanif D. Sherali,et al.  On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem , 1982 .

[4]  Akhtar Rasool,et al.  Quadratic Assignment Problem and its Relevance to the Real World: A Survey , 2014 .

[5]  Mohamad Amin Kaviani,et al.  A hybrid Tabu search-simulated annealing method to solve quadratic assignment problem , 2014 .

[6]  Lúcia Maria de A. Drummond,et al.  A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique , 2017, INFORMS J. Comput..

[7]  Belén Melián-Batista,et al.  A Hybrid Biased Random Key Genetic Algorithm for the Quadratic Assignment Problem , 2016, Inf. Process. Lett..

[8]  Yongquan Zhou,et al.  Elite opposition-flower pollination algorithm for quadratic assignment problem , 2017, J. Intell. Fuzzy Syst..

[9]  Marco Dorigo,et al.  An Investigation of some Properties of an "Ant Algorithm" , 1992, PPSN.

[10]  Huimin Ma,et al.  Optimization of the Occlusion Strategy in Visual Tracking , 2016 .

[11]  Antoni Wibowo,et al.  Solving Quadratic Assignment Problem with Fixed Assignment (QAPFA) using Branch and Bound Approach , 2018 .

[12]  Xin-She Yang,et al.  Cuckoo Search via Lévy flights , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[13]  Mauro Dell'Amico,et al.  The single-finger keyboard layout problem , 2009, Comput. Oper. Res..

[14]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[15]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[16]  Abdel Nasser,et al.  A Survey of the Quadratic Assignment Problem , 2014 .

[17]  Nicos Christofides,et al.  An Exact Algorithm for the Quadratic Assignment Problem on a Tree , 1989, Oper. Res..

[18]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[19]  David Malah,et al.  Bounds on the performance of vector-quantizers under channel errors , 2005, IEEE Transactions on Information Theory.

[20]  John W. Dickey,et al.  Campus building arrangement using topaz , 1972 .

[21]  Mohammed Essaid Riffi,et al.  Incorporating a modified uniform crossover and 2-exchange neighborhood mechanism in a discrete bat algorithm to solve the quadratic assignment problem , 2017 .

[22]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[23]  Qiang Su,et al.  An applied case of quadratic assignment problem in hospital department layout , 2015, 2015 12th International Conference on Service Systems and Service Management (ICSSSM).

[24]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[25]  N. Jawahar,et al.  Iterated fast local search algorithm for solving quadratic assignment problems , 2008 .

[26]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[27]  Naim Dahnoun,et al.  Studies in Computational Intelligence , 2013 .

[28]  Panos M. Pardalos,et al.  Quadratic Assignment Problem , 1997, Encyclopedia of Optimization.

[29]  Leon Steinberg,et al.  The Backboard Wiring Problem: A Placement Algorithm , 1961 .

[30]  Abraham Sánchez López,et al.  Ant Colony Optimization for Solving the Quadratic Assignment Problem , 2015, MICAI.

[31]  Wojciech Chmiel,et al.  A comparison of nature inspired algorithms for the quadratic assignment problem , 2017 .

[32]  T. L. Ward,et al.  Solving Quadratic Assignment Problems by ‘Simulated Annealing’ , 1987 .

[33]  Dennis Heffley,et al.  The Quadratic Assignment Problem: A Note , 1972 .

[34]  Peter F. Stadler,et al.  Comparative Analysis of Cyclic Sequences: Viroids and other Small Circular RNAs , 2006, German Conference on Bioinformatics.

[35]  Jakob Krarup,et al.  Computer-aided layout design , 1978 .

[36]  M. Bazaraa,et al.  A branch-and-bound-based heuristic for solving the quadratic assignment problem , 1983 .

[37]  Saifallah Benjaafar,et al.  Modeling and Analysis of Congestion in the Design of Facility Layouts , 2002, Manag. Sci..

[38]  Mitat Uysal,et al.  Migrating Birds Optimization: A new metaheuristic approach and its performance on quadratic assignment problem , 2012, Inf. Sci..

[39]  Dan Boneh,et al.  On genetic algorithms , 1995, COLT '95.