Shylo P.V.
Solving the quadratic assignment problem by the repeated iterated tabu search method

A new repeated iterated tabu search for the quadratic assignment problem is developed. A comparative study of this algorithm and the best existing algorithms for solving this problem has shown its competitiveness with respect to both its performance and quality of solutions. © 2017, Springer Science+Business Media New York.

Keywords: comparative study of algorithms, computing experiment, quadratic assignment problem, tabu search, Combinatorial optimization, Tabu search, Comparative studies, Computing Experiments, Quadratic assignment problems, Quality of solution, Tabu search method, Problem solving

Cite:
Shylo P.V. (2017). Solving the quadratic assignment problem by the repeated iterated tabu search method. Cybernetics and Systems Analysis, 53 (2), 163-167. doi: https://doi.org/10.1007/s10559-017-9930-x http://jnas.nbuv.gov.ua/article/UJRN-0000670420 [In Russian].