A multistart simulated annealing algorithm for the quadratic assignment problem

Proceedings - 3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012

Volumn , Issue , 2012, Pages 19-23

  Wang, Jiunn Chin ^a  

^a JINWEN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

combinatorial optimization; quadratic assignment problem; simulated annealing; tabu search

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; LOCAL OPTIMA; MULTISTART; PERFORMANCE EVALUATION; QUADRATIC ASSIGNMENT PROBLEMS; RESTART STRATEGY; SIMULATED ANNEALING ALGORITHMS;

COMBINATORIAL OPTIMIZATION; TABU SEARCH;

SIMULATED ANNEALING;

EID: 84870669686     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IBICA.2012.56     Document Type: Conference Paper

References (32)

1. R. E. Burkard, S.E. Karisch and F. Rendl, "QAPLIB - A Quadratic Assignment Problem Library", http://www.seas.upenn.edu/qaplib/.
2. B. Suman1 and P. Kumar, "A survey of simulated annealing as a tool for single and multiobjective optimization", Journal of the Operational Research Society, Vol. 57, 2006, pp. 1143-1160.
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), 1996, pp. 29-41.
4. T. C. Koopmans and M. J. Beckmann, "Assignment problems and location of economic activities", Econometrica, 25, 1957, pp. 53-76.
5. R. Battiti and G. Techiolli, "Simulated annealing and Tabu search in the long run: A comparison on QAP tasks", Computers & Mathematics with Applications, Vol. 28, No. 6, 1994, pp. 1-8.
6. F. Glover, "Tabu search - part I," ORSA Journal on Computing 1(3), 1989, pp. 190-206.
7. F. Glover, "Tabu search - part II," ORSA Journal on Computing 2(1), 1990, pp. 4-32.
8. J. Krarup and P.M. Pruzan., "Computer-aided layout design", Mathematical Programming Study, 9, 1978, pp. 75-94.
9. E. Taillard, "Robust tabu search for the quadratic assignment problem", Parallel Computing, 17, 1991, pp. 443-455.
10. N. C. Demirel and M. D. Toksari, "Optimization of the quadratic assignment problem using an ant colony algorithm", Applied Mathematics and Computation, Vol. 183, 2006, pp. 427-435.
11. J. Montgomerya, M. Randallb, T. Hendtlassa, "Solution bias in ant colony optimisation: Lessons for selecting pheromone models", Computers & Operations Research, Vol. 35, 2008, pp. 2728-2749.
12. T. Mautor and C. Roucairol , "A new exact algorithm for the quadratic assignment problems", Discrete Applied Mathematics, 55, 1994, pp. 281-293.
13. 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, 2007, pp. 657-690.
14. A. Misevicius, "Testing of Hybrid Genetic Algorithms for Structured Quadratic Assignment Problems", INFORMATICA, Vol. 20, No. 2, 2009, pp. 255-272.
15. P. Merz and B. Freisleben, "Fitness landscape analysis and memetic algorithms for the quadratic assignment problem", IEEE Trans. Evolutionary Computation, Vol. 4, No. 4, Nov. 2000, pp. 337-352.
16. C. E. Nugent, T. E. Volman, and J. Ruml, "An experimental comparison of techniques for the assignment of facilities to locations", Operations Research 16, 1968, pp. 150-173.
17. G. Paul, "An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems", European Journal of Operational Research, Vol. 209, 2011, pp. 215-218.
18. S. Sahni and T. Gonzales, "P-complete approximation problems", Journal of the ACM 23, 1976, pp. 555-565.
19. J. Skorin-Kapov, "Extensions of tabu search adaptation to the quadratic assignment problem", Computers and Operations Research, 21 (8) , 1994, pp. 855-865.
20. Z. Drezner, "Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem", Computers & Operations Research, Vol. 35, 2008, pp. 717-736.
21. A. Misevicius, "A modified simulated annealing algorithm for the quadratic assignment problem", INFORMATICA, 2003, Vol. 14, No. 4, 2003, pp. 497-514.
22. H. D. Nguyen, I. Yoshihara, K. Yamamori, and M. Yasunaga, "Implementation of an effective hybrid GA for large-scale traveling salesman problems", IEEE transactions on systems, man, and cybernetics - part b: cybernetics, Vol. 37, No. 1, Feb. 2007, pp. 92-99.
23. J. P. Kelly, M. Laguna, F. Glover, "A study of diversification strategies for the quadratic assignment problem", Computers & Operations Research, Vol. 21, No. 8, 1994, pp. 885-893.
24. J. Tang, M. H. Lim, Y. S. Ong ,and M. J. Er, "Parallel memetic algorithm with selective local search for large scale quadratic assignment problems", International Journal of Innovative Computing, Vol. 2, No. 6, December 2006.
25. H. M. Nehi and S. Gelareh, "A survey of meta-heuristic solution methods for the quadratic assignment problem", Applied Mathematical Sciences, Vol. 1, No. 46, 2007, pp. 2293-2312.
26. 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, 1999, pp. 81-94.
27. K.D. Boese, A.B. Kahng and S. Muddu, "A new adaptive multi-start technique for combinatorial global optimisation", Operations Research Letters, 16, 1994, pp. 103-113.
28. R. Marti, Multi-start methods. In Glover & Kochenberger (Eds.), Handbook of MetaHeuristics, pp. 355-368, Kluwer Academic Publishers, Boston: 2003.
29. T. James, C. Rego, and F. Glover, "Multistart tabu search and diversification strategies for the quadratic assignment problem", IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans, Vol. 39, No. 3, 2009, pp. 579-596.
30. M. M. Ali and M. N. Gabere, "A simulated annealing driven multistart algorithm for bound constrained global optimization", Journal of Computational and Applied Mathematics, Vol. 233, No. 10, pp. 2661-2674, 2010.
31. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller, "Equation of state calculations by fast computing machines", Journal of Chemical Physics, Vol. 21, Jun. 1953, pp. 1087-1092.
32. T. Stützle, "Iterated localsearch for the quadratic assignment problem", European Journal of Operational Research, Vol. 174, No. 3, 2006, pp. 1519-1539.