Open AccessModified Traveling Salesman Problem for a Group of Intelligent Mobile Objects and Method for Its Solving
Author(s) -
Віталій Ткачов,
Vоlоdymyr Tokariev,
Iryna Ilina,
Stanislav Partyka
Publication year - 2021
Publication title -
international journal of electrical and electronic engineering and telecommunications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.171
H-Index - 6
ISSN - 2319-2518
DOI - 10.18178/ijeetc.10.1.1-7
Subject(s) - travelling salesman problem , unification , computer science , group (periodic table) , 2 opt , mathematical optimization , mathematics , algorithm , chemistry , organic chemistry , programming language
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.