Advertisement

Journal of Global Optimization

, Volume 10, Issue 4, pp 391–403 | Cite as

QAPLIB – A Quadratic Assignment Problem Library

  • Rainer E. Burkard
  • Stefan E. Karisch
  • Franz Rendl
Article

Abstract

A collection of electronically available data instances for the QuadraticAssignment Problem is described. For each instance, we provide detailedinformation, indicating whether or not the problem is solved to optimality. Ifnot, we supply the best known bounds for the problem. Moreover we surveyavailable software and describe recent dissertations related to the QuadraticAssignment Problem.

Quadratic assignment problem data instances problem library 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R. Battiti and G. Tecchiolli. The reactive tabu search. ORSA Journal on Computing 6(2): 126–140, 1994.Google Scholar
  2. 2.
    A. Brüngger, J. Clausen, A. Marzetta and M. Perregaard. Joining forces in solving large-scale quadratic assignment problems. DIKU Technical Report, University of Copenhagen, 1996.Google Scholar
  3. 3.
    R.E. Burkard. Locations with spatial interactions: the quadratic assignment problem. In P.B. Mirchandani and R.L. Francis, editors, Discrete Location Theory. Wiley, Berlin, 1991.Google Scholar
  4. 4.
    R.E. Burkard and E. Çela. Quadratic and three-dimensional assignment problems. In M. Dell’Amico, F. Maffioli, and S. Martello, editors, Annotated Bibliographies in Combinatorial Optimization. 1996. To appear. Available as SFB Report 63, Graz University of Technology, Graz, Austria.Google Scholar
  5. 5.
    R.E. Burkard and U. Derigs. Assignment and Matching Problems: Solution Methods with Fortran Programs, volume 184 of Lecture Notes in Economics and Mathematical Systems. Springer, Berlin, 1980.Google Scholar
  6. 6.
    R.E. Burkard and J. Offermann. Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme. Zeitschrift für Operations Research 21: B121–B132, 1977.Google Scholar
  7. 7.
    R.E. Burkard and F. Rendl. A thermodynamically motivated simulation procedure for combinatorial optimization problems. European Journal of Operations Research 17(2): 169–174, 1984.Google Scholar
  8. 8.
    E. Çela. The quadratic assignment problem: special cases and relatives. PhD thesis, Graz University of Technology, Graz, Austria, 1995.Google Scholar
  9. 9.
    N. Christofides and E. Benavent. An exact algorithm for the quadratic assignment problem. Operations Research 37-5: 760–768, 1989.Google Scholar
  10. 10.
    J. Clausen and M. Perregaard. Solving large quadratic assignment problems in parallel. Computational Optimization and Applications, 1994. To appear.Google Scholar
  11. 11.
    A.N. Elshafei. Hospital layout as a quadratic assignment problem. Operations Research Quarterly 28: 167–179, 1977.Google Scholar
  12. 12.
    B. Eschermann and H.J. Wunderlich. Optimized synthesis of self-testable finite state machines. In 20th International Symposium on Fault-Tolerant Computing (FFTCS 20), Newcastle upon Tyne, 26-28th June, 1990.Google Scholar
  13. 13.
    C. Fleurent and J.A. Ferland. Genetic hybrids for the quadratic assignment problem. In P. Pardalos and H. Wolkowicz, editors, Quadratic Assignment and Related Problems, volume 16, pages 173–187. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1994.Google Scholar
  14. 14.
    P.C. Gilmore. Optimal and suboptimal algorithms for the quadratic assignment problem. SIAM Journal on Applied Mathematics 10: 305–31, 1962.Google Scholar
  15. 15.
    S.W. Hadley, F. Rendl, and H. Wolkowicz. A new lower bound via projection for the quadratic assignment problem. Mathematics of Operations Research 17: 727–739, 1992.Google Scholar
  16. 16.
    P. Hahn, T. Grant, and N. Hall. Solution of the quadratic assignment problem using the Hungarian method. European Journal of Operational Research, to appear, 1995.Google Scholar
  17. 17.
    T.A. Johnson. New linear programming-based solution procedures for the quadratic assignment problem. PhD thesis, Clemson University, Clemson, USA, 1992.Google Scholar
  18. 18.
    S.E. Karisch. Nonlinear approaches for quadratic assignment and graph partition problems. PhD thesis, Graz University of Technology, Graz, Austria, 1995.Google Scholar
  19. 19.
    S.E. Karisch and F. Rendl. Lower bounds for the quadratic assignment problem via triangle decompositions. Mathematical Programming 71(2): 137–152, 1995.Google Scholar
  20. 20.
    S.E. Karisch, F. Rendl, H. Wolkowicz, and Q. Zhao. Semidefinite programming relaxations for the quadratic assignment problem. Working paper, CDL-DO, Department of Mathematics, Graz University of Technology, Graz, Austria, 1995.Google Scholar
  21. 21.
    J. Krarup and P.M. Pruzan. Computer-aided layout design. Mathematical Programming Study 9: 75–94, 1978.Google Scholar
  22. 22.
    E. Lawler. The quadratic assignment problem. Management Science 9: 586–599, 1963.Google Scholar
  23. 23.
    Y. Li. Heuristic and exact algorithms for the quadratic assignment problem. PhD thesis, The Pennsylvania State University, USA, 1992.Google Scholar
  24. 24.
    Y. Li and P.M. Pardalos. Generating quadratic assignment test problems with known optimal permutations. Computational Optimization and Applications 1: 163–184, 1992.Google Scholar
  25. 25.
    Y. Li, P.M. Pardalos, and M.G.C. Resende. A greedy randomized adaptive search procedure for the quadratic assignment problem. In P. Pardalos and H. Wolkowicz, editors, Quadratic Assignment and Related Problems, volume 16, pages 237–261. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1994.Google Scholar
  26. 26.
    F. Malucelli. Quadratic assignment problems: solution methods and applications. PhD thesis, University of Pisa, Pisa, Italy, 1993.Google Scholar
  27. 27.
    T. Mautor. Contributionàla rèsolution des prob;èmes d’implanation: algorithmes séquentiels et parallèles pour l’affectation quadratique. PhD thesis, Université Pierre et Marie Curie, Paris, France, 1992.Google Scholar
  28. 28.
    C.E. Nugent, T.E. Vollman, and J. Ruml. An experimental comparison of techniques for the assignment of facilities to locations. Operations Research 16: 150–173, 1968.Google Scholar
  29. 29.
    T. Ostrowski and V.T. Ruoppila. Genetic annealing search for index assignment in vector quantization. Technical Report, Digital Media Institute, Tampere University of Technology, Tampere, Finland, 1996.Google Scholar
  30. 30.
    P.M. Pardalos, F. Rendl, and H. Wolkowicz. The quadratic assignment problem: a survey of recent developments. In P. Pardalos and H. Wolkowicz, editors, Quadratic Assignment and Related Problems, volume 16, pages 1–42. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1994.Google Scholar
  31. 31.
    P.M. Pardalos and H. Wolkowicz, editors. Quadratic Assignment and Related Problems, volume 16 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. 1994.Google Scholar
  32. 32.
    M.G.C. Resende, P.M. Pardalos, and Y. Li. FORTRAN subroutines for approximate solution of dense quadratic assignment problems using GRASP. ACM Transactions on Mathematical Software 22(1): 104–118, 1996.Google Scholar
  33. 33.
    M.G.C. Resende, K.G. Ramakrishnan, and Z. Drezner. Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming. Operations Research 43: 781–791, 1995.Google Scholar
  34. 34.
    M. Rijal. Scheduling, design and assignment problems with quadratic costs. PhD thesis, New York University, New York, USA, 1995.Google Scholar
  35. 35.
    C. Roucairol. Du sequentiel au parallele: la recherche arborescente et son applicationàla programmation quadratique en variables 0 et 1, 1987. Thèse d’Etat, Université Pierre et Marie Curie, Paris, France.Google Scholar
  36. 36.
    M. Scriabin and R.C. Vergin. Comparison of computer algorithms and visual based methods for plant layout. Management Science 22: 172–187, 1975.Google Scholar
  37. 37.
    J. Skorin-Kapov. Tabu search applied to the quadratic assignment problem. ORSA Journal on Computing 2(1): 33–45, 1990.Google Scholar
  38. 38.
    L. Steinberg. The backboard wiring problem: a placement algorithm. SIAM Review 3: 37–50, 1961.Google Scholar
  39. 39.
    É.D. Taillard. Robust tabu search for the quadratic assignment problem. Parallel Computing 17: 443–455, 1991.Google Scholar
  40. 40.
    É.D. Taillard. Comparison of iterative searches for the quadratic assignment problem. Location Science, 1994. To appear.Google Scholar
  41. 41.
    U.W. Thonemann and A. Bölte. An improved simulated annealing algorithm for the quadratic assignment problem. Working paper, School of Business, Department of Production and Operations Research, University of Paderborn, Germany, 1994.Google Scholar
  42. 42.
    M.R. Wilhelm and T.L. Ward. Solving quadratic assignment problems by simulated annealing. IIE Transaction 19/1: 107–119, 1987.Google Scholar

Copyright information

© Kluwer Academic Publishers 1997

Authors and Affiliations

  • Rainer E. Burkard
    • 1
  • Stefan E. Karisch
    • 2
  • Franz Rendl
    • 1
  1. 1.Department of MathematicsGraz University of TechnologyGrazAustria
  2. 2.Department of Computer ScienceUniversity of CopenhagenCopenhagenDenmark

Personalised recommendations