Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

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.

This is a preview of subscription content, log in to check access.


  1. 1.

    T. C. Koopmans and M.J. Beckmann, “Assignment problems and the location of economic activities,” Econometrica, Vol. 25, No. 1, 53–76 (1957).

  2. 2.

    L. Steinberg, “The backboard wiring problem: A placement algorithm,” SIAM Review, Vol. 3, No. 1, 37–50 (1961).

  3. 3.

    Ch. E. Nugent, Th. E. Vollmann, and J. Ruml, “An experimental comparison of techniques for the assignment of facilities to locations,” Oper. Res., Vol. 16, 150–173 (1968).

  4. 4.

    S. Sahni and T. Gonzalez, “P-complete approximation problems,” J. of the ACM, Vol. 23, No. 3, 555–565 (1976).

  5. 5.

    R. E. Burkard, “Quadratic assignment problems,” European J. of Oper. Res., Vol. 15, No. 3, 283–289 (1984).

  6. 6.

    J. E. Beasley, “OR-library; distributing test problems by electronic mail,” J. of Oper. Res. Society, Vol. 41, No. 11, 1069–1072 (1990).

  7. 7.

    F. Glover, “Tabu search, Part I,” ORSA J. on Computing, Vol. 1, No. 3, 190–206 (1989).

  8. 8.

    F. Glover, “Tabu search, Part 2I,” ORSA J. on Computing, Vol. 2, No. 1, 4–32 (1990).

  9. 9.

    E. Taillard, “Robust taboo search for the quadratic assignment problem,” Parallel Computing, Vol. 17, Iss. 4-5, 443–455 (1991).

  10. 10.

    R. Battiti and G. Tecchiolli, “The reactive tabu search,” ORSA J. on Computing, Vol. 6, No 2, 126–140 (1994).

  11. 11.

    A. Misevicius, A. Lenkevicius, and D. Rubliauskas, “Iterated tabu search: An improvement to standard tabu search,” Information Technology and Control, Vol. 35, No. 3, 187–197 (2006).

  12. 12.

    U. Benlic and J. K. Hao, “Breakout local search for the quadratic assignment problem,” Applied Math. and Computation, Vol. 219, No. 9, 4800–4815 (2013).

  13. 13.

    U. Benlic and J. K. Hao, “Memetic search for the quadratic assignment problem,” Expert Systems with Applications, Vol. 42, No. 1, 584–595 (2015).

  14. 14.

    A. Misevicius, “An improved hybrid genetic algorithm: New results for the quadratic assignment problem,” Knowledge Based Systems, Vol. 17, No. 2–4, 65–73 (2004).

  15. 15.

    A. Misevicius, “An implementation of the iterated tabu search algorithm for the quadratic assignment problem,” OR Spectrum, Vol. 34, No. 3, 665–690 (2012).

  16. 16.

    P. V. Shylo, “Solving the quadratic assignment problem by the repeated iterated tabu search method,” Cybern. Syst. Analysis, Vol. 53, No. 2, 308–311 (2017).

  17. 17.

    I. V. Sergienko and V. P. Shylo, “Kernel technology to solve discrete optimization problems,” Cybern. Syst. Analysis, Vol. 53, No. 6, 884–892 (2017).

Download references

Author information

Correspondence to I. V. Sergienko.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 1, January–February, 2020, pp. 64–69.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Sergienko, I.V., Shylo, V.P., Chupov, S.V. et al. Solving the Quadratic Assignment Problem. Cybern Syst Anal 56, 53–57 (2020).

Download citation


  • quadratic assignment problem
  • repeated iterated tabu search
  • solution kernel allocation technology
  • random perturbation of solution components
  • algorithm efficiency