Abstract
In this paper, we study a branch and bound algorithm for the quadratic assignment problem (QAP) that uses a lower bound based on the linear programming (LP) relaxation of a classical integer programming formulation of the QAP. We report on computational experience with the branch and bound algorithm on all QAP test problems of dimension n ≤ 15 of QAPLIB, a standard library of QAP test problems. The linear programming relaxations are solved with an implementation of an interior point algorithm that uses a preconditioned conjugate gradient algorithm to compute directions. The branch and bound algorithm is compared with a similar branch and bound algorithm that uses the Gilmore-Lawler lower bound (GLB) instead of the LP-based bound. The LP-based algorithm examines a small portion of the nodes explored by the GLB-based algorithm. Extensions to the implementation are discussed.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S.H. Bokhari . Assignment problems in parallel and distributed computing. The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers, Boston/Dordrecht/Lancaster, 1987.
Brian Borchers and John E. Mitchell. Using an interior point method in a branch and bound algorithm for integer programming. Technical report, Rensselaer Polytechnic Institute, July 1992.
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.
R.E. Burkard, S. Karisch, and F. Rendí. QAPLIB — A quadratic assignment problem library. European Journal of Operational Research, 55:115–119,1991. Updated version — Feb. 1994.
R.E. Burkard find F. Rendl. A thermodynamically motivated simulation procedure for com-binatorial optimization problems. European Journal of Operational Research, 17: 169–174, 1984.
J. Clausen . Announcement on Discrete Mathematics and Algorithms Network ( DIMANET ), Feb. 1994.
Z. Drezner. Lower bounds based on linear programming for the quadratic assignment problem. Technical report, Dept. of Management Science, California State University, Fullerton, CA 92634, 1994. To appear in Computational Optimization & Applications.
C.S. Edwards. A branch and bound algorithm for the Koopmans-Beckman quadratic assign-ment problem. Mathematical Programming Study, 13: 35–52, 1980.
C. Fleurent and J.A. Ferland. Genetic hybrids for the quadratic assignment problem. In P.M. Pardalos and H. Wolkowicz, editors, Quadratic assignment and related problems, volume 16 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 173–187. American Mathematical Society, 1994.
R. Fourer, D.M. Gay, and B.W. Kernighan. AMPL — A modeling language for mathematical programming. The Scientific Press, South San Francisco, CA, 1993.
R.L. Francis and J.A. White. Facility layout and location. Prentice-Hall, Englewood Cliffs, N.J., 1974.
P.C. Gilmore. Optimal and suboptimal algorithms for the quadratic assignment problem. J. SI AM, 10: 305–313, 1962.
L.J. Hubert . Assignment methods in combinatorial data analysis. Marcel Dekker, Inc., New York, NY 10016, 1987.
T. Ibaraki. Theoretical comparisons of search strategies in branch-and-bound algorithms. International Journal of Computer and Information Sciences, 5 (4): 315–344, 1976.
N.K. Karmarkar and K.G. Ramakrishnan. Computational results of an interior point algorithm for large scale linear programming. Mathematical Programming, 52: 555–586, 1991.
T.C. Koopmans and M.J. Beckmann. Assignment problems and the location of economic activities. Econometrica, 25: 53–76, 1957.
J. Krarup and P.M. Pruzan. Computer-aided layout design. Mathematical Programming Study, 9: 75–94, 1978.
E.L. Lawler. The quadratic assignment problem. Management Science, 9: 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: 387–410, 1994.
Y. Li, P.M. Pardalos, and M.G.C. Resende. A greedy randomized adaptive search procedure for the quadratic assignment problem. In P.M. Pardalos and H. Wolkowicz, editors, Quadratic assignment and related problems, volume 16 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 237–261. American Mathematical Society, 1994.
T. Mautor and C. Roucairol. Difficulties of exact methods for solving the quadratic assignment problem. In P.M. Pardalos and H. Wolkowicz, editors, Quadratic assignment and related problems, volume 16 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 263–274. American Mathematical Society, 1994.
T. Mautor and C. Roucairol. A new exact algorithm for the solution of quadratic assignment problems. Discrete Applied Mathematics, 1994. To appear.
H. Mawengkang and B.A. Murtagh. Solving nonlinear integer programs with large-scale optimization software. Annals of Operations Research, 5:425–437, 1985/6.
E.J. McCormik. Human factors engineering. McGraw-Hill, New York, 1970.
John E. Mitchell . Interior point algorithms for integer programming. Technical report, Rensselaer Polytechnic Institute, June 1994. To appear in Advances in linear and integer programming, Oxford University Press, 1995.
B.A. Murtagh, T.R. Jefferson, and V. Sornprasit. A heuristic procedure for solving the quadratic assignment problem. European Journal of Operational Research, 9: 71–76, 1982.
P.M. Pardalos and J. Crouse. A parallel algorithm for the quadratic assignment problem. In Proceedings of the Supercomputing 1989 Conference, pages 351–360. ACM Press, 1989.
P.M. Pardalos, K.G. Ramakrishnan, M.G.C. Resende, and Y. Li. Implementation of a variance reduction based lower bound in a branch and bound algorithm for the quadratic assignment problem. Technical report, AT & T Bell Laboratories, Murray Hill, NJ 07974, 1994.
P.M. Pardalos and H. Wolkowicz, editors. Quadratic assignment and related problems, volume 16 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1994.
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, To appear.
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, To appear.
C. Roucairol. A parallel branch and bound algorithm for the quadratic assignment problem. Discrete Applied Mathematics, 18: 211–225, 1987.
J. Skorin-Kapov. Tabu search applied to the quadratic assignment problem. ORSA Journal on Computing, 2 (l): 33–45, 1990.
E. Taillard. Robust tabu search for the quadratic assignment problem. Parallel Computing, 17: 443–455, 1991.
Thonemann, U.W. and Bolte, A.M. An improved simulated annealing algorithm for the quadratic assignment problem. Technical report, School of Business, Dept. of Production and Operations Research, University of Paderborn, Germany, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Ramakrishnan, K.G., Resende, M.G.C., Pardalos, P.M. (1996). A Branch and Bound Algorithm for the Quadratic Assignment Problem using a Lower Bound Based on Linear Programming. In: Floudas, C.A., Pardalos, P.M. (eds) State of the Art in Global Optimization. Nonconvex Optimization and Its Applications, vol 7. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3437-8_5
Download citation
DOI: https://doi.org/10.1007/978-1-4613-3437-8_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-3439-2
Online ISBN: 978-1-4613-3437-8
eBook Packages: Springer Book Archive