Skip to main content
SpringerLink
Log in

Pushing the Limits of Solvable QAP Problems Using Parallel Processing - Is Nugent30 within Reach?

  • Chapter
Parallel Processing of Discrete Problems

Part of the book series: The IMA Volumes in Mathematics and its Applications ((IMA,volume 106))

Abstract

In 1991 solving Quadratic Assignment Problems of dimension exceeding 15 was considered to be a computational challenge. Nevertheless, the solution of the classical Nugent20 benchmark of size 20 was announced 3 years later, and recently instances of size 25 have been solved. A key feature in this development has been the use of parallelism in Branch-and-Bound algorithms.

This article discusses the role of parallel processing in problem solving in general and in the solution of QAP instances in particular. The recent development in the solution of large QAP instances is reviewed, and based on descriptions of available bounding methods and their properties, the choice of bound function for a parallel Branch-and-Bound algorithm for QAP problems is discussed. Finally, we discuss the possibilities of pushing the limit of solvable QAP-instances by combining new bound calculation methods with high performance parallel computing.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W.P. Adams and T.A. Johnson, Improved Linear Programming-based Lower Bounds for the Quadratic Assignment Problem, in Quadratic Assignment and Related Problems, P. Pardalos and H. Wolkowicz (eds), DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16, 1994, pp. 43–75.

    Google Scholar 

  2. A. Brüngger, Solving hard combinatorial Optimization Problems in Parallel: Two Case Studies, Ph.D.-thesis, ETH Zürich, 1997.

    Google Scholar 

  3. A. Brüngger, A. Marzetta, J. Clausen, and M. Perregaard, Joining forces in solving large-scale quadratic assignment problems in parallel, in Proceeding of IPPS97, pp. 418–427, 1997

    Google Scholar 

  4. R.E. Burkard, Locations with spatial interactions: the quadratic assignment problem,in P.B. Mirchandanwe and R.L. Francis (eds), Discrete Location Theory, Wiley, Berlin, 1991.

    Google Scholar 

  5. R.E. Burkard and E. Çela, Quadratic and three-dimensional assignment problems, in Annotated Bibliographies in Combinatorial Optimization, M. Dell’Amico, F. Maffioli, and S. Martello (eds), to appear. Available as SFB Report 63, Graz University of Technology, Graz, Austria.

    Google Scholar 

  6. R.E. Burkard, S.E. Karisch, and F. Rendl, QAPLIB a quadratic assign- ment problem library,Journal of Global Optimization 10, 1997, pp. 391–403. QAPLIB Home Page: http://www.diku.dk/~karisch/qaplib.

    Article  MathSciNet  MATH  Google Scholar 

  7. P. Carraresi and F. Malucelli, A new lower bounds for the quadratic assignment problem, Operations Research 40, Supplement 1:S22–S27, 1992.

    MathSciNet  Google Scholar 

  8. P. Carraresi and F. Malucelli, A Reformulation Scheme and New Lower Bounds for the QAP, in Quadratic Assignment and Related Problems, P. Pardalos and H. Wolkowicz (eds), DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16, pp. 147–160, 1994.

    Google Scholar 

  9. J. Clausen, S.E. Karisch, M. Perregaard, and F. Rendl, On the Applicability of Lower Bounds for Solving Rectilinear Quadratic Assignment Problems in Parallel, Computational Optimization and Applications, to appear.

    Google Scholar 

  10. J. Clausen and M. Perregaard, Solving large quadratic assignment problems in parallel, Computational Optimization and Applications 8, pp. 111–127, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  11. G. Finke, R.E. Burkard, and F. Rendl, Quadratic assignment problems,Annals of Discrete Mathematics 31, pp. 61–82, 1987.

    MathSciNet  Google Scholar 

  12. A.M. Frieze and J. Yadegar, On the Quadratic Assignment Problem,Discrete Applied Mathematics 5, pp. 89–98, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  13. B. Gendron and T.G. Cranic, Parallel Branch-and-Bound Algorithms: Survey and Synthesis, Operations Research 42, pp. 1042–1066, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  14. P.C. Gilmore,Optimal and suboptimal algorithms for the quadratic assignment problem,SIAM Journal on Applied Mathematics 10, pp. 305–331, 1962.

    Article  MathSciNet  MATH  Google Scholar 

  15. A. Grama and V. Kumar,Parallel Search Algorithms for Discrete Optimization Problems,ORSA Journal of Computing 7, pp. 365–385, 1995.

    Article  MATH  Google Scholar 

  16. S.W. Hadley, F. Rendl, and H. Wolkowicz, A new lower bound via projection for the quadratic assignment problem,Mathematics of Operations Research 17, pp. 727–739, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  17. P. Hahn, T. Grant, Lower bounds for the Quadratic Assignment Problem Based Upon a Dual Formulation, Manuscript 1997, to appear.

    Google Scholar 

  18. P. Hahn, T. Grant, and N. Hall, Solution of the Quadratic Assignment Problem using the Hungarian Method,European Journal of Operational Research, to appear.

    Google Scholar 

  19. J. JÁjÁ, An introduction to Parallel Algorithms, Addison-Wesley, 1992.

    MATH  Google Scholar 

  20. S.E. Karisch, E. Çela, J. Clausen, and T. Espersen, A dual framework for lower bounds of the quadratic assignment problem based on linearization,SFB report 120, Graz University of Technology, Graz, Austria, 1997.

    Google Scholar 

  21. S.E. Karisch and F. Rendl, Lower bounds for the quadratic assignment problem via triangle decompositions, Mathematical Programming 71(2), pp. 137–152, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  22. T.C. Koopmans and M.J. Beckmann, Assignment problems and the location of economic activities, Econometrica 25, pp. 53–76, 1957.

    Article  MathSciNet  MATH  Google Scholar 

  23. E. Lawler, The quadratic assignment problem, Management Science 9, pp. 586–599, 1963.

    Article  MathSciNet  MATH  Google Scholar 

  24. Y. LI, P.M. Pardalos, K.G. Ramakrishnan and M.G.C. Resende, Lower bounds for the quadratic assignment problem, Annals of Operations Research 50, pp. 387–411, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  25. T. Mautor and C. Roucairol, A new exact algorithm for the solution of quadratic assignment problems, Discrete Applied Mathematics 55, pp. 281–293,1994.

    Article  MathSciNet  MATH  Google Scholar 

  26. C.E. Nugent, T.E. Vollman, and J. Ruml An experimental comparison of techniques for the assignment of facilities to locations, Operations Research 16, pp. 150–173, 1968.

    Article  Google Scholar 

  27. P.M. Pardalos, K.G. Ramakrishnan, M.C.G. Resende, and Y. LI, Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem, SIAM Journal of Optimization 7, pp. 280–294, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  28. P.M. Pardalos, F. Rendl, and H. Wolkowicz, The Quadratic Assignment Problem: A Survey of Recent Developments, in Quadratic Assignment and Related Problems, P. Pardalos and H. Wolkowicz (eds), DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16, pp. 1–42, 1994.

    Google Scholar 

  29. K.G. Ramakrishnan, M.C.G. Resende, B. Ramachandran, and J.F. Pekny, Tight QAP Bounds via Linear Programming, Manuscript, March 1996.

    Google Scholar 

  30. 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, pp. 781–791, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  31. C. Roucairol, A Parallel Branch and Bound Algorithm for the Quadratic Assignment Problem, Discrete Applied Mathematics 18, pp. 211–225, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  32. Q. Zhao, S.E. Karisch, F. Rendl, and H. Wolkowicz, Semidefinite Programming Relaxations for the Quadratic Assignment Problem, Report 96/32, Comp. Science Department, University of Copenhagen, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Modelling, Technical University of Denmark, Bld. 321, DK2800, Lyngby, Denmark

    Jens Clausen

Authors
  1. Jens Clausen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Center for Applied Optimization Industrial and Systems Engineering Department, University of Florida, Gainesville, FL, 32611, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media New York

About this chapter

Cite this chapter

Clausen, J. (1999). Pushing the Limits of Solvable QAP Problems Using Parallel Processing - Is Nugent30 within Reach?. In: Pardalos, P.M. (eds) Parallel Processing of Discrete Problems. The IMA Volumes in Mathematics and its Applications, vol 106. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1492-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-1492-2_3

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-7165-9

  • Online ISBN: 978-1-4612-1492-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation