| Autor: |
Sergienko, I. V., Shylo, V. P., Chupov, S. V., Shylo, P. V. |
| Předmět: |
|
| Zdroj: |
Cybernetics & Systems Analysis; Jan2020, Vol. 56 Issue 1, p53-57, 5p |
| Abstrakt: |
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. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink