S. Mahdavi, M. E. Shiri, and S. Rahnamayan, Metaheuristics in large-scale global continuous optimization: A survey, Information Sciences, pp.407-428, 2015.

X. Li, K. Tang, P. N. Suganthan, and Z. Yang, Nature-inspired algorithms for large scale global optimization, Information Sciences, vol.316, pp.437-439, 2015.

C. Blum and A. Roli, Metaheuristics in combinatorial optimization : Overview and conceptual comparison, ACM Computing Surveys, vol.35, pp.368-308, 2003.

O. Abdelkafi, L. Idoumghar, and J. Lepagnot, A survey on the metaheuristics applied to QAP for the graphics processing units, Parallel Processing Letters, vol.26, pp.1-26, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01665057

T. Koopmans and M. Beckmann, Assignment problems and the location of economic activities, Econometrica, vol.25, issue.1, pp.53-76, 1957.

E. Taillard, Robust taboo search for the quadratic assignment problem, Parallel computing, vol.17, pp.443-455, 1991.

T. James, C. Rego, and F. Glover, Multistart Tabu Search and Diversification Strategies for the Quadratic Assignment Problem, Man, And Cybernetics-part a: systems and humans, vol.39, 2009.

U. Benlic and J. K. Hao, Breakout local search for the quadratic assignement problem, Applied Mathematics and Computation, vol.219, pp.4800-4815, 2013.

T. James, C. Rego, and F. Glover, A cooperative parallel tabu search algorithm for the quadratic assignment problem, European Journal of Operational Research, vol.195, pp.810-826, 2009.

M. Czapinski, An effective Parallel Multistart Tabu Search for Quadratic Assignment Problem on CUDA platform, J. Parallel Distrib. Comput, vol.73, pp.1461-1468, 2013.

T. Stützle, Iterated local search for the quadratic assignment problem, European Journal of Operational Research, vol.174, pp.1519-1539, 2006.

J. S. Kapov, Tabu search applied to the quadratic assignment problem, ORSA Journal on Computing, vol.2, issue.1, pp.33-45, 1990.

U. Tosun, On the performance of parallel hybrid algorithms for the solution of the quadratic assignment problem, Engineering Applications of Artificial Intelligence, vol.39, pp.267-278, 2015.

O. Abdelkafi, L. Idoumghar, and J. Lepagnot, Comparison of two diversification methods to solve the quadratic assignment problem, Procedia Computer Science, vol.51, pp.2703-2707, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01665066

R. B. , Grid'5000: A large scale and highly reconfigurable experimental grid testbed, IJHPCA, vol.20, issue.4, pp.481-494, 2006.

R. E. Burkard, S. Karisch, and F. , QAPLIB -A quadratic assignment problem library, journal of global optimization Volume: 10 Issue: 4, pp.391-403, 1997.

Z. Drezner, P. M. Hahn, and E. D. Taillard, Recent Advances for the Quadratic Assignment Problem With Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods, Annals of Operations research, vol.139, pp.65-94, 2005.

Z. Drezner, P. M. Hahn, and E. D. Taillard, Recent Advances for the Quadratic Assignment Problem With Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods, Annals of Operations research, vol.139, pp.65-94, 2005.

M. S. Hussin and T. Stützle, Hierarchical Iterated Local Search for the Quadratic Assignment Problem, 2009.