A hybrid metaheuristic for the quadratic assignment problem

Computational Optimization and Applications

Volumn 34, Issue 1, 2006, Pages 85-113

  Tseng, Lin Yu ^a   Liang, Shyi Ching ^a  

^a NATIONAL CHUNG HSING UNIVERSITY   (Taiwan)

Author keywords

Ant colony optimization; Genetic algorithm; Local search; Quadratic assignment problem

Indexed keywords

CHROMOSOMES; GENETIC ALGORITHMS; HEURISTIC METHODS; HYBRID COMPUTERS; OPTIMAL SYSTEMS;

ANT COLONY OPTIMIZATION; GENETIC ALGORITHM; LOCAL SEARCH; QUADRATIC ASSIGNMENT PROBLEM;

QUADRATIC PROGRAMMING;

EID: 33646692921     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-005-3069-9     Document Type: Article

References (43)

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.
3. E. Angel and V. Zissimopoulos, "On the landscape ruggedness of the quadratic assignment problem," Theoretical Computer Science, vol. 263, pp. 159-172, 2001.
4. R. Battiti and G. Tecchiolli, "The reactive tabu search," ORSA Journal on Computing, vol. 6, pp. 126-140, 1994.
5. J.L. Bentley, "Fast algorithms for geometric traveling salesman problem," ORSA Journal on Computing, vol. 4, pp. 397-411, 1992.
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.
7. R.E. Burkard, S.E. Karisch, and F. Rendl, "QAPLIB-A quadratic assignment problem library, Journal of Global Optimization," vol. 10,pp. 39-403, 1997. [URL: http://fmatbhp1.tu-graz.ac.at/~karisch/qaplib/]
8. R.E. Burkard and J. Offermann, "Entwurf von schreibmaschinentastaturen mittels quadratischer zuord-nungsprobleme," Zeitschrift für Operations Research, vol. 21, pp. B121-B132, 1977.
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.
10. D.T. Connolly, "An improved annealing scheme for the qap," European Journal of Operational Research, vol. 46, pp. 93-100, 1990.
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.
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.
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.
16. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-Completeness. Freeman: San Francisco, 1979.
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.
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.
19. T.C. Koopmans and M.J. Beckmann, "Assignment problems and the location of economic activities," Economerrica, vol. 25, pp. 53-76, 1957.
20. J. Krarup and P.M. Pruzan, "Computer-aided layout design," Mathematical Programming Study, vol. 9, pp. 75-94, 1978.
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.
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.
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.
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.
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.
26. P. Merz and B. Freisieben, "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. Freisieben, "Fitness landscape analysis and memetic algorithms for the quadratic assignment problem," IEEE Transactions on Evolutionary Computation, vol. 4, no. 4, pp. 337-352, 2000.
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.
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.
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.
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.
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.
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üitzle 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.
39. E.D. Taillard, "Comparison of iterative searches for the quadratic assignment problem," Location Science, vol. 3, pp. 87-105, 1995.
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-149, 2001.
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.
43. All tables in this paper are posted at http://www.math.ufl.edu/~coap.