Advertisement

Annals of Operations Research

, Volume 139, Issue 1, pp 65–94 | Cite as

Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods

  • Zvi Drezner
  • Peter M. Hahn
  • Éeric D. Taillard
Article

Abstract

This paper reports heuristic and exact solution advances for the Quadratic Assignment Problem (QAP).QAPinstances most often discussed in the literature are relatively well solved by heuristic approaches. Indeed, solutions at a fraction of one percent from the best known solution values are rapidly found by most heuristic methods. Exact methods are not able to prove optimality for these instances as soon as the problem size approaches 30 to 40. This article presents new QAP instances that are ill conditioned for many metaheuristic-based methods. However, these new instances are shown to be solved relatively well by some exact methods, since problem instances up to a size of 75 have been exactly solved.

Keywords

quadratic assignment problem local search branch & bound benchmarks 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adams, W. et al. (2003). “A Lower Bound for the Quadratic Assignment Problem Based on a Level-2 Reformulation-Linearization Technique.” OPIM Department Report No. 03-05-06, The Wharton School, University of Pennsylvania.Google Scholar
  2. Adams, W. and H. Sherali. (1986). “A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems.” Management Science, 32(10), 1274–1290.Google Scholar
  3. Adams, W. and H. Sherali. (1990). “Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems.” Operations Research 38, 217–226.Google Scholar
  4. Ahuja, R.K., J.B. Orlin, and A. Tiwari. (2000). “A Descent Genetic Algorithm for the Quadratic Assignment Problem.” Computers and Operations Research 27, 917–934.CrossRefGoogle Scholar
  5. Angel, E. and V. Zissimopoulos. (2001). “On the Landscape Ruggedness of the Quadratic Assignment Problem.” Theoretical Computer Science 263, 159–172.CrossRefGoogle Scholar
  6. Anstreicher, K. and N.W. Brixius. (2001a). “A New Bound for the Quadratic Assignment Problem Based on Convex Quadratic Programming.” Mathematical Programming 89, 341–357.CrossRefGoogle Scholar
  7. Anstreicher, K. and N.W. Brixius. (2001b). “Solving Quadratic Assignment Problems Using Convex Quadratic Programming Relaxations.” Optimization Methods and Software 16, 49–68.Google Scholar
  8. Anstreicher, K. et al. (2002). “Solving Large Quadratic Assignment Problems on Computational Grids.” Mathematical Programming 91, 563–588.CrossRefGoogle Scholar
  9. Anstreicher, K. and H. Wolkowicz. (1998). “On Legrangian Relaxation of Quadratic Matrix Constraints.” Research Report CORR 98-24. Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada.Google Scholar
  10. Battiti, R. and G. Tecchiolli. (1994a). “The Reactive Tabu Search.” ORSA Journal on Computing 6, 126–140.Google Scholar
  11. Battiti, R. and G. Tecchiolli. (1994b). “Simulated Annealing and Tabu Search in the Long Run: A Comparison on QAP Tasks.” Computers and Mathematics with Applications 28, 1–8.CrossRefGoogle Scholar
  12. Burkard, R. (1975). “Numerische Erfahungen Mit Summen-Und Bottleneck-Zuordnungsproblemen.” In L. Collatz and H. Werner (eds.), Numerische Methoden Bei Graphentheoretischen und Kombinatorischen Problemen. Basel: Birkhauser Verlag.Google Scholar
  13. Burkard, R. et al. (1997). “QAPLIB—A Quadratic Assignment Problem Library.” Journal of Global Optimization 10, 391–403, electronic update: http://www.seas.upenn.edu/qaplib/ (revised 02.04.2003).
  14. Burkard, R. and U. Derigs. (1980). “Assignment and Matching Problems.” Solution Methods with FORTRAN Programs. New York: Springer-Verlag.Google Scholar
  15. Burkard, R. and F. Rendl. (1984). “A Thermodynamically Motivated Simulation Procedure for Combinatorial Optimization Problems.” European Journal of Operational Research 17, 169–174.CrossRefGoogle Scholar
  16. Burkard, R. and K.H. Stratmann. (1978). “Numerical Investigations on Quadratic Assignment Problems.” Naval Research Logistical Quarterly 25, 129–148.Google Scholar
  17. Clausen, J. and M. Perregaard. (1997). “Solving Large Quadratic Assignment Problems in Parallel.” Computational Optimization and Applications 8, 111–128.CrossRefGoogle Scholar
  18. Colorni, A., M. Dorigo and V. Maniezzo. (1992). “Distributed Optimization by Ant Colonies.” In F.J. Varela and P. Bourgine (eds.) Proceedings of ECAL'91—European Conference on Artificial Life, MIT Press, Cambridge MA, 134–142.Google Scholar
  19. Connolly, D.T. (1990). “An Improved Annealing Scheme for the QAP.” European Journal of Operational Research 46, 93–100.CrossRefGoogle Scholar
  20. Conover, W.J. (1999). Practical Nonparametric Statistics (3rd Ed.). New York: Wiley Publishing Company.Google Scholar
  21. Cung, Van Dat et al. (1997). “A Scatter Search Based Approach for the Quadratic Assignment Problem.” In Proceedings of the IEEE International Conference on Evolutionary Computation and Evolutionary Programming (ICEC'97), Indianapolis, pp. 165–170.Google Scholar
  22. Cung, Van Dat and S. Donadio. (2002). “Résultat du Scatter Search en Version Séquentielle et en Version Parallèle sur les Problèmes Dre30 et Tai27e01.” Technical Report of OPALE Laboratory, France: Université de Versailles.Google Scholar
  23. Dorigo, M. and L.M. Gambardella. (1997). “Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem.” IEEE Transanctions on Evolutionary Computation 1, 53–66.CrossRefGoogle Scholar
  24. Drezner, Z. (2002). “Heuristic Algorithms for the Solution of the Quadratic Assignment Problem.” Journal of Applied Mathematics and Decision Sciences 6, 163–173.Google Scholar
  25. Drezner, Z. (2003). “A New Genetic Algorithm for the Quadratic Assignment Problem.” INFORMS Journal on Computing 15, 320–330.CrossRefGoogle Scholar
  26. Drezner, Z. (2005). “Compounded Genetic Algorithms for the Quadratic Assignment Problem.” Operations Research Letters(in press).Google Scholar
  27. Elshafei, A. (1977). “Hospital lay-out as a Quadratic Assignment Problem.” Operational Research Quarterly 28, 167–179.Google Scholar
  28. Fleurent, C. and J. Ferland. (1994). “Genetic Hybrids for the Quadratic Assignment Problem.” DIMACS Series in Math. Theoretical Computer Science 16, 190–206.Google Scholar
  29. Gambardella, L.M., E. Taillard and M. Dorigo. (1999). “Ant Colonies for the Quadratic Assignment Problem.” Journal of the Operational Research Society 50, 167–176.Google Scholar
  30. Gilmore, P. (1962). “Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem.” Journal of the Society of Industrial and Applied Mathematics 10, 305–313.CrossRefGoogle Scholar
  31. Glover, F. (1977). “Heuristics for Integer Programming Using Surrogate Constraints.” Decision Sciences 8, 156–166.Google Scholar
  32. Hadley, S.W., F. Rendl, and H. Wolkowicz. (1992). “A New Lower Bound Via Projection for the Quadratic Assignment Problem.” Mathematics of Operations Research 17, 727–739.Google Scholar
  33. Hahn, P.M. (1968). “Minimization of Cost in Assignment of Codes to Data Transmission.” Ph.D. Dissertation, University of Pennsylvania, (1968). Available at: http://www.seas.upenn.edu/~hahn/
  34. Hahn, P.M. and T.L. Grant. (1998). “Lower Bounds for the Quadratic Assignment Problem Based Upon a Dual Formulation.” Operations Research 46, 912–922.Google Scholar
  35. Hahn, P.M., T.L. Grant and N. Hall. (1998). “A Branch-and-Bound Algorithm for the Quadratic Assignment Problem Based on the Hungarian Method.” European Journal of Operational Research 108, 629–640.CrossRefGoogle Scholar
  36. Hahn, P.M. et al. (2001). “Tree Elaboration Strategies in Branch-and-Bound Algorithms for Solving the Quadratic Assignment Problem.” Yugoslav Journal of Operations Research 11, 41–60.Google Scholar
  37. Hahn, P.M. and J. Krarup. (2001). “A Hospital Facility Problem Finally Solved.” The Journal of Intelligent Manufacturing 12, 487–496.CrossRefGoogle Scholar
  38. Hansen, P. and N. Mladenovic. (2001). “Variable Neighborhood Search: Principles and Applications.” European Journal of Operational Research 130, 449–467.CrossRefGoogle Scholar
  39. Koopmans, T. and M.J. Beckmann. (1957). “Assignment Problems and the Location of Economics Activities.” Econometric 25, 53–76.Google Scholar
  40. Laporte, G. and H. Mercure. (1988). “Balancing Hydraulic Turbine Runners: A Quadratic Assignment Problem.” European Journal of Operational Research 35, 378–381.CrossRefGoogle Scholar
  41. Li, Y., P.M. Pardalos, and M.G.C. Resende. (1994). “A Randomized Adaptive Search Procedure for the Quadratic Assignment Problem. In P. Pardalos and H. Wolcowicz (eds.), Quadratic Assignment and Related Problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16, 237–261.Google Scholar
  42. Misevicius, A. (2003a). “A Modified Tabu Search Algorithm for the Quadratic Assignment Problem.” (under review).Google Scholar
  43. Misevicius, A. (2005). “A Tabu Search Algorithm for the Quadratic Assignment Problem.” Computational Optimization and Applications, 30, 95–111.CrossRefGoogle Scholar
  44. Mladenovic, N. and Pierre H. (1997). “Variable Neighborhood Search.” Computers and Operations Research 24, 1097–1100.CrossRefGoogle Scholar
  45. Moscato, P. (2002). “Memetic Algorithms.” In P.M. Pardalos and M.G.C. Resende (eds.), Handbook of Applied Optimization. Oxford, U.K. Oxford University Press.Google Scholar
  46. Nugent, C., T. Vollman and J. Ruml. (1968). “An Experimental Comparison of Techniques for the Assignment of Facilities to Locations.” Operations Research 16, 150–173.CrossRefGoogle Scholar
  47. Ramachandran, B. and J.F. Pekny. (1996). “Dynamic Factorization Methods for Using Formulations Derived from Higher Order Lifting Techniques in the Solution of the Quadratic Assignment Problem.” State of the Art in Global Optimization: Computational Methods and Applications. Dordrecht, Netherlands: Kluwer Academic Publishers, pp. 75–92.Google Scholar
  48. Sahni, S. and T.F. Gonzalez. (1976). “P-Complete Approximation Problems.” Journal of the ACM 23, 555–565.CrossRefGoogle Scholar
  49. Sherali, H.D. and W.P. Adams. (1990). “A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems.” SIAM Journal on Discrete Mathematics 3, 411–430.CrossRefGoogle Scholar
  50. Sherali, H.D. and W.P. Adams. (1994). “A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-Integer Zero-One Programming Problems.” Discrete Applied Mathematics 52, 83–106.CrossRefGoogle Scholar
  51. Skorin-Kapov, J. (1990). “Tabu Search Applied to the Quadratic Assignment Problem.” ORSA Journal on Computing 2, 33–45.Google Scholar
  52. Sondergeld, L. and S. Voß. (1996). “A Star-Shaped Diversification Approach in Tabu Search.” In I. H. Osman and J. P. Kelly (eds.) Meta-Heuristics: Theory and Applications. Dordrecht, Netherlands: Kluwer Academic Publishers, pp. 489–502.Google Scholar
  53. Steinberg, Leon. (1961). “The Backboard Wiring Problem: A Placement Algorithm.” SIAM Review 3, 37–50.CrossRefGoogle Scholar
  54. Stützle, T. and H.H. Hoos. (1999). “The MAX-MIN Ant System and Local Search for Combinatorial Optimization Problems: Towards Adaptive Tools for Global Optimization.” In S. Voss, S. Martello, I.H. Osman, C. Roucairol (eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Dordrecht, Netherlands: Kluwer Academic Publishers, pp. 313–329.Google Scholar
  55. Taillard, E.D. (1991). “Robust Taboo Search for the Quadratic Assignment Problem.” Parallel Computing 17, 443–455.CrossRefGoogle Scholar
  56. Taillard, E.D. (1995). “Comparison of Iterative Searches for the Quadratic Assignment Problem.” Location Science 3, 87–105.CrossRefGoogle Scholar
  57. Taillard, E.D. (1998). “FANT: Fast Ant system.” Technical Report IDSIA-46-98, Lugano, Switzerland: Dalle Molle Institute for Artificial Intelligence.Google Scholar
  58. Taillard, E.D. (2001). “Comparison of Non-Deterministic Iterative Methods.” In Proceedings of MIC'2001–4th Metaheuristic International Conference, Porto, Portugal, pp. 272–276.Google Scholar
  59. Taillard, E.D. (2002). “Principes D'implémentation des Métaheuristiques.” In M. Pirlot and J. Teghem (eds.), Métaheuristiques et Outils Nouveaux en Recherche Opérationnelle: Méthodes. Paris, France: Hermès, pp. 55–77.Google Scholar
  60. Taillard, E.D. et al. (1998). “Programmation à mémoire adaptative.” Calculateurs Parallèles, Réseaux et Systèmes Répartis 10, 117–140.Google Scholar
  61. Taillard, E.D. et al. (2001). “Adaptive Memory Programming: A Unified View of Meta-Heuristics.” European Journal of Operational Research 135, 1–16.CrossRefGoogle Scholar
  62. Tate, David E. and Alice E. Smith. (1995). “A Genetic Approach to the Quadratic Assignment Problem.” Computers and Operations Research 22, 73–83.CrossRefGoogle Scholar

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  • Zvi Drezner
    • 1
  • Peter M. Hahn
    • 2
  • Éeric D. Taillard
    • 3
  1. 1.California State University-FullertonUSA
  2. 2.The University of Pennsylvania
  3. 3.The University of Applied Sciences of Western SwitzerlandSwitzerland

Personalised recommendations