Skip to main content

Advertisement

SpringerLink
Log in

A Hybrid Metaheuristic for the Quadratic Assignment Problem

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

The quadratic assignment problem (QAP) is known to be NP-hard. We propose a hybrid metaheuristic called ANGEL to solve QAP. ANGEL combines the ant colony optimization (ACO), the genetic algorithm (GA) and a local search method (LS). There are two major phases in ANGEL, namely ACO phase and GA phase. Instead of starting from a population that consists of randomly generated chromosomes, GA has an initial population constructed by ACO in order to provide a good start. Pheromone acts as a feedback mechanism from GA phase to ACO phase. When GA phase reaches the termination criterion, control is transferred back to ACO phase. Then ACO utilizes pheromone updated by GA phase to explore solution space and produces a promising population for the next run of GA phase. The local search method is applied to improve the solutions obtained by ACO and GA. We also propose a new concept called the eugenic strategy intended to guide the genetic algorithm to evolve toward a better direction. We report the results of a comprehensive testing of ANGEL in solving QAP. Over a hundred instances of QAP benchmarks were tested and the results show that ANGEL is able to obtain the optimal solution with a high success rate of 90%.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E.H.L. Aarts and H.P. Stehouwer, “Neural networks and the traveling salesman problem,” in Proc. Int. Conf. on Artificial Neural Networks, Springer-Verlag, 1993, pp. 950–955.,

  2. R.K. Ahuja, J.B. Orlin, and A. Tiwari, “A greedy genetic algorithm for the quadratic assignment problem,” Computers & Operations Research, vol. 27, pp. 917–934, 2000.,

    Article  MathSciNet  MATH  Google Scholar 

  3. E. Angel and V. Zissimopoulos, “On the landscape ruggedness of the quadratic assignment problem,” Theoretical Computer Science, vol. 263, pp. 159–172, 2001.,

    Article  MathSciNet  MATH  Google Scholar 

  4. R. Battiti and G. Tecchiolli, “The reactive tabu search,” ORSA Journal on Computing, vol. 6, pp. 126–140, 1994.,

    MATH  Google Scholar 

  5. J.L. Bentley, “Fast algorithms for geometric traveling salesman problem,” ORSA Journal on Computing, vol. 4, pp. 397–411, 1992.,

    MathSciNet  Google Scholar 

  6. R.E. Burkard and U. Derigs, “Assignment and matching problems: solution methods with FORTRAN programs,” Lecture Notes in Economics and Mathematical Systems, Springer-Verlag: Berlin, 1980.,

    Google Scholar 

  7. R.E. Burkard, S.E. Karisch, and F. Rendl, “QAPLIB-A quadratic assignment problem library, Journal of Global Optimization,” vol. 10, pp. 391–403, 1997. [URL: http://fmatbhp1.tu-graz.ac.at/~karisch/qaplib/],

  8. R.E. Burkard and J. Offermann, “Entwurf von schreibmaschinentastaturen mittels quadratischer zuordnungsprobleme,” Zeitschrift für Operations Research, vol. 21, pp. B121–B132, 1977.,

    Article  Google Scholar 

  9. J. Chakrapani and J. Skorin-Kapov, “A connectionist approach to the quadratic assignment problem,” Computers & Operations Reasearch, vol. 19, nos. 3/4, pp. 287–295, 1992.,

    Article  MATH  Google Scholar 

  10. D.T. Connolly, “An improved annealing scheme for the qap,” European Journal of Operational Research, vol. 46, pp. 93–100, 1990.,

    Article  MATH  MathSciNet  Google Scholar 

  11. M. Dorigo, “Optimization, learning and natural algorithms,” Doctoral dissertation, Dipartimento di Elettronica, Politecnico di Milano, IT, 1992.,

  12. M. Dorigo, V. Maniezzo, and A. Colorni, “Positive feedback as a search strategy,” Tech. Report pp. 91-016, Dipartimento di Elettronica e Informazione, Politecnico di Milano, IT, 1991.,

  13. M. Dorigo, V. Maniezzo, and A. Colorni, “The ant system: Optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics-Part B, vol. 26, pp. 29–41, 1996.,

    Article  Google Scholar 

  14. C. Fleurent and J. Ferland, “Genetic hybrids for the quadratic assignment problems,” in Quadratic Assignment and Related Problems, P.M. Pardalos and H. Wolkowicz (Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16, AMS: Providence, Rhode Island, 1994, pp. 190–206.,

    Google Scholar 

  15. L.M. Gambardella, É.D. Taillard, and M. Dorigo, “Ant colonies for the quadratic assignment problem,” Journal of the Operational Research Society, vol. 50, pp. 167–176, 1999.,

    MATH  Google Scholar 

  16. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-Completeness. Freeman: San Francisco, 1979.,

    MATH  Google Scholar 

  17. A.M. Geoffrion and G.W. Graves, “Scheduling parallel production lines with changeover costs: Practical application of a quadratic assignment/LP approach,” Operations Research, vol. 24, pp. 595–610, 1976.,

    MATH  Google Scholar 

  18. D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon, “Optimization by simulated annealing: an experimental evaluation, part I (graph partitioning),” Operations Research, vol. 37, pp. 865–892, 1989.,

    Article  MATH  Google Scholar 

  19. T.C. Koopmans and M.J. Beckmann, “Assignment problems and the location of economic activities,” Econometrica, vol. 25, pp. 53–76, 1957.,

    MathSciNet  MATH  Google Scholar 

  20. J. Krarup and P.M. Pruzan, “Computer-aided layout design,” Mathematical Programming Study, vol. 9, pp. 75–94, 1978.,

    MathSciNet  Google Scholar 

  21. P.S. Laursen, “Simulated annealing for the QAP-Optimal tradeoff between simulation time and solution quality,” European Journal of Operational Research, vol. 69, pp. 238–243, 1993.,

    Article  Google Scholar 

  22. Y. Li, P.M. Pardalos, and M.G.C. Resende, “A greedy randomized adaptive search procedure for the quadratic assignment problem,” in Quadratic Assignment and Related Problems, P.M. Pardalos and H. Wolkowicz (Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 16, AMS: Providence, Rhode Island, 1994, pp. 173–187.,

    Google Scholar 

  23. M.H. Lim, Y. Yuan, and S. Omatu, “Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem,” Computational Optimization and Applications, vol. 15, no. 3, pp. 249–268, 2000.,

    Article  MathSciNet  MATH  Google Scholar 

  24. M.H. Lim, Y. Yuan, and S. Omatu, “Extensive testing of a hybrid genetic algorithm for solving quadratic assignment problems,” Computational Optimization and Applications, vol. 23, no. 1, pp. 47–64, 2002.,

    Article  MathSciNet  MATH  Google Scholar 

  25. V. Maniezzo and A. Colorni, “The ant system applied to the quadratic assignment problem,” IEEE Transactions on Knowledge and Data Engineering, vol. 11, no. 5, pp. 769–778, 1999.,

    Article  Google Scholar 

  26. P. Merz and B. Freisleben, “A genetic local search approach to the quadratic assignment problem,” in Proc. of the 7th International Conference of Genetic Algorithms, Morgan Kauffman Publishers, 1997, pp. 465–472.,

  27. P. Merz and B. Freisleben, “Fitness landscape analysis and memetic algorithms for the quadratic assignment problem,” IEEE Transactions on Evolutionary Computation, vol. 4, no. 4, pp. 337–352, 2000.,

    Article  Google Scholar 

  28. A. Misevicius, “Genetic algorithm hybridized with ruin and recreate procedure: Application to the quadratic assignment problem,” Knowledge-Based Systems, vol. 16, pp. 261–268, 2003.,

    Article  Google Scholar 

  29. L.S. Pitsoulis, P.M. Pardalos, and D.W. Hearn, “Approximate solutions to the turbine balancing problem,” European Journal of Operational Research, vol. 130, pp. 147–155, 2001.,

    Article  MATH  Google Scholar 

  30. M. Rijal, Scheduling, design and assignment problems with quadratic costs, PhD thesis, New York University, New York, USA, 1995.,

  31. D.F. Rossin, M.C. Springer, and B.D. Klein, “New complexity measures for the facility layout problem: An empirical study using traditional and neural network analysis,” Computers & Industrial Engineering, vol. 36, pp. 585–602, 1999.,

    Article  Google Scholar 

  32. J. Skorin-Kapov, “Extensions of a tabu search adaptation to the quadratic assignment problem,” Computers & Operations Research, vol. 21, no. 8, pp. 855–865, 1994.,

    Article  MATH  MathSciNet  Google Scholar 

  33. T. Starkweather, D. Whitley, C. Whitley, K. Mathial, “A comparison of genetic sequencing operators,” in Proc. Fourth Int. Conf. On Genetic Algorithms, Morgan Kaufmann, 1991, pp. 69–76.,

  34. L. Steinberg, “The backboard wiring problem: A placement algorithm,” SIAM Review, vol. 3, pp. 37–50, 1961.,

    Article  MATH  MathSciNet  Google Scholar 

  35. T. Stützle, “MAX-MIN Ant system for the quadratic assignment problems,” Technical Report AIDA-97-04, FG Intellektik, FB Informatik, TU Darmstadt, march 1997.,

  36. T. Stützle, “Iterated local search for the quadratic assignment problem,” Technical Report AIDA-99-03, FG Intellektik, FB Informatik, TU Darmstadt, March 1999.,

  37. T. Stützle and M. Dorigo, “ACO Algorithms for the quadratic assignment problem,” in New Ideas in Optimization, D. Corne, M. Dorigo and F. Glove (Eds.), McGraw-Hill, 1999.,

  38. E.D. Taillard “Robust taboo search for the quadratic assignment problem,” Parallel Computing, vol. 17, pp. 443–455, 1991.,

    Article  MathSciNet  Google Scholar 

  39. E.D. Taillard, “Comparison of iterative searches for the quadratic assignment problem,” Location Science, vol. 3, pp. 87–105, 1995.,

    Article  MATH  Google Scholar 

  40. E.-G. Talbi, Z. Hafidi and J.-M. Geib, “Parallel adaptive tabu search for large optimization problems,” in Second Metaheuristics International Conference, MIC'97, Sophia-Antipolis, France, 1997, pp. 137–142.,

  41. E.-G. Talbi, O. Roux, C. Fonlupt, and D. Robillard, “Parallel ant colonies for the quadratic assignment problem,” Future Generation Computer Systems, vol. 17, pp. 441–449, 2001.,

    Article  MATH  Google Scholar 

  42. D.M. Tate and A.E. Smith, “A genetic approach to the quadratic assignment problem,” Computers and Operations Research, vol. 22, no. 1, pp. 73–83, 1995.,

    Article  MATH  Google Scholar 

  43. All tables in this paper are posted at http://www.math.ufl.edu/~coap.,

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, National Chung Hsing University, Taichung, Taiwan, 402, R.O.C.

    Lin-Yu Tseng

  2. Department of Applied Mathematics, National Chung Hsing University, Taichung, Taiwan, 402, R.O.C.

    Shyi-Ching Liang

Authors
  1. Lin-Yu Tseng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shyi-Ching Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lin-Yu Tseng.

Additional information

This work was supported in part by the National Science Council, R.O.C., under Contract NSC 91-2213-E-005-017.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tseng, LY., Liang, SC. A Hybrid Metaheuristic for the Quadratic Assignment Problem. Comput Optim Applic 34, 85–113 (2006). https://doi.org/10.1007/s10589-005-3069-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-005-3069-9

Keywords

Search

Navigation