Skip to main content
SpringerLink
Log in

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

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  • Abbass HA (2001) MBO: marriage in honey bees optimization—a haplometrosis polygynous swarming approach. In: Proceedings of the congress on evolutionary computation, vol 1, pp 207–214

  • Abdel-Baset M, Hezam I (2016a) Cuckoo search and genetic algorithm hybrid schemes for optimization problems. Appl Math 10(3):1185–1192

    Google Scholar 

  • Abdel-Baset M, Hezam IM (2016b) Solving linear least squares problems based on improved cuckoo search algorithm. Math Sci 5(2):199–202

    Google Scholar 

  • Abdel-Basset M, Hessin AN, Abdel-Fatah L (2016) A comprehensive study of cuckoo-inspired algorithms. Neural Comput Appl 29(2):345–361

    Article  Google Scholar 

  • Abderrahim IA, Loukil L (2017) Hybrid PSO-TS approach for solving the quadratic three-dimensional assignment problem. In: 2017 IEEE international conference on embedded and distributed systems (EDiS), pp 1–5

  • Abreu NMM, Boaventura-Netto PO, Querido TM, Gouvêa EF (2002) Classes of quadratic assignment problem instances: isomorphism and difficulty measure using a statistical approach. Discret Appl Math 124(1–3):103–116

    Article  MathSciNet  MATH  Google Scholar 

  • Adams WP, Johnson TA (1994) Improved linear programming-based lower bounds for the quadratic assignment problem. DIMACS Ser Discret Math Theor Comput Sci 16:43–75

    Article  MathSciNet  MATH  Google Scholar 

  • Ahyaningsih F (2017) A combined strategy for solving quadratic assignment problem. In: Proceedings of AIP conference, vol 1867, no 1, p 020006

  • Alatas B (2011) ACROA: artificial chemical reaction optimization algorithm for global optimization. Expert Syst Appl 38(10):13170–13180

    Article  Google Scholar 

  • Angel E, Zissimopoulos V (2000) On the classification of NP-complete problems in terms of their correlation coefficient. DAMATH Discret Appl Math Comb Oper Res Comput Sci 99(1–3):261–277

    MathSciNet  MATH  Google Scholar 

  • Angel E, Zissimopoulos V (2001) On the landscape ruggedness of the quadratic assignment problem. Theor Comput Sci 263(1–2):159–172

    Article  MathSciNet  MATH  Google Scholar 

  • Angel E, Zissimopoulos V (2002) On the hardness of the quadratic assignment problem with metaheuristics. J Heuristics 8(4):399–414

    Article  Google Scholar 

  • Anstreicher KM (2003) Recent advances in the solution of quadratic assignment problems. Math Program 97(1):27–42

    Article  MathSciNet  MATH  Google Scholar 

  • Anstreicher KM, Brixius NW (2001) A new bound for the quadratic assignment problem based on convex quadratic programming. Math Program 89(3):341–357

    Article  MathSciNet  MATH  Google Scholar 

  • Arkin EM, Hassin R, Sviridenko M (2001) Approximating the maximum quadratic assignment problem. Inf Process Lett 77(1):13–16

    Article  MathSciNet  MATH  Google Scholar 

  • Askarzadeh A, Rezazadeh A (2013) A new heuristic optimization algorithm for modeling of proton exchange membrane fuel cell: bird mating optimizer. Int J Energy Res 37(10):1196–1204

    Article  Google Scholar 

  • Azarbonyad H, Babazadeh R (2014) A genetic algorithm for solving quadratic assignment problem (QAP). arXiv preprint. http://arxiv.org/abs/1405.5050

  • Battiti R, Tecchiolli G (1994a) The reactive tabu search. ORSA J Comput 6(2):126–140

    Article  MATH  Google Scholar 

  • Baykasoglu A (2004) A metaheuristic algorithm to solve quadratic assignment formulations of cell formation problems without presetting number of cells. J Intell Manuf 15(6):753–759

    Article  Google Scholar 

  • Bazaraa MS, Elshafei AN (1979) An exact branch-and-bound procedure for the quadratic assignment problem. Nav Res Logist Q 26:109–121

    Article  MathSciNet  MATH  Google Scholar 

  • Bazaraa MS, Kirca O (1983) A branch-and-bound based heuristic for solving the quadratic assignment problem. Nav Res Logist Q 30:287–304

    Article  MathSciNet  MATH  Google Scholar 

  • Bazaraa MS, Sherali HD (1979) New approaches for solving the quadratic assignment problem. Oper Res Verfahr 32:29–46

    MathSciNet  MATH  Google Scholar 

  • Bazaraa MS, Sherali HD (1982) On the use of exact and heuristic cutting plane methods for the quadratic assignment problem. J Oper Res Soc 11:991–1003

    Article  MathSciNet  MATH  Google Scholar 

  • Ben-David G, Malah D (2005) Bounds on the performance of vector-quantizers under channel errors. IEEE Trans Inf Theory 51(6):2227–2235

    Article  MathSciNet  MATH  Google Scholar 

  • Benjaafar S (2002) Modeling and analysis of congestion in the design of facility layouts. Manag Sci 48(5):679–704

    Article  MATH  Google Scholar 

  • Benlic U, Hao JK (2013) Breakout local search for the quadratic assignment problem. Appl Math Comput 219(9):4800–4815

    MathSciNet  MATH  Google Scholar 

  • Bermudez R, Cole MH (2001) A genetic algorithm approach to door assignments in breakbulk terminals (No. MBTC 1084). University of Arkansas, Mack-Blackwell National Rural Transportation Study Center, Fayetteville

    Google Scholar 

  • Blanchard A, Elloumi S, Faye A, Wicker N (2003) A cutting algorithm for the quadratic assignment problem. INFOR 41(1):35–49

    Google Scholar 

  • Bland JA, Dawson GP (1994) Large-scale layout of facilities using a heuristic hybrid algorithm. Appl Math Model 18(9):500–503

    Article  MATH  Google Scholar 

  • Bölte A, Thonemann UW (1996) Optimizing simulated annealing schedules with genetic programming. Eur J Oper Res 92(2):402–416

    Article  MATH  Google Scholar 

  • Bos J (1993b) Zoning in forest management: a quadratic assignment problem solved by simulated annealing. J Environ Manag 37:127–145‏

    Article  Google Scholar 

  • Bousonocalzon C, Manning MRW (1995) The Hopfield neural-network applied to the quadratic assignment problem. Neural Comput Appl 3(2):64–72

    Article  Google Scholar 

  • Brixius NW, Anstreicher KM (2004) The Steinberg wiring problem. In: Grötschel M (ed) The sharpest cut: the impact of Manfred Padberg and his work. Society for Industrial and Applied Mathematics, Philadelphia, pp 293–307

    Chapter  Google Scholar 

  • Brüngger A, Marzetta A, Clausen J, Perregaard M (1997) Joining forces in solving large-scale quadratic assignment problems. In: Proceedings of the 11th International parallel processing symposium IPPS. IEEE Computer Society Press, Los Alamitos, pp 418–427

  • Brüngger A, Marzetta A, Clausen J, Perregaard M (1998) Solving large-scale QAP problems in parallel with the search library ZRAM. J Parallel Distrib Comput 50(1–2):157–169

    Article  MATH  Google Scholar 

  • Brusco MJ, Stahl S (2000) Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices. J Classif 17(2):197–223

    Article  MathSciNet  MATH  Google Scholar 

  • Bukard RE, Offermann J (1977) Design of typewriter keyboards by means of quadratic assignment problems. J Oper Res 21(4):B121–B132

    Google Scholar 

  • Burkard RE (2002) Selected topics on assignment problems. Discret Appl Math 123(1):257–302

    Article  MathSciNet  MATH  Google Scholar 

  • Burkard RE, Bonniger T (1983) A heuristic for quadratic Boolean programs with applications to quadratic assignment problems. Eur J Oper Res 13:374–386

    Article  MathSciNet  MATH  Google Scholar 

  • Burkard RE, Karisch SE, Rendl F (1997) QAPLIB—a quadratic assignment problem library. J Glob Optim 10(4):391–403‏

    Article  MathSciNet  MATH  Google Scholar 

  • Cela E, Deineko V, Woeginger GJ (2017) New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices. Eur J Oper Res 267(3):818–834

    Article  MathSciNet  MATH  Google Scholar 

  • Çela E (2002) Assignment problems. Handbook of applied optimization, pp 661–678

  • Chan Y, Francis RL, McGinnis LF, White JA (1993) Facility layout and location: an analytical approach

  • Chmiel W, Szwed P (2016) Bees algorithm for the quadratic assignment problem on CUDA platform. In: Gruca A, Brachman A, Kozielski S, Czachórski T (eds) Man–machine interactions, vol 391. Springer, Cham

    Google Scholar 

  • Chmiel W, Kadłuczka P, Packanik G (2009) Performance of swarm algorithms for permutation problems. Automatyka 15(2):117–126‏

    Google Scholar 

  • Chmiel W, Kadłuczka P, Kwiecień J, Filipowicz B (2017) A comparison of nature inspired algorithms for the quadratic assignment problem. Bull Pol Acad Sci Tech Sci 65(4):513–522

    Google Scholar 

  • Chrétienne P (1989) A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints. Eur J Oper Res 43(2):225–230

    Article  MathSciNet  MATH  Google Scholar 

  • Christofides N, Benavent E (1989) An exact algorithm for the quadratic assignment problem. Oper Res 37(5):760–768

    Article  MathSciNet  MATH  Google Scholar 

  • Ciriani V, Pisanti N, Bernasconi A (2004) Room allocation: a polynomial subcase of the quadratic assignment problem. Discret Appl Math 144(3):263–269

    Article  MathSciNet  MATH  Google Scholar 

  • Colorni A, Dorigo M, Maffioli F, Maniezzo V, Righini G, Trubian M (1996) Heuristics from nature for hard combinatorial optimization problems. Int Trans Oper Res 3(1):1–21

    Article  MATH  Google Scholar 

  • Commander CW (2005) A survey of the quadratic assignment problem, with applications

  • Cung VD, Mautor T, Michelon P, Tavares A (1997) A scatter search based approach for the quadratic assignment problem. In: Proceedings of IEEE international conference on evolutionary computation, pp 165–169

  • Deineko VG, Woeginger GJ (2000) A study of exponential neighborhoods for the traveling salesman problem and for the quadratic assignment problem. Math Program Ser A 78:519–542

    MATH  Google Scholar 

  • Dell’Amico M, Díaz JCD, Iori M, Montanari R (2009) The single-finger keyboard layout problem. Comput Oper Res 36(11):3002–3012

    Article  MATH  Google Scholar 

  • Dickey JW, Hopkins JW (1972) Campus building arrangement using TOPAZ. Transp Res 6(1):59–68

    Article  Google Scholar 

  • Dokeroglu T, Cosar A (2016) A novel multistart hyper-heuristic algorithm on the grid for the quadratic assignment problem. Eng Appl Artif Intell 52:10–25

    Article  Google Scholar 

  • Dorigo M (1992) Optimization learning and natural algorithms. PhD Thesis, Politecnico di Milano

  • Dorigo M, Maniezzo V, Colorni A (1996) The ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B 26(2):29–41

    Article  Google Scholar 

  • Drezner Z (1995) Lower bounds based on linear programming for the quadratic assignment problem. Comput Optim Appl 4(2):159–165

    Article  MathSciNet  MATH  Google Scholar 

  • Drezner Z (2005a) Compounded genetic algorithms for the quadratic assignment problem. Oper Res Lett 33(5):475–480

    Article  MathSciNet  MATH  Google Scholar 

  • Drezner Z (2005b) The extended concentric tabu for the quadratic assignment problem. Eur J Oper Res 160:416–422

    Article  MathSciNet  MATH  Google Scholar 

  • Drezner Z, Hahn PM, Taillard ÉD (2005) Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods. Ann Oper Res 139(1):65–94‏

    Article  MathSciNet  MATH  Google Scholar 

  • Du H, Wu X, Zhuang J (2006) Small-world optimization algorithm for function optimization. In: International conference on natural computation. Springer, Berlin, pp 264–273

  • Durkota K (2011) Implementation of a discrete firefly algorithm for the QAP problem within the sage framework. Bachelor Thesis, Czech Technical University

  • Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on machine and human science (MHS), pp 39–43

  • Edwards CS (1980) A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem. In: Rayward-Smith VJ (eds) Combinatorial optimization II, vol 13. Springer, Berlin, Heidelberg

    Chapter  Google Scholar 

  • Eiselt HA, Laporte G (1991) A combinatorial optimization problem arising in dartboard design. J Oper Res Soc 42:113–118

    Article  Google Scholar 

  • El-Baz MA (2004) A genetic algorithm for facility layout problems of different manufacturing environments. Comput Ind Eng 47(2–3):233–246

    Article  Google Scholar 

  • Elshafei AN (1977) Hospital layout as a quadratic assignment problem. J Oper Res Soc 28(1):167–179

    Article  MATH  Google Scholar 

  • Erdoğan G, Tansel B (2007) A branch-and-cut algorithm for quadratic assignment problems based on linearization. Comput Oper Res 34(4):1085–1106

    Article  MathSciNet  MATH  Google Scholar 

  • Erol OK, Eksin I (2006) A new optimization method: big bang–big crunch. Adv Eng Softw 37(2):106–111

    Article  Google Scholar 

  • Euler R, Le Verge H (1996) Time-tables, polyhedra and the greedy algorithm. Discret Appl Math 65(1–3):207–221

    Article  MathSciNet  MATH  Google Scholar 

  • Fedjki CA, Duffuaa SO (2004) An extreme point algorithm for a local minimum solution to the quadratic assignment problem. Eur J Oper Res 156(3):566–578

    Article  MathSciNet  MATH  Google Scholar 

  • Feizi S, Quon G, Recamonde-Mendoza M, Medard M, Kellis M, Jadbabaie A (2016) Spectral alignment of graphs. arXiv preprint. http://arxiv.org/abs/1602.04181‏

  • Ferreira JFB, Khoo Y, Singer A (2018) Semidefinite programming approach for the quadratic assignment problem with a sparse graph. Comput Optim Appl 69(3):677–712

    Article  MathSciNet  MATH  Google Scholar 

  • Finke G, Burkard RE, Rendl F (1987) Quadratic assignment problems. Ann Discret Math 31:61–82

    MathSciNet  MATH  Google Scholar 

  • Fischetti M, Monaci M, Salvagnin D (2012) Three ideas for the quadratic assignment problem. Oper Res 60(4):954–964

    Article  MathSciNet  MATH  Google Scholar 

  • Fogel LJ, Owens AJ, Walsh MJ (1966) Artificial intelligence through simulated evolution

  • Formato RA (2007) Central force optimization. Prog Electromagn Res 77:425–491

    Article  Google Scholar 

  • Francisco RB, Costa MFP, Rocha AMA (2014) Experiments with firefly algorithm. In: International conference on computational science and its applications. Springer, Cham, pp 227–236

  • Frieze AM, Yadegar J (1983) On the quadratic assignment problem. Discret Appl Math 5(1):89–98‏

    Article  MathSciNet  MATH  Google Scholar 

  • Gabrielsson S (2008) A parallel tabu search algorithm for the quadratic assignment problem

  • Gallo G, Simeone B (1991) Optimal grouping of researchers into departments. Ricerca Operativa 57:64–69

    Google Scholar 

  • Gambardella LM, Taillard D, Dorigo M (1999) Ant colonies for the QAP. J Oper Res Soc 50:167–176

    Article  MATH  Google Scholar 

  • Gandomi AH, Alavi AH (2012) Krill herd: a new bio-inspired optimization algorithm. Commun Nonlinear Sci Numer Simul 17(12):4831–4845

    Article  MathSciNet  MATH  Google Scholar 

  • Gandomi AH, Yang XS, Alavi AH (2013) Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Eng Comput 29(1):17–35

    Article  Google Scholar 

  • Garey MR, Johnson DS (1979) Computers and intractability. A guide to the theory of NP-completeness. In: A series of books in the mathematical sciences

  • Gavett JW, Plyter NV (1966) The optimal assignment of facilities to locations by branch and bound. Oper Res 14:210–232

    Article  Google Scholar 

  • Geoffrion AM, Graves GW (1976) Scheduling parallel production lines with changeover costs: practical application of a quadratic assignment/LP approach. Oper Res 24(4):595–610

    Article  MATH  Google Scholar 

  • Ghandeshtani KS, Seyedkashi N, Mollai N, Neshati MM (2010) New simulated annealing algorithm for quadratic assignment problem. In: The fourth international conference on advanced engineering computing and applications in sciences, pp 87–92

  • Gharibi W, Xia Y (2010) New heuristic rounding approaches to the quadratic assignment problem. J Commun Comput 7(4):65‏

    Google Scholar 

  • Gilmore PC (1962) Optimal and suboptimal algorithms for the quadratic assignment problem. SIAM J Appl Math 10:305–313

    Article  MathSciNet  MATH  Google Scholar 

  • Glover F (1977) Heuristics for integer programming using surrogate constraints. Decis Sci 8:156–166

    Article  Google Scholar 

  • Glover F (1989a) Tabu search. ORSA J Comput Part 1 1(3):190–206

    Article  MATH  Google Scholar 

  • Glover F (1989b) Tabu search. ORSA J Comput Part 2 1:4–32

    MATH  Google Scholar 

  • Gonçalves AD, Pessoa AA, Bentes C, Farias R, Drummond LMDA. (2017) A graphics processing unit algorithm to solve the quadratic assignment problem using level-2 reformulation-linearization technique. INFORMS J Comput 29(4):676–687

    Article  MathSciNet  Google Scholar 

  • Gong D, Yamazaki G, Gen M, Xu W (1999) A genetic algorithm method for one dimensional machine location problems. Int J Prod Econ 60(1):337–342

    Article  Google Scholar 

  • Grötschel M (1992) Discrete mathematics in manufacturing. In: ICIAM91: proceedings of the second international conference on industrial and applied mathematics (SIAM), pp 119–145

  • Gutin G, Karapetyan D (2009) A memetic algorithm for the multidimensional assignment problem. In: International workshop on engineering stochastic local search algorithms. Springer, Berlin, pp 125–129

  • Gutin G, Yeo A (2002) Polynomial approximation algorithms for TSP and QAP with a factorial domination number. Discret Appl Math 119(1–2):107–116

    Article  MathSciNet  MATH  Google Scholar 

  • Hadley SW, Rendl F, Wolkowicz H (1990) Bounds for the quadratic assignment problem using continuous optimization techniques. In: Proceedings of 1st international integer programming and combinatorial optimization conference (IPCO), pp 237–248

  • Hadley SW, Rendl F, Wolkowicz H (1993) A new lower bound via projection for the quadratic assignment problem. Math Oper Res 17:727–739

    Article  MathSciNet  MATH  Google Scholar 

  • Hahn P, Grant T (1998) Lower bounds for the quadratic assignment problem based upon a dual formulation. Oper Res 46:912–922

    Article  MathSciNet  MATH  Google Scholar 

  • Hahn PM, Krarup J (2001) A hospital facility layout problem finally solved. J Intell Manuf 12(5):487–496

    Article  Google Scholar 

  • Hahn P, Grant T, Hall N (1998) A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method. Eur J Oper Res 108:629–640

    Article  MATH  Google Scholar 

  • Hahn PM, Hightower WL, Johnson TA, Guignard-Spielberg M, Roucairol C (2001b) A level-2 reformulation-linearization technique bound for the quadratic assignment problem. Working Paper 01-04, Systems Engineering Department, University of Pennsylvania

  • Hahn PM, Kim BJ, Hightower WL, Stützle T, Kanthak S, Samra H, Ding Z, Guignard M (2004) The quadratic three-dimensional assignment problem: exact and heuristic solution methods. OPIM Working Report No. 04-08-02, The Wharton School, University of Pennsylvania, Philadelphia, Pennsylvania, USA

  • Hahn PM, Zhu YR, Guignard M, Hightower WL, Saltzman MJ (2012) A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem. INFORMS J Comput 24(2):202–209

    Article  MathSciNet  MATH  Google Scholar 

  • Hannan E, McKeon P (1979) Matching swimmers to events in a championship swimming meet. Comput Oper Res 6(4):225–231

    Article  Google Scholar 

  • Hansen P, Lih KW (1992) Improved algorithms for partitioning problems in parallel, pipelined, and distributed computing. IEEE Trans Comput 41(6):769–771

    Article  Google Scholar 

  • Hansen N, Müller SD, Koumoutsakos P (2003) Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evol Comput 11(1):1–18

    Article  Google Scholar 

  • Hasegawa M, Ikeguchi T, Aihara K, Itoh K (2002) A novel chaotic search for quadratic assignment problems. Eur J Oper Res 139(3):543–556

    Article  MathSciNet  MATH  Google Scholar 

  • Hassin R, Levin A, Sviridenko M (2009) Approximating the minimum quadratic assignment problems. ACM Trans Algorithms (TALG) 6(1):18

    MathSciNet  MATH  Google Scholar 

  • Hatamlou A (2013) Black hole: a new heuristic optimization approach for data clustering. Inf Sci 222:175–184

    Article  MathSciNet  Google Scholar 

  • Hezam IM, Abd-ElBaset M, Selem I (2015) Cuckoo search algorithm for stellar population analysis of galaxies. Int J Inf Technol Comput Sci 7:29–33

    Google Scholar 

  • Holland JH (1992) Genetic algorithms. Sci Am 267(1):66–73

    Article  Google Scholar 

  • Huang G, Lim A (2006) A hybrid genetic algorithm for the three-index assignment problem. Eur J Oper Res 172(1):249–257

    Article  MathSciNet  MATH  Google Scholar 

  • Hubert L (1986) Assignment methods in combinational data analysis, vol 73. CRC Press, Boca Raton

    Google Scholar 

  • Hussain Ahmed Z (2018) A hybrid algorithm combining lexisearch and genetic algorithms for the quadratic assignment problem. Cogent Eng. https://doi.org/10.1080/23311916.2018.1423743

    Article  Google Scholar 

  • Ignizio JP (1982) Linear programing in single and multiple objective systems. Prentice-Hall, Englewood Cliff

    MATH  Google Scholar 

  • Ismail MM, Hezam IM, El-Sharkawy E (2017) Enhanced cuckoo search algorithm with SPV rule for quadratic assignment problem. Int J Comput Appl 158(4):39–42

    Google Scholar 

  • Ji P, Wu Y, Liu H (2006) A solution method for the quadratic assignment problem (QAP). In: The sixth international symposium on operations research and its applications (ISORA), Xinjiang, China, August, pp 8–12

  • Jiang H, Zhang S, Ren Z, Lai X, Piao Y (2014) Approximate muscle guided beam search for three-index assignment problem. In: International conference in swarm intelligence. Springer, Cham, pp 44–52

  • Jünger M, Kaibel V (2000) On the SQAP-polytope. SIAM J Optim 11(2):444–463

    Article  MathSciNet  MATH  Google Scholar 

  • Jünger M, Kaibel V (2001a) The QAP-polytope and the star transformation. Discret Appl Math 111(3):283–306

    Article  MathSciNet  MATH  Google Scholar 

  • Jünger M, Kaibel V (2001b) Box-inequalities for quadratic assignment polytopes. Math Program 91(1):175–197

    Article  MathSciNet  MATH  Google Scholar 

  • Kaibel V (1998) Polyhedral combinatorics of quadratic assignment problems with less objects than locations. In: Bixby RE, Boyd EA, Ríos-Mercado RZ (eds) Integer programming and combinatorial optimization, vol 1412. Springer, Berlin, Heidelberg

    Chapter  Google Scholar 

  • Karisch SE, Rendl F, Wolkowicz H (1994) Trust regions and relaxations for the quadratic assignment problem. In: Pardalos PM, Wolkowicz H (eds) Quadratic assignment and related problems. DIMACS series in discrete mathematics and theoretical computer science, vol 16. AMS, Providence, pp 199–219

    MATH  Google Scholar 

  • Karisch S, Çela E, Clausen J, Espersen T (1999) A dual framework for lower bounds of the quadratic assignment problem based on linearization. Computing 63:351–403

    Article  MathSciNet  MATH  Google Scholar 

  • Kaufman L, Broeckx F (1978) An algorithm for the quadratic assignment problem using Bender’s decomposition. Eur J Oper Res 2(3):207–211

    Article  MATH  Google Scholar 

  • Kaveh A, Khayatazad M (2012) A new meta-heuristic method: ray optimization. Comput Struct 112:283–294

    Article  Google Scholar 

  • Kaveh A, Talatahari S (2010) A novel heuristic optimization method: charged system search. Acta Mech 213(3–4):267–289

    Article  MATH  Google Scholar 

  • Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of international conference on neural network, vol 4. IEEE Service Center, Piscataway, pp 1942–1948

  • Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680

    Article  MathSciNet  MATH  Google Scholar 

  • Knowles JD, Corne D (2002) Towards landscape analyses to inform the design of hybrid local search for the multiobjective quadratic assignment problem. HIS 87:271–279

    Google Scholar 

  • Knowles J, Corne D (2003) Instance generators and test suites for the multiobjective quadratic assignment problem. In: International conference on evolutionary multi-criterion optimization. Springer, Berlin, pp 295–310

  • Koopmans TC, Beckmann M (1957) Assignment problems and the location of economic activities. Econom J Econom Soc 25(1):53–76

    MathSciNet  MATH  Google Scholar 

  • Koza JR (1992) Genetic programming II, automatic discovery of reusable subprograms. MIT Press, Cambridge

    Google Scholar 

  • Krarup J, Pruzan PM (1978) Computer-aided layout design. Mathematical programming in use, pp 75–94

  • Kreher DL, Stinson DR (1998) Combinatorial algorithms: generation, enumeration, and search, vol 7. CRC Press, Boca Raton

    MATH  Google Scholar 

  • Lawler EL (1963) The quadratic assignment problem. Manag Sci 9(4):586–599

    Article  MathSciNet  MATH  Google Scholar 

  • Li XL (2003) A new intelligent optimization-artificial fish swarm algorithm. Doctor Thesis, Zhejiang University of Zhejiang, China

  • Li Y, Pardalos PM, Ramakrishnan KG, Resende MG (1994) Lower bounds for the quadratic assignment problem. Ann Oper Res 50(1):387–410

    Article  MathSciNet  MATH  Google Scholar 

  • Liu H, Abraham A, Zhang J (2007) A particle swarm approach to quadratic assignment problems. In: Saad A, Dahal K, Sarfraz M, Roy R (eds) Soft computing in industrial applications, vol 39. Springer, Berlin, Heidelberg

    Chapter  Google Scholar 

  • Loiola EM, de Abreu NMM, Boaventura-Netto PO, Hahn P, Querido T (2007) A survey for the quadratic assignment problem. Eur J Oper Res 176(2):657–690

    Article  MathSciNet  MATH  Google Scholar 

  • Loukil L, Mehdi M, Melab N, Talbi EG, Bouvry P (2009) A parallel hybrid genetic algorithm-simulated annealing for solving Q3AP on computational grid. In: 2009 IEEE international symposium on IEEE parallel and distributed processing (IPDPS), pp 1–8

  • Lu X, Zhou Y (2008) A novel global convergence algorithm: bee collecting pollen algorithm. In: International conference on intelligent computing. Springer, Berlin, pp 518–525

  • Machol RE (1970) An application of the assignment problem. Oper Res 18(4):745–746

    Google Scholar 

  • Maniezzo V (1999) Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS J Comput 11(4):358–369

    Article  MathSciNet  MATH  Google Scholar 

  • Maniezzo V, Colorni A (1995) Algodesk: an experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem. Eur J Oper Res 81(1):188–204

    Article  MATH  Google Scholar 

  • Maniezzo V, Colorni A (1999) The ant system applied to the quadratic assignment problem. Knowl Data Eng 11(5):769–778

    Article  Google Scholar 

  • Mans B, Mautor T, Roucairol C (1995) A parallel depth first search branch and bound algorithm for the quadratic assignment problem. Eur J Oper Res 81:617–628

    Article  MATH  Google Scholar 

  • Marins MTA, Abreu NMM, Jurkiewicz S (2004) Auto morphism of groups and quadratic assignment problem. In: 2004 Annals of XII Congreso Latino-Iberoamericano de Investigación de Operaciones y Sistemas (CLAIO). La Habana, Cuba

  • Mason A, Rönnqvist M (1997) Solution methods for the balancing of jet turbines. Comput Oper Res 24(2):153–167

    Article  MATH  Google Scholar 

  • Mavridou T, Pardalos PM, Pitsoulis LS, Resende MGC (1998) A GRASP for the biquadratic assignment problem. Eur J Oper Res 105(3):613–621

    Article  MATH  Google Scholar 

  • Middendorf M, Reischle F, Schmeck H (2002) Multi colony ant algorithms. J Heuristics 8(3):305–320

    Article  MATH  Google Scholar 

  • Milis LZ, Magirou VF (1995) A Lagrangian-relaxation algorithm for sparse quadratic assignment problems. Oper Res Lett 17(2):69–76

    Article  MathSciNet  MATH  Google Scholar 

  • Mills P, Tsang E, Ford J (2003) Applying an extended guided local search to the quadratic assignment problem. Ann Oper Res 118(1–4):121–135

    Article  MathSciNet  MATH  Google Scholar 

  • Miranda G, Luna HPL, Mateus GR, Ferreira RPM (2005) A performance guarantee heuristic for electronic components placement problems including thermal effects. Comput Oper Res 32(11):2937–2957‏

    Article  MATH  Google Scholar 

  • Misevicius A (2000a) An intensive search algorithm for the quadratic assignment problem. Informatica 11:145–162

    MathSciNet  MATH  Google Scholar 

  • Misevicius A (2000b) A new improved simulated annealing algorithm for the quadratic assignment problem. Inf Technol Control 17:29–38

    Google Scholar 

  • Misevicius A (2001) Combining simulated annealing and tabu search for the quadratic assignment problem. Inf Technol Control 20:37–50

    Google Scholar 

  • Misevicius A (2003) A modified simulated annealing algorithm for the quadratic assignment problem. Informatica 14(4):497–514

    MathSciNet  MATH  Google Scholar 

  • Misevicius A (2004a) An improved hybrid optimization algorithm for the quadratic assignment problem. Math Model Anal 9(2):149–168

    MathSciNet  MATH  Google Scholar 

  • Misevicius A (2004b) An improved hybrid genetic algorithm: new results for the quadratic assignment problem. Knowl Based Syst 17(2–4):65–73

    Article  Google Scholar 

  • Mittelmann HD, Salvagnin D (2015) On solving a hard quadratic 3-dimensional assignment problem. Math Program Comput 7(2):219–234

    Article  MathSciNet  MATH  Google Scholar 

  • Mladenovi N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24:1097–1100

    Article  MathSciNet  MATH  Google Scholar 

  • Moghaddam FF, Moghaddam RF, Cheriet M (2012) Curved space optimization: a random search based on general relativity theory. arXiv preprint. http://arxiv.org/abs/1208.2214

  • Mucherino A, Seref O (2007) Monkey search: a novel metaheuristic search for global optimization. In: AIP conference proceedings, vol 953, no 1, pp 162–173

  • Munera D, Diaz D, Abreu S (2016a) Hybridization as cooperative parallelism for the quadratic assignment problem. In: International workshop on hybrid metaheuristics. Springer, Cham, pp 47–61

  • Munera D, Diaz D, Abreu S (2016b) Solving the quadratic assignment problem with cooperative parallel extremal optimization. In: European conference on evolutionary computation in combinatorial optimization. Springer, Cham, pp 251–266

  • Mzili I, Riffi ME, Benzekri F (2017) Penguins search optimization algorithm to solve quadratic assignment problem. In: Proceedings of the 2nd international conference on big data, cloud and applications, ACM, New York, p 20

  • Nishiyama T, Tsuchiya K, Tsujita K (2001) A Markov chain Monte Carlo algorithm for the quadratic assignment problem based on replicator equations. In: Proceedings of the artificial neural networks (ICANN). Lecture notes in computer science, vol 2130, pp 148–155

  • Nissen V, Paul H (1995) A modification of threshold accepting and its application to the quadratic assignment problem. Oper Res Spektrum 17(2–3):205–210

    Article  MATH  Google Scholar 

  • Nyberg A (2014) Some reformulations for the quadratic assignment problem

  • Oliveira CAS, Pardalos MP, Resende MGG (2004) GRASP with path relinking for the quadratic assignment problem. In: Ribeiro CC, Martins SL (eds) Experimental and efficient algorithms, vol 3059. Springer, Berlin, Heidelberg

    Chapter  Google Scholar 

  • Omidbakhsh M, Seifbarghy M (2011) Solving quadratic assignment problem (QAP) using invasive weed optimization algorithm. J Ind Eng (Special Issue):113–125

  • Özçetin E, Öztürk G (2016) A hybrid genetic algorithm for the quadratic assignment problem on graphics processing units. Anadolu Univ J Sci Technol Appl Sci Eng 17(1):167–180

    Google Scholar 

  • Ozturk ZK, Uluel M (2017) A hybrid NSGA-II algorithm for multiobjective quadratic assignment problems. Acta Phys Pol A 132(3):959–962

    Article  Google Scholar 

  • Padberg W, Rijal P (1996) Location, scheduling, design and integer programming. In: International series in operations research management science. Operations research, vol 150, p 02803

  • Padberg MW, Rinaldi G (1991) A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev 33:60–100

    Article  MathSciNet  MATH  Google Scholar 

  • Pan WT (2012) A new fruit fly optimization algorithm: taking the financial distress model as an example. Knowl Based Syst 26:69–74

    Article  Google Scholar 

  • Paquete L, Stützle T (2006) A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices. Eur J Oper Res 169(3):943–959

    Article  MathSciNet  MATH  Google Scholar 

  • Pardalos L, Resende M (1994) A greedy randomized adaptive search procedure for the quadratic assignment problem. In: Quadratic assignment and related problems. DIMACS series on discrete mathematics and theoretical computer science, vol 16, pp 237–261

  • Pardalos PM, Wolkowicz H (1994) Quadratic assignment and related problems. In: DIMACS workshop, vol 16, American Mathematical Society (AMS), Providence, pp 117–146

  • Pardalos PM, Rendl F, Wolkowitz H (1994) The quadratic assignment problem: a survey and recent developments. In: Quadratic assignment and related problem

  • Pardalos PM, Ramakrishnan KG, Resende MG, Li Y (1997) Implementation of a variance reduction-based lower bound in a branch-and-bound algorithm for the quadratic assignment problem. SIAM J Optim 7(1):280–294

    Article  MathSciNet  MATH  Google Scholar 

  • Parker AW, Parker ME, Proll LG (1990) Constructing timetables for parent-teacher interviews: a practical scheduling problem. University of Leeds, Department of Computer Studies, Leeds

    Google Scholar 

  • Phillips AT, Rosen JB (1994) A quadratic assignment formulation of the molecular conformation problem. J Glob Optim 4(2):229–241

    Article  MathSciNet  MATH  Google Scholar 

  • Pierskalla WP (1967a) The tri-substitution method for the three-dimensional assignment problem. CORS J 5(2):71–81

    MATH  Google Scholar 

  • Pierskalla WP (1967b) The multi-dimensional assignment and quadratic assignment problems. In: Technical memorandum no. 93. Case Western Reserve University, Operations Research Department, School of Management, Cleveland, OH

  • Pierskalla WP (1968) Letter to the editor—the multidimensional assignment problem. Oper Res 16(2):422–431

    Article  MATH  Google Scholar 

  • Pinto PC, Runkler TA, Sousa JM (2007) Wasp swarm algorithm for dynamic MAX-SAT problems. In: International conference on adaptive and natural computing algorithms. Springer, Berlin, pp 350–357

  • Pitsoulis LS, Pardalos PM, Hearn DW (2001) Approximate solutions to the turbine balancing problem. Eur J Oper Res 130(1):147–155

    Article  MATH  Google Scholar 

  • Pollatschek MA, Gershoni N, Radday YT (1976) Optimization of the typewriter keyboard by simulation. Angewandte Informatik 17:438–439

    Google Scholar 

  • Pradeepmon TG, Panicker VV, Sridharan R (2016) Parameter selection of discrete particle swarm optimization algorithm for the quadratic assignment problems. Procedia Technol 25:998–1005

    Article  Google Scholar 

  • QAPLIB (2017) A quadratic assignment problem library [on line]. http://anjos.mgi.polymtl.ca/qaplib/news.htm. Accessed 6 Aug 2017

  • Ramakrishnan KG, Resende MGC, Pardalos PM (1996) A branch and bound algorithm for the quadratic assignment problem using a lower bound based on linear programming. In: Floudas CA, Pardalos PM (eds) State of the art in global optimization. Nonconvex optimization and its applications, vol 7. Springer, Boston, MA

    Google Scholar 

  • Ramakrishnan KG, Resende MGC, Ramachandran B, Pekny JF (2002) Tight QAP bounds via linear programming. In: Combinatorial and global optimization. World Scientific Publishing, Singapore, pp 297–303. https://doi.org/10.1142/9789812778215_0019

  • Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232–2248

    Article  MATH  Google Scholar 

  • Rendl F, Sotirov R (2007) Bounds for the quadratic assignment problem using the bundle method. Math Program 109(2–3):505–524

    Article  MathSciNet  MATH  Google Scholar 

  • Rendl F, Wolkowicz H (1992) Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem. Math Program 53:63–78

    Article  MathSciNet  MATH  Google Scholar 

  • Reynolds AM, Frye MA (2007) Free-flight odor tracking in Drosophila is consistent with an optimal intermittent scale-free search. PloS One 2(4):e354

    Article  Google Scholar 

  • Riffi ME, Sayoti F (2017) Hybrid algorithm for solving the quadratic assignment problem. Int J Interact Multimed Artif Intell. https://doi.org/10.9781/ijimai.2017.10.003

    Article  Google Scholar 

  • Roth M (2005) Termite: a swarm intelligent routing algorithm for mobile wireless ad-hoc networks

  • Sahni S, Gonzalez T (1976) P-complete approximation problems. J ACM 23(3):555–565‏

    Article  MathSciNet  MATH  Google Scholar 

  • Sanhueza C, Jiménez F, Berretta R, Moscato P (2017) PasMoQAP: a parallel asynchronous memetic algorithm for solving the Multi-Objective Quadratic Assignment Problem. In: 2017 IEEE congress on evolutionary computation (CEC), pp 1103–1110

  • Schulz C, Träff JL (2017) Better process mapping and sparse quadratic assignment. arXiv preprint. http://arxiv.org/abs/1702.04164

  • Shah-Hosseini H (2011) Principal components analysis by the galaxy-based search algorithm: a novel metaheuristic for continuous optimization. Int J Comput Sci Eng 6(1–2):132–140

    Google Scholar 

  • Shi Y, Eberhart R (1998) A modified particle swarm optimizer. In: Proceedings of IEEE world congress on computational intelligence, pp 69–73

  • Shilane D, Martikainen J, Dudoit S, Ovaska SJ (2008) A general framework for statistical performance comparison of evolutionary computation algorithms. Inf Sci 178(14):2870–2879‏

    Article  Google Scholar 

  • Shiqin Y, Jianjun J, Guangxing Y (2009) A dolphin partner optimization. In: 2009 WRI global congress on intelligent systems (GCIS), vol 1, pp 124–128‏

  • Shylo PV (2017) Solving the quadratic assignment problem by the repeated iterated tabu search method. Cybern Syst Anal 53(2):308–311

    Article  MATH  Google Scholar 

  • Simon D (2008) Biogeography-based optimization. IEEE Trans Evol Comput 12(6):702–713

    Article  Google Scholar 

  • Siu F, Chang RKC (2002) Effectiveness of optimal node assignments in wavelength division multiplexing networks with fixed regular virtual topologies. Comput Netw 38(1):61–74

    Article  Google Scholar 

  • Skorin-Kapov J (1990) Tabu search applied to the quadratic assignment problem. ORSA J Comput 2(1):33–45

    Article  MATH  Google Scholar 

  • Smith M, Li W (2001) Quadratic assignment problems and M/G/C/C/ state dependent network flows. J Comb Optim 5:421–444

    Article  MathSciNet  MATH  Google Scholar 

  • Solimanpur M, Vrat P, Shankar R (2004) Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing. Eur J Oper Res 157(3):592–606

    Article  MathSciNet  MATH  Google Scholar 

  • Steinberg L (1961) The backboard wiring problem: a placement algorithm. SIAM Rev 3(1):37–50

    Article  MathSciNet  MATH  Google Scholar 

  • Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359

    Article  MathSciNet  MATH  Google Scholar 

  • Syed-Abdullah SS, Abdul-Rahman S, Benjamin AM, Wibowo A, Ku-Mahamud KR (2018) Solving quadratic assignment problem with fixed assignment (QAPFA) using branch and bound approach. In: IOP conference series: materials science and engineering, vol 300, no 1, p 012002

  • Taillard É (1991) Robust taboo search for the quadratic assignment problem. Parallel Comput 17(4–5):443–455

    Article  MathSciNet  Google Scholar 

  • Talbi EG, Roux O, Fonlupt C, Robillard D (2001) Parallel ant colonies for the quadratic assignment problem. Future Gener Comput Syst 17(4):441–449

    Article  MATH  Google Scholar 

  • Tseng LY, Liang SC (2005) A hybrid metaheuristic for the quadratic assignment problem. Comput Optim Appl 34:85–113

    Article  MathSciNet  MATH  Google Scholar 

  • Tsutsui S (2008) Parallel ant colony optimization for the quadratic assignment problems with symmetric multi-processing. In: International conference on ant colony optimization and swarm intelligence. Springer, Berlin, pp 363–370

  • Ugi I, Bauer J, Brandt J, Friedrich J, Gasteiger J, Jochum C, Schubert W (1979) New fields of application for computers in chemistry. Angew Chem 91(2):99–111

    Article  Google Scholar 

  • Uwate Y, Nishio Y, Ushida A (2004) Markov chain modeling of intermittency chaos and its application to Hopfield NN. IEICE Trans Fundam Electron Commun Comput Sci 87(4):774–779

    Google Scholar 

  • Inoba V, Indhumathi A (2015) A study on quadratic assignment problem in wireless sensor networks. Int J Latest Trends Eng Technol (IJLTET) 6(1):30–36

    Google Scholar 

  • Vogelstein JT, Conroy JM, Lyzinski V, Podrazik LJ, Kratzer SG, Harley ET, … Priebe CE (2015) Fast approximate quadratic programming for graph matching. PLOS One 10(4):e0121002

    Article  Google Scholar 

  • Wang RL, Okazaki K (2005) Solving facility layout problem using an improved genetic algorithm. IEICE Trans Fundam Electron Commun Comput Sci 88(2):606–610

    Article  Google Scholar 

  • Webster B, Bernhard PJ (2003) A local search optimization algorithm based on natural principles of gravitation

  • Wess B, Zeitlhofer T (2004) On the phase coupling problem between data memory layout generation and address pointer assignment. In: Schepers H (eds) Software and compilers for embedded systems, vol 3199. Springer, Berlin, Heidelberg

    Chapter  MATH  Google Scholar 

  • White DJ (1995) Some concave-convex representations of the quadratic assignment problem. Eur J Oper Res 80(2):418–424

    Article  Google Scholar 

  • Wilhelm MR, Ward TL (1987) Solving quadratic assignment problems by simulated annealing. IIE Trans 19(1):107–119

    Article  Google Scholar 

  • Wolkowicz H (2000) Semidefinite programming approaches to the quadratic assignment problem. In: Pardalos PM, Pitsoulis LS (eds) Nonlinear assignment problems. Combinatorial Optimization, vol 7. Springer, Boston, MA

    Google Scholar 

  • Wolkowicz H, Saigal R, Vandenberghe L (2000) Handbook of semidefinite programming: theory, algorithms, and applications, vol 27. Springer Science and Business Media, Berlin

    Book  MATH  Google Scholar 

  • Wolkowicz H (2010) Generating eigenvalue bounds using optimization. In: Pardalos P, Rassias T, Khan A (eds) Nonlinear analysis and variational problems, vol 35. Springer, New York, NY

    Chapter  Google Scholar 

  • Xia Y (2008) Gilmore-Lawler bound of quadratic assignment problem. Front Math China 3(1):109–118

    Article  MathSciNet  Google Scholar 

  • Yamada S (1992) A new formulation of the quadratic assignment problem on r-dimensional grid. IEEE Trans Circuits Syst I Fundam Theory Appl 39(10):791–797

    Article  MATH  Google Scholar 

  • Yang XS (2010) Firefly algorithm, stochastic test functions and design optimization. Int J Bio Inspired Comput 2(2):78–84‏

    Article  Google Scholar 

  • Yang XS, Deb S (2009) Cuckoo search via Lévy flights. In: 2009 IEEE world congress on nature and biologically inspired computing (NaBIC), pp 210–214

  • Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82–102

    Article  Google Scholar 

  • Ying KC, Liao CJ (2004) An ant colony system for permutation flow-shop sequencing. Comput Oper Res 31(5):791–801

    Article  MATH  Google Scholar 

  • Youssef H, Sait SM, Ali H (2003) Fuzzy simulated evolution algorithm for VLSI cell placement. Comput Ind Eng 44(2):227–247

    Article  Google Scholar 

  • Yu J, Sarker BR (2003) Directional decomposition heuristic for a linear machine-cell location problem. Eur J Oper Res 149(1):142–184

    Article  MathSciNet  MATH  Google Scholar 

  • Zaied ANH, Shawky LAEF (2014) A survey of quadratic assignment problems. Int J Comput Appl 101(6):28–36

    Google Scholar 

  • Zhang R (2011) Quadratic bottleneck problems: algorithms, complexity and related topics. Doctoral dissertation, Science: Department of Mathematics

  • Zhao Q, Karisch SE, Rendl F, Wolkowicz H (1998) Semidefinite programming relaxations for the quadratic assignment problem. J Comb Optim 2:71–109

    Article  MathSciNet  MATH  Google Scholar 

  • Zurada JM, Marks RJ, Robinson J (1995) Review of computational intelligence: imitating life

Download references

Author information

Authors and Affiliations

  1. Department of Operations Research, Faculty of Computers and Informatics, Zagazig University, Zagazig, Egypt

    Mohamed Abdel-Basset & Heba Rashad

  2. University of California, Davis, United States

    Gunasekaran Manogaran

  3. Department of Information System, Faculty of Computers and Informatics, Zagazig University, Zagazig, Egypt

    Abdel Nasser H. Zaied

Authors
  1. Mohamed Abdel-Basset
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gunasekaran Manogaran
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Heba Rashad
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Abdel Nasser H. Zaied
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohamed Abdel-Basset.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Abdel-Basset, M., Manogaran, G., Rashad, H. et al. A comprehensive review of quadratic assignment problem: variants, hybrids and applications. J Ambient Intell Human Comput (2018). https://doi.org/10.1007/s12652-018-0917-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s12652-018-0917-x

Keywords

Search

Navigation