Гібридний алгоритм розв'язання квадратичної задачі про призначення

The quadratic assignment problem (QAP) is one of the most studied combinatorial optimization problems with various practical applications. In this paper, we present a hybrid approximation algorithm (HBMA) for solving QAP. HBMA explores the search space by using the well-known algorithms 2-OPT, BLS, and BMA at separate stages of solving the problem. Experimental evaluations on a set of benchmark problems from QAPLIB show that the proposed approach is able to achieve the best-known results to date for all instances, except for some taia-type problems, with an average computational time of less than 2 hours. Comparisons are also provided to show the competitiveness of the proposed approach with respect to the BLS and BMA algorithms for QAP.