SpringerLink
Log in

Quadratic Assignment Problem

  • Chapter
  • First Online:
Facility Location

Part of the book series: Contributions to Management Science ((MANAGEMENT SC.))

Abstract

The quadratic assignment problem (QAP) in location Theory is the problem of locating facilities the cost of placing a facility depends on the distances from other facilities and also the interaction with other facilities. QAP was introduced by Koopmans and Beckman in 1957 who were trying to model a facilities location problem.

It is possible to formulate some classic problems of combinatorial optimization, such as the traveling salesman, maximum clique and graph partitioning problems as a QAP. The QAP belongs to the class of NP-complete problems and is considered one of the most difficult combinatorial optimization problems. Exact solution strategies for the QAP have been unsuccessful for large problem (approximately N ≤ 25).

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  • Abreu NMM, Querido TM, Boaventura-Netto PO (1999) RedInv- SA: A simulated annealing for the quadratic assignment problem. RAIRO Oper Res 33(3):249–273

    Google Scholar 

  • Acan A (2005) An external partial permutations memory for ant colony optimization. Lect Notes Comput Sci 3448:1–11

    Google Scholar 

  • Adams WP, Johnson TA (1994) Improved linear programming-based lower bounds for the quadratic assignment problem. In: Pardalos PM, Wolkowicz H (eds) Quadratic assignment and related problems, DIMACS Series in Discrete Math Theor Comput Sci, AMS, Rhode Island 16:43–75

    Google Scholar 

  • Adams WP, Guignard M, Hahn PM, Hightower WL (2007) A level-2 reformulation-linearization technique bound for the quadratic assignment problem. Eur J Oper Res 180(3):983–996

    Google Scholar 

  • Ahuja R, Orlin JB, Tiwari A (2000) A greedy genetic algorithm for the quadratic assignment problem. Comput Oper Res 27(10):917–934

    Google Scholar 

  • Anderson EJ (1996) Theory and methodology: Mechanisms for local search. Eur J Oper Res 88:139–151

    Google Scholar 

  • Anstreicher KM (2001) Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem. SIAM J Optimiz 11(1):254–265

    Google Scholar 

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

    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

    Google Scholar 

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

    Google Scholar 

  • Armour GC, Buffa ES (1963) Heuristic algorithm and simulation approach to relative location of facilities. Manage Sci 9(2):294–309

    Google Scholar 

  • Arora S, Frieze A, Kaplan H (2002) A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Math Program 92(1):1–36

    Google Scholar 

  • Assad AA, Xu W (1985) On lower bounds for a class of quadratic {0,1} programs. Oper Res Lett 4(4):175–180

    Google Scholar 

  • Balakrishnan J, Cheng CH, Conway DG, Lau CM (2003) A hybrid genetic algorithm for the dynamic plant layout problem. Int J Prod Econ 86(2):107–120

    Google Scholar 

  • Battiti R, Tecchiolli G (1994) Simulated annealing and tabu search in the long run: A comparison on QAP tasks. Comput Math Appl 28(6):1–8

    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

    Google Scholar 

  • Bazaraa MS, Sherali HD (1980) Benders’ partitioning scheme applied to a new formulation of the quadratic assignment problem. Naval Res Logist Quart 27:29–41

    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 33:991–1003

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • Blanchard A, Elloumi S, Faye A, Wicker N (2003) A cutting algorithm of the quadratic assignment problem. INFO 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

    Google Scholar 

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

    Google Scholar 

  • Bos J (1993a) A quadratic assignment problem solved by simulated annealing. J Environ Manage 37(2):127–145

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • Bruijs PA (1984) On the quality of heuristic solutions to a 19 ⋅19 quadratic assignment problem. Eur J Oper Res 17:21–30

    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 Classification 17-(2):197–223

    Google Scholar 

  • Buffa ES, Armour GC, Vollmann TE (1964) Allocating facilities with CRAFT. Harvard Bus Rev 42(2):136–158

    Google Scholar 

  • Bullnheimer B (1998) An examination – scheduling model to maximize students’ study time. Lect Notes Comput Sci 1408:78–91

    Google Scholar 

  • Burer S, Vandenbussche D (2006) Solving lift-and-project relaxations of binary integer programs. SIAM J Optimiz 16:726–750

    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

    Google Scholar 

  • Burkard RE, Rendl F (1984) A thermodynamically motivated simulation procedure for combinatorial optimization problems. Eur J Oper Res 17(2):169–174

    Google Scholar 

  • Burkard RE, Cela E (1995) Heuristics for biquadratic assignment problems and their computational comparison. Eur J Oper Res 83(2):283–300

    Google Scholar 

  • Burkard RE, Karisch S, Rendl F (1991) QAPLIB – A quadratic assignment problem library. Eur J Oper Res 55:115–119

    Google Scholar 

  • Chakrapani J, Skorin- Kapov J (1993) Massively parallel tabu search for the quadratic assignment problem. Ann Oper Res 41(1–4):327–342

    Google Scholar 

  • Chiang WC, Chiang C (1998) Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation. Eur J Oper Res 106(2–3):457–488

    Google Scholar 

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

    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

    Google Scholar 

  • 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

    Google Scholar 

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

    Google Scholar 

  • Dorigo M, Gambardella LM, Tailard ED (1997) Ant colonies for Q A P, Technical Report, IDSIA, 4

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • Drezner Z, Marcoulides GA (2003) A distance-based selection ofparents in genetic algorithms. In: Resende MGC, de Sousa JP (eds). Metaheuristics: Computer decision-making, combinatorial optimization book series. Kluwer, Dordecht, pp 257–278

    Google Scholar 

  • Dunker T, Radons G, Westkämper E (2004) Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem. Eur J Oper Res 165(1):55–69

    Google Scholar 

  • Edwards CS (1980) A branch and bound algorithm for the Koopmans–Beckmann quadratic assignment problem. Math Program Study 13:35–52

    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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • Fleurent C, Ferland JA (1994) Genetic hybrids for the quadratic assignment problem. In: Pardalos PMM, Wolkowicz H (eds). Quadratic assignment and related problems. DIMACS Series in Discrete Math Theor Comput Sci, vol. 16. AMS, Rhode Island, pp 173–187

    Google Scholar 

  • Fleurent C, Glover F (1999) Improved constructive multistart strategies of quadratic assignment problem using adaptive memory. INFORMS J Comput 11:189–203

    Google Scholar 

  • Forsberg JH, Delaney RM, Zhao Q, Harakas G, Chandran R (1994) Analyzing lanthanide-included shifts in the NMR spectra of lanthanide (III) complexes derived from 1,4,7,10-tetrakis (N,N-diethylacetamido)-1,4,7,10-tetraazacyclododecane. Inorg Chem 34:3705–3715

    Google Scholar 

  • Francis RL, White JA (1974) Facility layout and location: An analytical approach. Prentice-Hall, Englewood Cliffs, NJ

    Google Scholar 

  • Frieze A.M, Yadegar J (1983) On the quadratic assignment problem. Discrete Appl Math 5:89–98

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    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–61:337–342

    Google Scholar 

  • Graves GW, Whinston AB (1970) An algorithm for the quadratic assignment problem. Manage Sci 17(7):453–471

    Google Scholar 

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

    Google Scholar 

  • Hadley SW, Rendl F, Wolkowicz H (1992a) Nonsymmetric quadratic assignment problems and the Hoffman–Wielandt inequality. Linear Algebra Appl 58:109–124

    Google Scholar 

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

    Google Scholar 

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

    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

    Google Scholar 

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

    Google Scholar 

  • Hamacher H, Nickel S, Tenfelde-Podehl D (2003) Facilities layout for social institutions. In: Operation Research Proceedings 2001, Selected papers of the international conference on operations research (OR2001). Springer-Verlag, Berlin, pp 229–236

    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

    Google Scholar 

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

    Google Scholar 

  • Heffley DR (1972) The quadratic assignment problem: A note. Econometrica 40(6):1155–1163

    Google Scholar 

  • Heider CH (1973) An N- step, 2- variable search algorithm for the component placement problem. Naval Res Logist Quart 20:699–724

    Google Scholar 

  • Hubert L (1987) Assignment methods in combinatorial data analysis. Statistics: textbooks and monographs series, vol 73. Marcel Dekker, New York

    Google Scholar 

  • Ishii S, Sato M (1998) Constrained neural approaches to quadratic assignment problems. Neural Netw 11(6):1073–1082

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • Kaibel V (1998) Polyhedral combinatorics of quadratic assignment problems with less objects than locations. Lecture Notes Comput Sci 1412:409–422

    Google Scholar 

  • Kaufman L, Broeckx F (1978)An algorithm for the quadratic assignment problem using Benders’decomposition, Eur J Oper Res 2:204–211

    Google Scholar 

  • Knowles J, Corne D (2003) Instance generators and test suites for the multiobjective quadratic assignment problem. In: Evolutionary multi-criterion optimization (EMO 2003) Second International Conference, Portugal, Proceedings. Berlin, Springer-Verlag, LNCS, pp 295–310

    Google Scholar 

  • Koopmans TC, Beckmann MJ (1957) Assignment problems and the location of economic activities. Econometrica 25:53–76

    Google Scholar 

  • Krarup J, Pruzan PM (1978) Computer-aided layout design. Math Program Study 9:75–94

    Google Scholar 

  • Land AM (1963) A problem of assignment with interrelated costs. Oper Res Quart 14:185–198

    Google Scholar 

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

    Google Scholar 

  • Lee CG, Ma Z (2004) The generalized quadratic assignment problem. Research Report, Department of mechanical and industrial engineering, University of Toronto, Canada

    Google Scholar 

  • Li WJ, Smith JM (1995) An algorithm for quadratic assignment problems. Eur J Oper Res 81:205–216

    Google Scholar 

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

    Google Scholar 

  • Li Y, Pardalos PM, Resende, MGC (1994b) A greedy randomized adaptive search procedure for the quadratic assignment problem. In: Pardalos PM, Wolkowicz H (eds), Quadratic assignment and related problems, DIMACS series in Discrete Math Theor Comput Sci, vol. 16. AMS, Rhode Island, pp 237–261

    Google Scholar 

  • Lova’sz L, Schrijver A (1991) Cones of matrices and set-functions, and 0–1 optimization. SIAM J Optimiz 1:166–190

    Google Scholar 

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

    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

    Google Scholar 

  • Mavridou T, Pardalos PM (1997) Simulated annealing and genetic algorithms for the facility layout problem: A survey. Computat Optimiz Appl 7:111–126

    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

    Google Scholar 

  • Merz P, Freisleben B (1999) A comparison of mimetic algorithms, tabu search, and ant colonies for the quadratic assignment problem. In: Proceedings of the 1999 International Congress of Evolutionary Computation (CEC’99). IEEE Press, New York, pp 2063–2070

    Google Scholar 

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

    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

    Google Scholar 

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

    Google Scholar 

  • Mirchandani PB, Obata T (1979) Algorithms for a class of quadratic assignment problems. Presented at the Joint ORSA/TIMS National Meeting, New Orleans

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • Nishiyama T, Tsuchiya K, Tsujita K (2001) A Markov chain Monte Carlo algorithm for the quadratic assignment problem based on replicator equations. Lecture Notes Comput Sci 2130:148–155

    Google Scholar 

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

    Google Scholar 

  • Obuchi Y, Masui H, Ohki M (1996) Weighted parallel problem solving by optimization networks. Neural Netw 9(2):357–366

    Google Scholar 

  • Oliveira CAS, Pardalos MP, Resende MGG (2004) GRASP with path relinking for the quadratic assignment problem. In: Experimental and efficient algorithms, Third International Workshop (WEA 2004), Brazil, LNCS 3059. Springer, Berlin, pp 356–368

    Google Scholar 

  • Orhan T, Cigdem A (2001) A fuzzy Tabu search approach for the plant layout problem

    Google Scholar 

  • 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

    Google Scholar 

  • Pardalos P M, Murthy K A, Harrison TP (1993) A computational comparison of local search heuristics for solving quadratic assignment problems. Information 4(1–2):172–187

    Google Scholar 

  • Peng T, Huanchen W, Dongme Z (1996) Simulated annealing for the quadratic assignment problem: A further study. Comput Ind Eng 31(3–4):925–928

    Google Scholar 

  • Pierskalla WP (1967a) The tri-substitution method for the three-multidimensional assignment problem. Can Oper Res Soc J 5(2):71–81

    Google Scholar 

  • Pierskalla WF (1967b) The multi-dimensional assignment problem. Technical Memorandum No. 93, Operations Research Department, CASE Institute of Technology, Available on line at: http://www.anderson.ucla.edu/faculty/william.pierskalla/Chronological_Bank/Research_and_Publication_Chro.html Mathematical, State September 1967

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

    Google Scholar 

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

    Google Scholar 

  • Rangel M C, Abreu NMM, Boaventura-Netto PO (2000) GRASP in the QAP: an acceptance bound for initial solutions (in Portuguese). Pesquisa Operacional 20(1):45–58

    Google Scholar 

  • Rendl F, Sotirov R (2003) Bounds for the quadratic assignment problem using the bundle method. Accepted for publication in Math. Program. B, and will appear in the special issue dedicated to Jos Sturm, First available in 2003 as a Technical Report, Department of Mathematics, University of Klagenfurt

    Google Scholar 

  • Rossin DF, Springer MC, Klein BD (1999) New complexity measures for the facility layout problem: An empirical stud using traditional and neural network analysis. Comput Ind Eng 36(3):585–602

    Google Scholar 

  • Sahni S, Gonzales T (1976) P-complete approximation problems. J Assoc Comput Mach 23: 555–565

    Google Scholar 

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

    Google Scholar 

  • Sherali HD, Adams WP (1990) A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J Disc Math 3:411–430

    Google Scholar 

  • Sherali HD, Adams WP, Smith JC (2000) Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations. Discrete Appl Math 101:247–267

    Google Scholar 

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

    Google Scholar 

  • Skorin-Kapov J (1994) Extensions of a tabu search adaptation to the quadratic assignment problem. J Comput Oper Res 21(8):855–865

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • Stützle T, Dorigo M (1999) ACO algorithms for the quadratic assignment problem. In: Corne D, Dorigo M, Glover F (eds). New Ideas Optimiz. McGraw-Hill, New York, pp 33–55

    Google Scholar 

  • Stützle T, Holgez H (2000) Max-Min ant system. Future Gener Comput Syst 16(8):889–914

    Google Scholar 

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

    Google Scholar 

  • Talbi EG, Hafidi Z, Kebbal D, Geib JM (1998a) A fault-tolerant parallel heuristic for assignment problems. Future Generation Comput Syst 14(5–6):425–438

    Google Scholar 

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

    Google Scholar 

  • Tansel BC, Bilen C (1998) Move based heuristics for the unidirectional loop network layout problem. Eur J Oper Res 108(1):36–48

    Google Scholar 

  • Tavakkoli-Moghaddain R, Shayan E (1998) Facilities layout design by genetic algorithms. Comput Ind Eng 35(3–4):527–530

    Google Scholar 

  • Tian P, Wang HC, Zhang DM (1996) Simulated annealing for the quadratic assignment problem: A further study. Comput Ind Eng 31(3–4):925–928

    Google Scholar 

  • Tian P, Ma J, Zhang DM (1999) Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism. Eur J Oper Res 118(1):81–94

    Google Scholar 

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

    Google Scholar 

  • Tsuchiya K, Bharitkar S, Takefuji Y (1996) A neural network approach to facility layout problems. Eur J Oper Res 89(3):556–563

    Google Scholar 

  • Tsutsui S (2007) Cunning ant system for quadratic assignment problem with local search and parallelization. Lecture Notes Comput Sci. Springer, Berlin, pp 269–278

    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 E87A(4):774–779

    Google Scholar 

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

    Google Scholar 

  • Wess B, Zeitlhofer T (2004) On the phase coupling problem between data memory layout generation and address pointer assignment. Lecture Notes Comput Sci 3199:152–166

    Google Scholar 

  • West DH (1983) Algorithm 608: Approximate solution of the quadratic assignment problem. ACM Trans Math Softw 9:461–466

    Google Scholar 

  • White DJ (1993) A parametric-based heuristic program for the quadratic assignment problem. Nava Res Logist 40(4):553–568

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • Yip PPC, Pao YH (1994) A guided evolutionary simulated annealing approach to the quadratic assignment problem. IEEE Trans Syst Man Cybernet 24(9):1383–1387

    Google Scholar 

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

    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

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Amirkabir University of Technology, Tehran, Iran

    Masoumeh Bayat & Mahdieh Sedghi

Authors
  1. Masoumeh Bayat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mahdieh Sedghi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Masoumeh Bayat .

Editor information

Editors and Affiliations

  1. Centre for Maritime Studies, National University of Singapore, Singapore, Singapore

    Reza Zanjirani Farahani

  2. Department of Industrial Engineering, Amirkabir University of Technology, Tehran, Iran

    Masoud Hekmatfar

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Physica-Verlag Heidelberg

About this chapter

Cite this chapter

Bayat, M., Sedghi, M. (2009). Quadratic Assignment Problem. In: Zanjirani Farahani, R., Hekmatfar, M. (eds) Facility Location. Contributions to Management Science. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-2151-2_6

Download citation

Publish with us

Policies and ethics

Search

Navigation