Abstract
The quadratic assignment problem arises in a variety of practical settings. It is known to be among the hardest combinatorial problems for exact algorithms. Therefore, a large number of heuristic approaches have been proposed for its solution. In this article we introduce a new, large set of QAP instances that is intended to allow the systematic study of the performance of metaheuristics in dependence of QAP instance characteristics. Additionally, we give computational results with several high performing algorithms known from literature and give exemplary results on the influence of instance characteristics on the performance of these algorithms.
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
Anstreicher, K.M., Brixius, N.W., Goux, J.-P., Linderoth, J.: Solving large quadratic assignment problems on computational grids. Mathematical Programming 91(3), 563–588 (2002)
Battiti, R., Tecchiolli, G.: The reactive tabu search. ORSA Journal on Computing 6(2), 126–140 (1994)
Brixius, N.W., Anstreicher, K.M.: The Steinberg wiring problem. Technical report, College of Business Administration, University of Iowa, Iowa City, USA (October 2001)
Burkard, R.E., Cȩla, E., Pardalos, P.M., Pitsoulis, L.S.: The quadratic assignment problem. In: Pardalos, P.M., Du, D.-Z. (eds.) Handbook of Combinatorial Optimization, vol. 2, pp. 241–338. Kluwer Academic Publishers, Dordrecht (1998)
Cȩla, E.: The Quadratic Assignment Problem: Theory and Algorithms. Kluwer Academic Publishers, Dordrecht (1998)
Connolly, D.T.: An improved annealing scheme for the QAP. European Journal of Operational Research 46(1), 93–100 (1990)
Cung, V.-D., Mautor, T., Michelon, P., Tavares, A.: A scatter search based approach for the quadratic assignment problem. In: Baeck, T., Michalewicz, Z., Yao, X. (eds.) Proceedings of the 1997 IEEE International Conference on Evolutionary Computation (ICEC 1997), pp. 165–170. IEEE Press, Piscataway (1997)
Drezner, Z.: A new genetic algorithm for the quadratic assignment problem. INFORMS Journal on Computing 15(3), 320–330 (2003)
Drezner, Z., Hahn, P., Taillard, É.D.: A study of quadratic assignment problem instances that are difficult for meta-heuristic methods. Annals of Operations Research (to appear)
Fleurent, C., Ferland, J.A.: Genetic hybrids for the quadratic assignment problem. In: Pardalos, P.M., Wolkowicz, H. (eds.) Quadratic Assignment and Related Problems. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 16, pp. 173–187. American Mathematical Society, Providence (1994)
Gambardella, L.M., Taillard, É.D., Dorigo, M.: Ant colonies for the quadratic assignment problem. Journal of the Operational Research Society 50(2), 167–176 (1999)
Hahn, P.: QAPLIB - a quadratic assignment problem library (2003), http://www.seas.upenn.edu/qaplib/ Version visited last on (September 15, 2003)
Hahn, P.M., Hightower, W.L., Johnson, T.A., Guignard-Spielberg, M., Roucairol, C.: Tree elaboration strategies in branch and bound algorithms for solving the quadratic assignment problem. Yugoslavian Journal of Operational Research 11(1), 41–60 (2001)
Li, Y., Pardalos, P.M., Resende, M.G.C.: A greedy randomized adaptive search procedure for the quadratic assignment problem. In: Pardalos, P.M., Wolkowicz, H. (eds.) Quadratic Assignment and Related Problems. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 16, pp. 237–261. American Mathematical Society, Providence (1994)
Maniezzo, V.: Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS Journal on Computing 11(4), 358–369 (1999)
Merz, P., Freisleben, B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Transactions on Evolutionary Computation 4(4), 337–352 (2000)
Sahni, S., Gonzalez, T.: P-complete approximation problems. Journal of the ACM 23(3), 555–565 (1976)
Skorin-Kapov, J.: Tabu search applied to the quadratic assignment problem. ORSA Journal on Computing 2(1), 33–45 (1990)
Stützle, T.: Iterated local search for the quadratic assignment problem. Technical Report AIDA-99-03, FG Intellektik, FB Informatik, TU Darmstadt (1999)
Stützle, T., Dorigo, M.: ACO algorithms for the quadratic assignment problem. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 33–50. McGraw Hill, London (1999)
Stützle, T., Hoos, H.H.: MAX–MIN Ant System. Future Generation Computer Systems 16(8), 889–914 (2000)
Taillard, É.D.: Robust taboo search for the quadratic assignment problem. Parallel Computing 17(4–5), 443–455 (1991)
Taillard, É.D.: Comparison of iterative searches for the quadratic assignment problem. Location Science 3(2), 87–105 (1995)
Taillard, É.D.: FANT: Fast ant system. Technical Report IDSIA-46-98, IDSIA, Lugano, Swiss (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stützle, T., Fernandes, S. (2004). New Benchmark Instances for the QAP and the Experimental Analysis of Algorithms. In: Gottlieb, J., Raidl, G.R. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2004. Lecture Notes in Computer Science, vol 3004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24652-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-24652-7_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21367-3
Online ISBN: 978-3-540-24652-7
eBook Packages: Springer Book Archive