ON THE RECURSIVE ALGORITHM FOR SOLVING THE TRAVELING SALESMAN PROBLEM ON THE BASIS OF THE DATA FLOW OPTIMIZATION METHOD

Context. The article considers a technique for the sequential application of flow schemes for distributing a homogeneous resource for solving the traveling salesman problem, which is formulated as the problem of finding a route to visit a given number of cities without repetitions with a minimum duration of movement. The task of formalizing the algorithm for solving the traveling salesman problem by the method of streaming resource distribution using the backtracking scheme is posed. The use of Orlin's method to optimize the flow distribution on the graph is proposed.Objective. The goal of the work is to develop an algorithm for solving the traveling salesman problem based on the implementation of the method of streaming resource distribution and the backtracking scheme with the minimum duration of movement along the route.Method. This paper proposes a method for solving the traveling salesman problem by the method of streaming resource distribution with the backtracking scheme. A scheme for formalizing the procedure for solving the traveling salesman problem with the minimum duration of movement along the route is described. A variant of accelerating the speed of the developed algorithm is proposed, which consists in using a greedy technique in the procedure for selecting route sections: planning each subsequent stage of movement is determined based on the choice of the fastest direction of movement. The results of the proposed algorithm for calculating solutions to the traveling salesman problem with minimization of the duration of movement are presented, the obtained solutions are compared with the solutions found by other exact and heuristic methods.Results. The method for solving the traveling salesman problem using the method of streaming resource allocation and using the backtracking scheme is developed. A variant of accelerating the speed of the developed algorithm is proposed, which consists in using a greedy technique in the procedure for selecting route sections: planning each subsequent stage of movement is determined based on the choice of the fastest direction of movement. The application of the greedy approach makes it possible to obtain a con-structive scheme for solving the traveling salesman problem. The results of the proposed algorithm for calculating solutions to the traveling salesman problem with minimization of the duration of movement are presented, the obtained solutions are compared with the solutions found by other exact and heuristic methods.Conclusions. The paper considers a method for formalizing the algorithm for solving the traveling salesman problem using the method of streaming resource allocation and the backtracking scheme. The use of Orlin's method to optimize the flow distribution on the graph is proposed. The scheme of formalization of the procedure for using the method with the implementation of the backtrack-ing scheme for solving the traveling salesman problem with the minimum duration of movement along the route is briefly described. A variant of accelerating the speed of the developed algorithm is proposed.