Застосування Travelling Salesman Problem за допомогою алгоритму мурашиної колонії в додатку з доставлення їжі

Abstract

This work is devoted to the study of the salesman's problem for the development of an online food delivery application. The article considers the ant colony algorithm, which allows to efficiently lay the optimal route using pheromones left by ants after the traversed path. It is advisable to use this algorithm to develop a logistics-related service that requires finding the optimal route. It is established that the efficiency of this algorithm decreases with an increase in the number of points on the map, but given the physical limitations of the courier, the number of points on the map is acceptable.