A Modified Simulated Annealing Algorithm for the Quadratic Assignment Problem

Informatica

Volumn 14, Issue 4, 2003, Pages 497-514

  Misevičius, Alfonsas ^a  

^a KAUNAS UNIVERSITY OF TECHNOLOGY   (Lithuania)

Author keywords

Heuristics; Local search; Quadratic assignment problem; Simulated annealing

Indexed keywords

EID: 0742288849     PISSN: 08684952     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (31)

1. Aarts, E.H.L., and J.H.M, Korst (1989). Simulated Annealing and Boltzmann Machines. Wiley, Chichester.
2. Aarts, E.H.L., J.H.M. Korst and P.J.M. van Laarhoven (1997). Simulated annealing. In E.H.L. Aarts and J.K. Lenstra (Eds.), Local Search in Combinatorial Optimization. Wiley, Chichester. pp. 91-120.
3. Amin, S. (1999). Simulated jumping. Annals of Operations Research, 86, 23-38.
4. Anily, S., and A. Federgruen (1987). Simulated annealing methods with general acceptance probability. J. of Applied Probability, 24, 657-667.
5. Armour, G.C., and E.S. Buffa (1963). A heuristic algorithm and simulation approach to relative location of facilities. Management Science, 9, 294-304.
6. Bölte, A., and U.W. Thonemann (1996). Optimizing simulated annealing schedules with genetic programming. European J. of Operational Research, 92, 402-416.
7. Burkard, R.E. (1984). Quadratic assignment problems. European J. of Operational Research, 15, 283-289.
8. Burkard, R.E., S. Karisch and F. Rendl (1997). QAPLIB - a quadratic assignment problem library. J. of Global Optimization, 10, 391-403.
9. Burkard, R.E., and F. Rendl (1984). A thermodynamically motivated simulation procedure for combinatorial optimization problems. European J. of Operational Research, 17, 169-174.
10. Çela, E. (1998). The Quadratic Assignment Problem: Theory and Algorithms. Kluwer, Dordrecht.
11. Cerný, V. (1982). A thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. Tech. Report, Comenius University, Bratislava, CSSR.
12. Connolly, D.T. (1990). An improved annealing scheme for the QAP. European J. of Operational Research, 46, 93-100.
13. Hahn, P.M., W.L. Hightower, T.A. Johnson, M. Guignard-Spielberg and C. Roucairol (2001). Tree elaboration strategies in branch and bound algorithms for solving the quadratic assignment problem. Yugoslavian J. of Operational Research, 11, 41-60.
14. Hajek, B. (1988). Cooling schedules for optimal annealing. Mathematics of Operations Research, 13, 311-329.
15. Hajek, B., and G. Sasaki (1989). Simulated annealing: to cool it or not. Systems and Control Letters, 12, 443-447.
16. Hanan, M., and J.M. Kurtzberg (1972). Placement techniques. In M.A. Breuer (Ed.), Design Automation of Digital Systems: Theory and Techniques, Vol.1. Prentice-Hall, Englewood Cliffs, N.J. pp. 213-282.
17. Kirkpatrick, S., C.D. Gelatt (Jr.) and M.P. Vecchi (1983). Optimization by simulated annealing. Science, 220, 671-680.
18. Van Laarhoven, P.J.M., and E.H.L. Aarts (1987). Simulated Annealing: Theory and Applications. Reidel, Dordrecht.
19. Lundy, M., and A. Mees (1986). Convergence of an annealing algorithm. Mathematical Programming, 34, 111-124.
20. Mann, J.W., and G.D. Smith (1996). A comparison of heuristics for telecommunications traffic routing. In V.J. Rayward-Smith, J.H. Osman, C.R. Reeves and G.D. Smith (Eds.), Modern Heuristic Search Methods. Wiley, Chichester. pp. 235-254.
21. Metropolis, N., A. Rosenbluth, M. Rosenbluth, A. Teller and E. Teller (1953). Equation of state calculation by fast computing machines. J. of Chemical Physics, 21, 1087-1092.
22. Misevičius, A. (2000). An intensive search algorithm for the quadratic assignment problem. Informatica, 11, 145-162.
23. Nissen, V., and H. Paul (1995). A modification of threshold accepting and its application to the quadratic assignment problem. OR Spektrum, 17, 205-210.
24. Osman, I.H. (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 41, 421-451.
25. Sahni, S., and T. Gonzalez (1976). P-complete approximation problems. J. of ACM, 23, 555-565.
26. Seneta, E. (1981). Non-Negative Matrices and Markov Chains. Springer, New York.
27. Skorin-Kapov, J. (1990). Tabu search applied to the quadratic assignment problem. ORSA J. on Computing, 2, 33-45.
28. Steinberg, L. (1961). The backboard wiring problem: a placement algorithm. SIAM Review, 3, 37-50.
29. Taillard, E. (1991). Robust taboo search for the QAP. Parallel Computing, 17, 443-455.
30. Thonemann, U.W., and A. Bölte (1994). An improved simulated annealing algorithm for the quadratic assignment problem. Working Paper, University of Paderborn, Germany.
31. Wilhelm, M., and T. Ward (1987). Solving quadratic assignment problems by simulated annealing. IIE Trans. 19, 107-119.