Abstract—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.

Index Terms—Group interaction, intelligent mobile object, traveling salesman problem

Cite: Vitalii Tkachov, Volodymyr Tokariev, Iryna Ilina, and Stanislav Partyka, "Modified Traveling Salesman Problem for a Group of Intelligent Mobile Objects and Method for Its Solving," International Journal of Electrical and Electronic Engineering & Telecommunications, Vol. 10, No. 1, pp. 1-7, January 2021. Doi: 10.18178/ijeetc.10.1.1-7

Copyright © 2021 by the authors. This is an open access article distributed under the Creative Commons Attribution License (CC BY-NC-ND 4.0), which permits use, distribution and reproduction in any medium, provided that the article is properly cited, the use is non-commercial and no modifications or adaptations are made.