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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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.
A. Brüngger, Solving hard combinatorial Optimization Problems in Parallel: Two Case Studies, Ph.D.-thesis, ETH Zürich, 1997.
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
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.
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.
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.
P. Carraresi and F. Malucelli, A new lower bounds for the quadratic assignment problem, Operations Research 40, Supplement 1:S22–S27, 1992.
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.
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.
J. Clausen and M. Perregaard, Solving large quadratic assignment problems in parallel, Computational Optimization and Applications 8, pp. 111–127, 1997.
G. Finke, R.E. Burkard, and F. Rendl, Quadratic assignment problems,Annals of Discrete Mathematics 31, pp. 61–82, 1987.
A.M. Frieze and J. Yadegar, On the Quadratic Assignment Problem,Discrete Applied Mathematics 5, pp. 89–98, 1983.
B. Gendron and T.G. Cranic, Parallel Branch-and-Bound Algorithms: Survey and Synthesis, Operations Research 42, pp. 1042–1066, 1994.
P.C. Gilmore,Optimal and suboptimal algorithms for the quadratic assignment problem,SIAM Journal on Applied Mathematics 10, pp. 305–331, 1962.
A. Grama and V. Kumar,Parallel Search Algorithms for Discrete Optimization Problems,ORSA Journal of Computing 7, pp. 365–385, 1995.
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.
P. Hahn, T. Grant, Lower bounds for the Quadratic Assignment Problem Based Upon a Dual Formulation, Manuscript 1997, to appear.
P. Hahn, T. Grant, and N. Hall, Solution of the Quadratic Assignment Problem using the Hungarian Method,European Journal of Operational Research, to appear.
J. JÁjÁ, An introduction to Parallel Algorithms, Addison-Wesley, 1992.
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.
S.E. Karisch and F. Rendl, Lower bounds for the quadratic assignment problem via triangle decompositions, Mathematical Programming 71(2), pp. 137–152, 1995.
T.C. Koopmans and M.J. Beckmann, Assignment problems and the location of economic activities, Econometrica 25, pp. 53–76, 1957.
E. Lawler, The quadratic assignment problem, Management Science 9, pp. 586–599, 1963.
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.
T. Mautor and C. Roucairol, A new exact algorithm for the solution of quadratic assignment problems, Discrete Applied Mathematics 55, pp. 281–293,1994.
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.
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.
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.
K.G. Ramakrishnan, M.C.G. Resende, B. Ramachandran, and J.F. Pekny, Tight QAP Bounds via Linear Programming, Manuscript, March 1996.
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.
C. Roucairol, A Parallel Branch and Bound Algorithm for the Quadratic Assignment Problem, Discrete Applied Mathematics 18, pp. 211–225, 1987.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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