An improved hybrid optimization algorithm for the quadratic assignment problem;Patobulintas hibridinis optimizavimo algoritmas kvadratinio paskirstymo uždaviniui

Mathematical Modelling and Analysis

Volumn 9, Issue 2, 2004, Pages 149-168

  Misevicius A ^a  

^a KAUNAS UNIVERSITY OF TECHNOLOGY   (Lithuania)

Author keywords

Hybrid optimization; Quadratic assignment problem; Simulated annealing; Simulation; Tabu search

Indexed keywords

HEURISTIC ALGORITHMS; HEURISTIC METHODS; SIMULATED ANNEALING; TABU SEARCH;

COMBINATORIAL OPTIMIZATION PROBLEMS; EXTENDED VERSIONS; HYBRID HEURISTICS; HYBRID OPTIMIZATION; HYBRID OPTIMIZATION ALGORITHM; IMPORTANT FEATURES; QUADRATIC ASSIGNMENT PROBLEMS; SIMULATION;

COMBINATORIAL OPTIMIZATION;

EID: 33749554535     PISSN: 13926292     EISSN: 16483510     Source Type: Journal    
DOI: 10.1080/13926292.2004.9637249     Document Type: Article

References (45)

1. E. H. L. Aarts and J. H. M. Korst. Simulated Annealing and Boltzmann Machines. Wiley, Chichester, 1989.
2. E. H. L. Aarts, J. H. M. Korst and PJ. M. van Laarhoven. Simulated annealing. In: E. Aarts and J. K. Lenstra(Eds.), Local Search in Combinatorial Optimization, Wiley, Chichester, 91-120, 1997.
3. S. Amin. Simulated jumping. Annals of Operations Research, 86, 23-38, 1999.
4. G. C. Armour and E. S. Buffa. A heuristic algorithm and simulation approach to relative location of facilities. Management Science, 9, 294-304, 1963.
5. R. Battiti and G. Tecchiolli. The reactive tabu search. ORSA Journal on Computing, 6, 126-140, 1994.
6. A. Boelte and U. W. Thonemann. Optimizing simulated annealing schedules with genetic programming. European Journal of Operational Research, 92, 402-416, 1996.
7. R. E. Burkard. Quadratic assignment problems. European Journal of Operational Research, 15, 283-289, 1984.
8. R. E. Burkard, E. Çela, P. M. Pardalos and L. Pitsoulis. The quadratic assignment problem. In: Handbook of Combinatorial Optimization, volume 3, Kluwer, Dordrecht, 241-337, 1998.
9. R. E. Burkard, S. Karisch and F. Rendl. QAPLIB-a quadratic assignment problem library. Journal of Global Optimization, 10, 391-403, 1997.
10. E. Çela. The Quadratic Assignment Problem: Theory and Algorithms. Kluwer, Dordrecht, 1998.
11. V. Cerný. A thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. In: Tech. Report, Comenius University, Bratislava, CSSR, 1982.
12. H. Chen and N. S. Flann. Parallel simulated annealing and genetic algorithms: a space of hybrid methods. In: Proceedings of Third Conference on Parallel Problem Solving from Nature, Berlin, Springer, Jerusalem, Israel, 428-436, 1994.
13. D. T. Connolly. An improved annealing scheme for the QAP. European Journal of Operational Research, 46, 93-100, 1990.
14. Z. Drezner. Heuristic algorithms for the solution of the quadratic assignment problem. Journal of Applied Mathematics and Decision Sciences, 6, 163-173, 2002.
15. Z. Drezner. A new genetic algorithm for the quadratic assignment problem. INFORMS Journal on Computing, 2003. (in press).
16. C. Fleurent and J. A. Ferland. Genetic hybrids for the quadratic assignment problem. In: Quadratic Assignment and Related Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 16. AMS, Providence, 173-188, 1994.
17. C. Fleurent and J. A. Ferland. Genetic and hybrid algorithms for graph coloring. Annals of Operations Research, 63, 437-461, 1996.
18. B. L. Fox. Integrating and accelerating tabu search, simulated annealing and genetic algorithms. Annals of Operations Research, 41, 47-67, 1993.
19. B. Freisleben and P. Merz. A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems. In: Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC'96), Nagoya, Japan, 616-621, 1996.
20. F. Glover. Tabu search: part I. ORSA Journal on Computing, 1, 190-206, 1989.
21. F. Glover. Tabu search: part II. ORSA Journal on Computing, 2, 4-32, 1990.
22. F. Glover and M. Laguna. Tabu search. Kluwer, Dordrecht, 1997.
23. M. Hanan and J. M. Kurtzberg. Placement techniques. In: Design Automation of Digital Systems: Theory and Techniques, volume 1. Prentice-Hall, Englewood Cliffs, 213-282, 1972.
24. P. Hansen and B. Jaumard. Algorithms for the maximum satisfiability problem. RUTCOR Search Report 43-87, Rutgers University, USA, 1987.
25. A. Hertz, E. Taillard and D. de Werra. Tabu search. In: Local Search in Combinatorial Optimization, Wiley, Chichester, 121-136, 1997.
26. T. C. Hu and E. S. Kuh (Eds.). VLSI Circuit Layout: Theory and Design. IEEE Press, New York, 1985.
27. S. Kirkpatrick, Jr. C. D. Gelatt and M. P. Vecchi. Optimization by simulated annealing, volume 220. Science, 1983.
28. PJ. M. van Laarhoven and E. H. L. Aarts. Simulated Annealing: Theory and Applications. Reidel, Dordrecht, 1987.
29. 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, 15, 249-268, 2000.
30. M. Lundy and A. Mees. Convergence of an annealing algorithm. Mathematical Programming, 34, 111-124, 1986.
31. O. Martin and S. W. Otto. Combining simulated annealing with local search heuristics. Annals of Operations Research, 63, 57-75, 1996.
32. P. Merz and B. Freisleben. Fitness landscape analysis and mimetic algorithms for the quadratic assignment problem. IEEE Transactions on Evolutionary Computation, 4, 337-352, 2000.
33. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller and E. Teller. Equation of state calculation by fast computing machines. Journal of Chemical Physics, 21, 1087-1092, 1953.
34. A. Misevicius. Combining simulated annealing and tabu search for the quadratic assignment problem. Information Technology and Control, 3(20), 37-50, 2001.
35. A. Misevičius. A new simulated annealing algorithm for the quadratic assignment problem. In: Materials of the International Conference on Production Research (ICPR-16) (Prague, Czech Republic), Prague, Czech Association of Scientific and Technical Societies, 2001.
36. I. H. Osman and N. Christofides. Capacitated clustering problem by hybrid simulated annealing and tabu search. International Transactions in Operational Research, 1, 317-336, 1994.
37. P. M. Pardalos, F. Rendl and H. Wolkowicz. The quadratic assignment problem: a survey and recent developments. In: Quadratic Assignment and Related Problems. DIMACS Series an Discrete Mathematics and Theoretical Computer Science, volume 16. AMS, Providence, 1-41, 1994.
38. S. Sahni and T. Gonzalez. p-complete approximation problems. Journal of ACM, 23, 555-565, 1976.
39. J. Skorin-Kapov. Tabu search applied to the quadratic assignment problem. ORSA Journal on Computing, 2, 33-45, 1990.
40. L. Steinberg. The backboard wiring problem: a placement algorithm. SIAM Review, 3, 37-50, 1961.
41. T. Stuetzle. Iterated local search for the quadratic assignment problem. Technical report, Darmstadt University of Technology, 1999.
42. E. Taillard. Robust taboo search for the QAP. Parallel Computing, 17, 443-455, 1991.
43. E. G. Talbi. A taxonomy of hybrid metaheuristics. Journal of Heuristics, 8, 541-564, 2002.
44. M. Wilhelm and T. Ward. Solving quadratic assignment problems by simulated annealing. IIE Transactions, 19, 107-119, 1987.
45. Q. Zeng and K. C. Mouskos. Heuristic search strategies to solve transportation network design problem. Tech. Report, New Jersey Dept. of Transportation and the National Center for Transportation and Industrial Productivity, USA, 1997.