Preview

City Delivery Routes Planning Based on the Ant Colony Algorithm

https://doi.org/10.21122/2227-1031-2020-19-4-356-362

Abstract

For any company that sells its products in the networks of city stores, the urgent issue is the optimal delivery of their goods. During routing it is necessary to take into account many restrictions caused by specific conditions of transportation process in the city: number of cargoes, nature of cargoes, delivery time, structure of fleet and its presence, work time of enterprises for load matching, drivers’ working hours, loading capacity, road congestion etc. These days, the process of efficient manual routing is difficult because of many restrictions and delivery points wherein it is almost impossible to take into account the road congestion for specific routes. Today's companies are increasingly interested in outsourcing. One of the options for routes planning for enterprises is to use special software products that allow to plan optimal routes according to the chosen criteria and under specific conditions. The process of formation of routes using the Ant Logistics service, based on the Ant Colony optimization algorithm are analysed in the paper. Comparing the two options of forming routes to serve one of the largest retail chains in Kharkiv with the application of Ant Logistics service, it has been elucidated that the application of Ant Colony algorithm is more optimal than the Clarke-Wright algorithm based on delivery routes indicators.

About the Authors

M. Olkhova
O. M. Beketov National University of Urban Economy in Kharkiv
Ukraine

Address for correspondence: Olkhova Mariia – O. M. Beketov National University of Urban Economy in Kharkiv, 17, Marshal Bazhanov str., 61002, Kharkiv, Ukraine. Tel.: +380 63 261-56-27
olhovamv@gmail.com

 


D. Roslavtsev
O. M. Beketov National University of Urban Economy in Kharkiv
Ukraine
Kharkiv 


O. Matviichuk
ANT-Logistics
Ukraine
Dnipro


A. Mykhalenko
O. M. Beketov National University of Urban Economy in Kharkiv
Ukraine
Kharkiv


References

1. Best Route Planning Software (2019). Available at: https://tech.co/fleet-management/best-route-planning-soft ware.

2. Hosseini H. (2009) The Intelligent Water Drops Algorithm: a Nature-Inspired Swarm-Based Optimization Algorithm. International Journal of Bio-Inspired Computation, 1 (1/2), 71. https://doi.org/10.1504/ijbic.2009.022775.

3. Abduljabbar R., Dia H., Liyanage S., Bagloee S. (2019) Applications of Artificial Intelligence in Transport: an Overview. Sustainability, 11 (1), 189. https://doi.org/10.3390/su11010189.

4. Kazharov A., Kureichik V. (2010) Ant Colony Optimization Algorithms for Solving Transportation Problems. Journal of Computer and Systems Sciences International, 49 (1), 30–43. https://doi.org/10.1134/s1064230710010053.

5. Katona G., Lenart B., Juhasz J. (2019) Parallel Ant Colony Algorithm for Shortest Path Problem. Periodica Polytechnica Civil Engineering. https://doi.org/10.3311/ppci.12813.

6. Clark G., Wright J. W. (1964) Scheduling of Vehicles from Central Depot to a Number Delivery Points. Operations Research, 12 (4), 568–581. https://doi.org/10.1287/opre.12.4.568.

7. Pichpibul T., Kawtummachai R. (2013) A Heuristic Approach Based on Clarke-Wright Algorithm for Open Vehicle Routing Problem. The Scientific World Journal, 1 (11). https://doi.org/10.1155/2013/874349.

8. Giyasov N. (2019) Calculation of Delivery Routes – Compare Online Systems. Logist.fm. Available at: https://logist.fm/publications/raschet-marshrutov-dostavki-sravnivaemonlayn-sistemy (in Russian).

9. Ant Logistics (2019) Available at: https://ant-logistics.com/index.html.

10. Kush E. I. (2017) Development of Algorithm of Formation of Freight Routes in Logistic System. Vіsnik Skhіdnoukraїns'kogo Natsіonal'nogo Unіversitetu іmenі Volodimira Dalya = Visnik of the Volodymyr Dahl East Ukrainian National University, 4 (234), 128–133 (in Russian).


Review

For citations:


Olkhova M., Roslavtsev D., Matviichuk O., Mykhalenko A. City Delivery Routes Planning Based on the Ant Colony Algorithm. Science & Technique. 2020;19(4):356-362. https://doi.org/10.21122/2227-1031-2020-19-4-356-362

Views: 2182


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.


ISSN 2227-1031 (Print)
ISSN 2414-0392 (Online)