Rakhmetullina S., Zhomartkyzy G., Krak Iu., Kamelova A.
Development of an algorithm for solving an asymmetric routing problem based on the ant colony method

One of the major problems of transport logistics is planning optimal delivery routes. Solving this problem leads to combinatorial optimizations that require complex computations. The present research considers an asymmetric problem of transport routing with a limitation of the carrying capacity of transport facilities, the duration of the route, and a heterogeneous transport facilities fleet. An algorithm for solving the routing problem based on the ant colony method is proposed. The web application that has been developed implements the proposed algorithm for solving this problem. The obtained optimal routes were compared with the results of route building by other cartographic services. The proposed algorithm showed the best result. © 2023, Springer Science+Business Media, LLC, part of Springer Nature.

Keywords: ant colony method, asymmetric routing problems, graph route search, optimization, web applications, Ant colony optimization, Routing algorithms, Vehicle routing, Algorithm for solving, Ant colony methods, Asymmetric routing problem, Graph route search, Optimisations, Problem-based, Routing problems, Transport facilities, WEB application, Web applications, Combinatorial optimization

Cite:
Rakhmetullina, Zhomartkyzy, Krak, Kamelova. (2023). Development of an algorithm for solving an asymmetric routing problem based on the ant colony method. Cybernetics and Systems Analysis, 59 (4), 20–29. doi: https://doi.org/10.1007/s10559-023-00588-w http://jnas.nbuv.gov.ua/article/UJRN-0001415721