Abstract
We are reporting our experiences with five algorithms, all of them based on simulated annealing, to solve the quadratic assignment problem. This combinatorial problem seeks to assign “n” facilities to “n” locations so that the total flow will be minimized. This problem has many practical applications.
The five algorithms are the combination of different known strategies to design simulated annealing algorithms. These strategies are mainly related to procedures for neighbor generations and for cooling processes.
Extensive numerical experiments have been performed with three well-known examples where n = 15, 20, and 30, respectively. Our results show that simulated annealing is an efficient and reliable heuristic method to solve the quadratic assignment problem. All the five algorithms gave satisfactory results within 3% of the global optimum, but some design strategies are better than others.
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
Burkard, R.E., Quadratic Assignment Problems, European Journal of Operational Research 15, 1984, pp. 283–289.
Nuget, C.E., Vollman, R.F., and Ruml, J., An Experimental Comparison of Techniques for the Assignment of Facilities to Locations, Operations Research, 16, 1968, pp. 150–173.
Reeves, C.R., An Improved Heuristic for the Quadratic Assignment Problem, Journal of the Operational Research Society 36, 1985, pp. 163–167.
Burkard, R.E., and Rendl, F., A Thermodynamically Motivated Simulation Procedure for Combinatorial Optimization Problems, European Journal of Operational Research 17, 1984, pp. 169–174.
Wilhelm, M.R., and Ward, T.L., Solving Quadratic Assignment Problems by Simulated Annealing, IIEE Transactions 1987, pp. 107–119.
Connolly, D.T., An Improved Annealing Scheme for QAP, European Journal of Operational Research 46, 1990, pp. 93–100.
Lundy, M. and Mees, A., Convergence of an Annealing Algorithm, Mathematical Programming, 34, 1986, pp. 111–124.
Van Laarhovén, P.J.M., Theoretical and Computational Aspects of Simulated Annealing, Center for Mathematics and Computer Science, 1980, Amsterdam.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Andersen, K., Vidal, R.V.V. (1993). Solving the Quadratic Assignment Problem. In: Vidal, R.V.V. (eds) Applied Simulated Annealing. Lecture Notes in Economics and Mathematical Systems, vol 396. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46787-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-46787-5_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56229-0
Online ISBN: 978-3-642-46787-5
eBook Packages: Springer Book Archive