Solving quadratic assignment problems by a tabu based simulated annealing algorithm

2007 International Conference on Intelligent and Advanced Systems, ICIAS 2007

Volumn , Issue , 2007, Pages 75-80

  Wang, Jiunn Chin ^a  

^a JINWEN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ANNEALING; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; TABU SEARCH; TRAVELING SALESMAN PROBLEM;

COMBINATORIAL OPTIMIZATION PROBLEMS; HYBRID ALGORITHMS; LOCAL OPTIMUMS; PERFORMANCE EVALUATIONS; PROBLEM INSTANCES; QUADRATIC ASSIGNMENT PROBLEMS; RESTART STRATEGIES; SIMULATED ANNEALING ALGORITHMS; TABU LISTS;

SIMULATED ANNEALING;

EID: 57949102759     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIAS.2007.4658351     Document Type: Conference Paper

References (20)

1. R. E. Burkard, S.E. Karisch and F. Rendl, "QAPLIB - A Quadratic Assignment Problem Library," http://www.seas.upenn.edu/qaplib/.
2. R. E. Burkard and F. Rendl, "A thermodynamically motivated simulation procedure for combinatorial optimization problems," European Journal Operational Research, 17, pp. 169-174, 1984.
3. M. Dorigo, V. Maniezzo, A. Colorni, "The ant system: Optimization by a colony of cooperating agents," IEEE Trans. Systems, Man, and Cybernetics - Part B 26 (2), pp. 29-41, 1996.
4. T. C. Koopmans and M. J. Beckmann, "Assignment problems and location of economic activities," Econometrica, 25, pp. 53-76, 1957.
5. R. E. Burkard, E. Çela,, P. M. Pardalos, and L. S. Pitsoulis, "The quadratic assignment problem," Technical report SFB 126, Graz University ofTechnology, Austria, 1998.
6. F. Glover, "Tabu search - part I," ORSA Journal on Computing 1(3), pp. 190-206, 1989.
7. F. Glover, "Tabu search - part II," ORSA Journal on Computing 2(1), pp. 4-32, 1990.
8. J. Krarup and P.M. Pruzan., "Computer-aided layout design," Mathematical Programming Study, 9, pp. 75-94, 1978.
9. E. Taillard, "Robust tabu search for the quadratic assignment problem," Parallel Computing, 17, pp. 443-455, 1991.
10. V. Maniezzo and A. Colorni, "The ant system applied to the Quadratic assignment problem," IEEE Trans. Knowledge and Data Engineering, 11(5), pp. 769-779, 1999.
11. T. Mautor and C. Roucairol, "A new exact algorithm for the quadratic assignment problems," Discrete Applied Mathematics, 55, pp. 281-293, 1994.
12. E. M. Loiola, N. Abreu, P. Boaventura-Netto, P. Hahn, and T. Querido, "An survey for the quadratic assignment problem," European Journal of Operational Research, vol. 176, pp. 657-690, 2007.
13. P. Merz and B. Freisleben, "A genetic local search approach to the quadratic assignment problem," Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann, pp. 465-472, 1997.
14. P. Merz and B. Freisleben, "Fitness landscape analysis and memetic algorithms for the quadratic assignment problem," IEEE Trans. Evolutionary Computation, 4(4), pp. 337-352, Nov. 2000.
15. C. E. Nugent, , T. E. Volman, and J. Ruml, "An experimental comparison of techniques for the assignment of facilities to locations," Operations Research 16, pp. 150-173, 1968.
16. S. Sahni and T. Gonzales, "P-complete approximation problems", Journal of the ACM 23, pp. 555-565, 1976.
17. L. Steinberg, "The backboard wiring problem: a placement algorithm," SIAM Review 3, pp. 37-50, 1961.
18. J. Skorin-Kapov, "Extensions of tabu search adaptation to the quadratic assignment problem," Computers and Operations Research, 21 (8), pp. 855-865, 1994.
19. D. M. Tate and A. E. Smithe, "A genetic approach to the quadratic assignment problem," Computers and Operations Research 22 (1), pp. 73-83, 1995.
20. P. Tian, Ma, J. And Zhang, D. M., "Application of the simulated annealing algorithm to the combinational optimisation problem with permutation property: An investigation of generation mechanism," European Journal of Operational Research, vol. 118, pp. 81-94, 1999.