Розв’язання квадратичної задачі про призначення методом локальних оптимумів

Abstract

The paper presents a new heuristic algorithm for the quadratic assignment problem. Unlike existing heuristic algorithms that require a few input parameters setting, the proposed algorithm uses only one parameter and is based on the idea of exploiting a combination of different local optima in the neighborhood of the two elements permutations. At the same time it allows to obtain solutions of better quality in slightly lesser time compared to the known algorithms.