Modified Traveling Salesman Problem for a Group of Intelligent Mobile Objects and Method for Its Solving

A solution of a modified traveling salesman problem for the case, in which a group of intelligent mobile objects is simultaneously involved, is discussed in the article. For this purpose, a review and a comparative analysis of Johnson's algorithms and the branch and bound method have been carried out. It was found that these algorithms are ineffective for solving the modified traveling salesman problem for a group of intelligent mobile objects, therefore, a quest method has been further developed as a solution to this problem. The results of experimental calculations are presented. The directions of further work on the unification of the developed method for constructing structures of fast step-by-step data processing are proposed.