OPTIMAL ROUTE SELECTION PROBLEM IN OPERATIONAL AND ORGANIZATIONAL CONTROL

Abstract

Three equivalent formulation forms of the optimal search problem are considered. To solve the problem, the dynamic programming method, the branch-and-bound method, the "nearest neighbor" method, as well as heuristic methods were used. To increase the efficiency of the branch and bound method, a number of properties of the Hamiltonian contour are used.