How to cite this paper
Kaviani, M., Abbasi, M., Rahpeyma, B & Yusefi, M. (2014). A hybrid Tabu search-simulated annealing method to solve quadratic assignment problem.Decision Science Letters , 3(3), 391-396.
Refrences
Ahmed, Z. H. (2013). A New Reformulation and an Exact Algorithm for the Quadratic Assignment Problem. Indian Journal of Science & Technology, 6(4), 4368-4377.
Anstreicher, K.M. (2003). Recent advances in the solution of quadratic assignment problems. Mathematical Programming Series B, 97, 27-42.
Burkard, R. E., Karisch, S. E., & Rendl, F. (1997). QAPLIB–a quadratic assignment problem library. Journal of Global Optimization, 10(4), 391-403.
Burkard, R. E. (2013). Quadratic assignment problems (pp. 2741-2814). Springer New York.
Cela, E. (1998). The Quadratic Assignment Problem: Theory and Algorithms. Kluwer Academic Publishers, Dordrecht.
Forghani, K., & Mohammadi, M. (2012). Integrated quadratic assignment and continuous facility layout problem. International Journal of Industrial Engineering Computations, 3(5), 787-806.
Glover, F. (1986). Future paths for integer programming and links to artificial intelligence. Computers & Operations Research, 13(5), 533-549.
Glover, F. (1989). Tabu Search - Part 1. ORSA Journal on Computing, 1(2), 190–206.
Glover, F. (1990). Tabu Search - Part 2. ORSA Journal on Computing, 2(1), 4–32.
Hertz, A., Taillard, E., & De Werra, D. (1995). A tutorial on tabu search. InProc. of Giornate di Lavoro AIRO, 95, 13-24.
Hussin, M. S., & Stutzle, T. (2011, December). High performing stochastic local search algorithms for the QAP and their performance in dependence to the instance structure and size. In Hybrid Intelligent Systems (HIS), 2011 11th International Conference on (pp. 139-144). IEEE.
Koopmans, T. C., & Beckmann, M. J. (1957). Assignment problems and the location of economic activities. Econometrica, 25, 53-76.
Loiola, E. M., De Abreu, N. M. M., Boaventura-Netto, P. O., Hahn, P., & Querido, T. (2007). A survey for the quadratic assignment problem. European Journal of Operational Research, 176(2), 657-690.
Misevi?ius, A. (2003). A modified simulated annealing algorithm for the quadratic assignment problem. Informatica, 14(4), 497-514.
Paul, G. (2010). Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem. Operations Research Letters, 38(6), 577-581.
Saifullah Hussin, M., & Stützle, T. (2014). Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances. Computers & Operations Research, 43, 286-291.
Tasgetiren, M. F., Pan, Q. K., Suganthan, P. N., & Dizbay, I. E. (2013, April). Metaheuristic algorithms for the quadratic assignment problem. InComputational Intelligence In Production And Logistics Systems (CIPLS), 2013 IEEE Workshop on (pp. 131-137). IEEE.
Tseng, L. Y., & Liang, S. C. (2006). A hybrid metaheuristic for the quadratic assignment problem. Computational Optimization and Applications, 34(1), 85-113.
Wang, J. C. (2007, November). Solving quadratic assignment problems by a tabu based simulated annealing algorithm. In Intelligent and Advanced Systems, 2007. ICIAS 2007. International Conference on (pp. 75-80). IEEE.
Wilhelm, M. R., & Ward, T. L. (1987). Solving quadratic assignment problems by ‘simulated annealing’. IIE transactions, 19(1), 107-119.
Anstreicher, K.M. (2003). Recent advances in the solution of quadratic assignment problems. Mathematical Programming Series B, 97, 27-42.
Burkard, R. E., Karisch, S. E., & Rendl, F. (1997). QAPLIB–a quadratic assignment problem library. Journal of Global Optimization, 10(4), 391-403.
Burkard, R. E. (2013). Quadratic assignment problems (pp. 2741-2814). Springer New York.
Cela, E. (1998). The Quadratic Assignment Problem: Theory and Algorithms. Kluwer Academic Publishers, Dordrecht.
Forghani, K., & Mohammadi, M. (2012). Integrated quadratic assignment and continuous facility layout problem. International Journal of Industrial Engineering Computations, 3(5), 787-806.
Glover, F. (1986). Future paths for integer programming and links to artificial intelligence. Computers & Operations Research, 13(5), 533-549.
Glover, F. (1989). Tabu Search - Part 1. ORSA Journal on Computing, 1(2), 190–206.
Glover, F. (1990). Tabu Search - Part 2. ORSA Journal on Computing, 2(1), 4–32.
Hertz, A., Taillard, E., & De Werra, D. (1995). A tutorial on tabu search. InProc. of Giornate di Lavoro AIRO, 95, 13-24.
Hussin, M. S., & Stutzle, T. (2011, December). High performing stochastic local search algorithms for the QAP and their performance in dependence to the instance structure and size. In Hybrid Intelligent Systems (HIS), 2011 11th International Conference on (pp. 139-144). IEEE.
Koopmans, T. C., & Beckmann, M. J. (1957). Assignment problems and the location of economic activities. Econometrica, 25, 53-76.
Loiola, E. M., De Abreu, N. M. M., Boaventura-Netto, P. O., Hahn, P., & Querido, T. (2007). A survey for the quadratic assignment problem. European Journal of Operational Research, 176(2), 657-690.
Misevi?ius, A. (2003). A modified simulated annealing algorithm for the quadratic assignment problem. Informatica, 14(4), 497-514.
Paul, G. (2010). Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem. Operations Research Letters, 38(6), 577-581.
Saifullah Hussin, M., & Stützle, T. (2014). Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances. Computers & Operations Research, 43, 286-291.
Tasgetiren, M. F., Pan, Q. K., Suganthan, P. N., & Dizbay, I. E. (2013, April). Metaheuristic algorithms for the quadratic assignment problem. InComputational Intelligence In Production And Logistics Systems (CIPLS), 2013 IEEE Workshop on (pp. 131-137). IEEE.
Tseng, L. Y., & Liang, S. C. (2006). A hybrid metaheuristic for the quadratic assignment problem. Computational Optimization and Applications, 34(1), 85-113.
Wang, J. C. (2007, November). Solving quadratic assignment problems by a tabu based simulated annealing algorithm. In Intelligent and Advanced Systems, 2007. ICIAS 2007. International Conference on (pp. 75-80). IEEE.
Wilhelm, M. R., & Ward, T. L. (1987). Solving quadratic assignment problems by ‘simulated annealing’. IIE transactions, 19(1), 107-119.