Вероятностный подход к решению трехиндексной аксиальной задачи о назначениях. Развитие поисковых способностей

Abstract

The article considers the adaptive algorithm for solving axial 3-index assignment problem. The algorithm is based on the transition to a probabilistic statement of the problem. On the basis of a calculation experiment, the possibility of its improvement was considered. For this, the concept of a neighborhood of a solution based on the Hamming distance is introduced. As a result, the proposed change in the parameters of the algorithm for some function. Finally, the results of the computational experiment and conclusions are given.