Solving the Quadratic Assignment Problem

作     者：Sergienko, I., V Shylo, V. P. Chupov, S., V Shylo, P., V 

作者机构：Natl Acad Sci Ukraine VM Glushkov Inst Cybernet Kiev Ukraine Uzhgorod Natl Univ Uzhgorod Ukraine 

出 版 物：《CYBERNETICS AND SYSTEMS ANALYSIS》 (控制论和系统分析)

年 卷 期：2020年第56卷第1期

页      面：53-57页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

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

摘      要：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.