Sergienko I.V., Shylo V.P., Chupov S.V., Shylo P.V.
Solving the quadratic assignment problem

Two modifications of the repeated iterated tabu algorithm for solving the quadratic assignment problem (with and without kernel allocation technology) are proposed. These modifications are analyzed and compared with the best modern algorithms for solving this problem. The efficiency of the developed algorithms is shown, in particular, for large-scale problems for which new records were found with their help. © 2020, Springer Science+Business Media, LLC, part of Springer Nature.

Keywords: algorithm efficiency, quadratic assignment problem, random perturbation of solution components, repeated iterated tabu search, solution kernel allocation technology, Efficiency, Random processes, Tabu search, Algorithm efficiency, Large-scale problem, Quadratic assignment problems, Solution components, Tabu algorithm, Combinatorial optimization

Cite:
Sergienko I.V., Shylo V.P., Chupov S.V., Shylo P.V. (2020). Solving the quadratic assignment problem. Cybernetics and Systems Analysis, 56 (1), 64–69. doi: https://doi.org/10.1007/s10559-020-00219-8 http://jnas.nbuv.gov.ua/article/UJRN-0001074963 [In Ukrainian].