Effective heuristics and metaheuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
 Mahdi Bashiri,
 Hossein Karimi
 … show all 2 hide
Abstract
Quadratic assignment problem (QAP) is a wellknown problem in the facility location and layout. It belongs to the NPcomplete class. There are many heuristic and metaheuristic methods, which are presented for QAP in the literature. In this paper, we applied 2opt, greedy 2opt, 3opt, greedy 3opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and particle swarm optimization as metaheuristic methods for the QAP. This research is dedicated to compare the relative percentage deviation of these solution qualities from the best known solution which is introduced in QAPLIB. Furthermore, a tuning method is applied for metaheuristic parameters. Results indicate that TS is the best in 31%of QAPs, and the IFLS method, which is in the literature, is the best in 58 % of QAPs; these two methods are the same in 11 % of test problems. Also, TS has a better computational time among heuristic and metaheuristic methods.
 Bock, F (1958) An algorithm for solving travelingsalesman and related network optimization. Research report associated with talk presented at the Operations Research Society of America 14th National Meeting, St. Louis
 Burkard, R, Rendl, F (1984) A thermodynamically motivated simulation procedure for combinatorial optimization problems. European Journal of Operational Research 17: pp. 169174 CrossRef
 Croes, GA (1958) A method for solving traveling salesman problems. Operation Research 6: pp. 791812 CrossRef
 Eberhart, RC, Kennedy, J (1995) A new optimizer using particle swarm theory. Paper presented at the Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan
 Fescioglu, U, Kokar, M (2008) Application of Self Controlling Software Approach to Reactive Tabu Search. SASO, Venezia
 Glover, F (1989) Tabu search: Part I. ORSA J Comput 1: pp. 190206 CrossRef
 Glover, F (1990) Tabu search: Part II. ORSA J Comput 2: pp. 432 CrossRef
 Hongbo, L, Ajith, A (2007) An hybrid fuzzy variable neighborhood particle swarm optimization algorithm for solving quadratic assignment problems. Jucs 13: pp. 13091331
 Hongbo, L, Ajith, A, Jianying, Z (2007) A particle swarm approach to quadratic assignment problems. Soft Comput Ind App 39: pp. 213222
 James, T, Rego, C, Glover, F (2007) A cooperative parallel tabu search algorithm for the quadratic assignment problem. Eur J Oper Res 195: pp. 810826 CrossRef
 James, T, Rego, C, Glover, F (2009) Multistart tabu search and diversification strategies for the quadratic assignment problem. Systems, Man and Cybernetics, Part A: Systems and Humans 39: pp. 579596 CrossRef
 Kennedy, J, Eberhart, RC (1995) Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, NovDec 1995. IEEE, Piscataway
 Kennedy, J, Eberhart, RC (1997) A discrete binary version of the particle swarm algorithm. In: Proceedings of International Conference on Systems, Man, and Cybernetics, October 1994. IEEE Computer Society Press, New York
 Koopmans, T, Beckmann, M (1957) Assignment problems and the location of economic activities. Econometrica 25: pp. 5376 CrossRef
 Loiola, E, de Abreo, N, BoaventuraNett, P, Hahn, P, Querido, T (2007) A survey for the quadratic assignment problem. Eur J Oper Res 176: pp. 657690 CrossRef
 Metropolis, N, Rosenbluth, A, Rosenbluth, M, Teller, A, Teller, M (1953) Equation of state calculations for fast computing machines. Journal of Chemical 21: pp. 10871092
 Ramkumar, AS, Ponnambalam, SG, Jawahar, N, Suresh, RK (2008) Iterated fast local search algorithm for solving quadratic assignment problems. Rob ComputIntegr Manuf 24: pp. 392401 CrossRef
 Sahni, S, Gonzalez, T (1976) Pcomplete approximation problems. J Assoc Comput Mach 23: pp. 555565 CrossRef
 Shi, X, Xing, X, Wang, Q (2004) A discrete PSO method for generalized TSP problem. In: Proceedings of International Conference on Machine Learning and Cybernetics, August 2004. IEEE Computer Society Press, New York
 Singh, SP, Sharma, RK (2008) Twolevel modified simulated annealing based approach for solving facility layout problem. Int J Prod Res 46: pp. 35633582 CrossRef
 SkorinKapov, J (1990) Tabu search applied to the quadratic assignment problem. ORSA J Comput 2: pp. 3345 CrossRef
 Taillard, E (1991) Robust taboo search for the quadratic assignment problem. Parallel Comput 17: pp. 443455 CrossRef
 Vollman, TE, Nugent, CE, Zartler, RL (1968) A computerized model for office layout. J Ind Eng 19: pp. 321327
 Wilhelm, MR, Ward, TL (1987) Solving quadratic assignment problems by simulated annealing. IEEE Trans 19: pp. 107119 CrossRef
 Zhu, W, Curry, J, Marquez, A (2009) GPUaccelerated simt tabu search for the quadratic assignment problem. NAMRC, Greenville
 Zhu, W, Curry, J, Marquez, A (2009) SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration. Int J Prod Res 48: pp. 10351047 CrossRef
 Title
 Effective heuristics and metaheuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
 Open Access
 Available under Open Access This content is freely available online to anyone, anywhere at any time.
 Journal

Journal of Industrial Engineering International
8:6
 Online Date
 July 2012
 DOI
 10.1186/2251712X86
 Print ISSN
 17355702
 Online ISSN
 2251712X
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Keywords

 Quadratic assignment problem
 Heuristics
 Metaheuristics
 Tuning method
 Authors

 Mahdi Bashiri ^{(1)}
 Hossein Karimi ^{(1)}
 Author Affiliations

 1. Department of Industrial Engineering, Shahed University, Tehran, 3319118651, Iran