Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций
Конференция: CTAM 2024; Komsomolsk-na-Amure, Russia; Komsomolsk-na-Amure, Russia
Год издания: 2025
Идентификатор DOI: 10.1007/978-3-031-90546-9_10
Ключевые слова: algorithm, intelligence, optimization, routes, distances, logistics, processes
Аннотация: The article is devoted to the Little method applied to solve the wellknown traveling salesman problem, which consists in finding the shortest route passing through all given cities exactly once and returning to the starting point. Little's method is based on the principles of linear programming, which makes it a powerful tool for fПоказать полностьюinding the optimal solution. The article describes the process of applying Little's method: first, a athematical model of the problem is created in the format of a linear program, including constraints and objective functions. Then, feasible solutions are studied, which help to understand how to optimize the route. Data analysis is carried out step by step, which ultimately allows us to determine the optimal route that minimizes the total path length. To illustrate the methodology, an example with five cities was presented. In the course of research, an optimal solution was found that not only reduces the distance, but also significantly improves logistics, reducing transportation costs and travel time. It is analyzed that the Little method is not only theoretically significant, but also practically applicable in solving complex logistical problems.
Журнал: Computing Technologies and Applied Mathematics
Номера страниц: 147-158
Место издания: Springer Cham