• Home
  • Articles & Issues
    • Current
    • All Issues
  • About
    • Aims and Scope
    • Editorial Board
    • Indexing
    • Sources of Financing
  • For Authors
    • Submission
    • Terms of Publication
    • Formatting Guidelines
    • Peer Review Process
    • Article Processing Charges
    • License Agreement
  • Ethics & Policies
    • Publication Ethics
    • Conflict of Interest
    • Open Access Policy
    • Archiving
    • Complaints Policy
    • Privacy Statement
    • Corrections and Retractions
    • Anti-plagiarism Policy
    • Generative AI Policy
  • Search
  • Contacts
en English
  • Українська Українська

The National Transport University Bulletin

  • Submit an article
  • Home
  • Articles & Issues
    • Current
    • All Issues
  • About
    • Aims and Scope
    • Editorial Board
    • Indexing
    • Sources of Financing
  • For Authors
    • Submission
    • Terms of Publication
    • Formatting Guidelines
    • Peer Review Process
    • Article Processing Charges
    • License Agreement
  • Ethics & Policies
    • Publication Ethics
    • Conflict of Interest
    • Open Access Policy
    • Archiving
    • Complaints Policy
    • Privacy Statement
    • Corrections and Retractions
    • Anti-plagiarism Policy
    • Generative AI Policy
  • Search
  • Contacts

Article

  • Read article
  • Download article

Received 02.03.2022

Revised 21.07.2022

Accepted 22.08.2022

Retrieved from Vol. 26, No. 3, 2022

Pages 127 -137

  • 137 Views

Suggested citation

Danchuk, V., Svatko, V., & Bogdanets, Y. (2022). Method of optimizing the route of cargo transportation in cities using information technologies based on the modified ant algorithm. The National Transport University Bulletin, 26(3), 127-137. https://doi.org/10.33744/2308-6645-2022-3-53-127-137

Method of optimizing the route of cargo transportation in cities using information technologies based on the modified ant algorithm

Viktor Danchuk Vitaly Svatko Y. Bogdanets

Abstract

To solve the problems of freight routing in large cities in conditions of non-stationary dynamics of traffic flows on sections of the urban road network (URN), a method of optimizing the route on the network in the form of a bidirectionally oriented weighted graph is proposed. The method is based on the use of a modified ant algorithm. The main element of the modification is that the possibility of asynchronous movement of ant colony agents at a certain speed is realized. In addition, it is also possible to record the results of the optimization of the partially traveled path to calculate the further route when changing the traffic conditions of these agents. This allows you to manage the process of optimizing the route taking into account the dynamic state of the URN, which is associated with significant changes in the speed of vehicles in certain sections of the network. These changes in speed may be due to increased load on the URN areas, the occurrence of congestion, emergencies, and so on. To test the proposed method, simulations of route optimization processes within the problem of a salesman on the example of the URN in Kyiv were performed using developed software. A number of effects were revealed during the simulation. These effects are associated with the restructuring of optimal routes while reducing the average vehicle speeds on the model sections of the URN to certain limit values that correspond to certain modes of traffic flow. The analysis of the identified effects allowed to formulate some methodological recommendations for making management decisions on the rational organization of cargo transportation. Based on the analysis of the results of simulation research, the possibility of using the method to solve problems of effective management of the transportation process in megacities is proved. In particular, the application of this method can be useful in the formation of optimal routes for delivery of goods online, taking into account the real state of traffic in the areas of URN.

 

Keywords:

traffic flow; urban road network; information technology; software; ant algorithm

References

  1. Statystyka tsin na vantazhni perevezennia po Ukraini [Statistics of prices for freight transportation in Ukraine]. Available at: http://degruz.com/price_statistics (Accessed 20 June 2022).
  2. Lukinskiy, V. Methods of evaluating transportation and logistics operations in supply chains / V. Lukinskiy, V. Dobromirov // Transport and Telecommunication, 2016. V. 17. P. 55–59.
  3. Balasescu, S. Optimization methods for supply chain activities / S. Balasescu, M. Balasescu // Bulletin of the Transilvania University of Brasov Series V: Economic Sciences, 2014. V. 7(56). P. 9–16.
  4. Qingyou, Y. The Optimization of Transportation Costs in Logistics Enterprises with Time-Window Constraints / Yan Qingyou, Qian Zhang // Discrete Dynamics in Nature and Society, 2015. V. 2015. P. 10–15.
  5. Prokudin G. Improvement of the Methods for Determining Optimal Characteristics of Transportation Networks / G. Prokudin, O. Chupaylenko, O. Dudnik, A. Dudnik, D. Omarov // Eastern-European Journal of Enterprise Technologies, 2016. V. 6/3 (84). P. 54–61.
  6. Knight, H. New algorithm can dramatically streamline solutions to the ‘max flow’ problem // MIT News, 2014. P. 21–26.
  7. Shtovba S.D. Murashyni alhorytmy [Ant algorithm]. Exponenta Pro. Matematyka v prylozheniiakh [Exponenta Pro. Mathematics in applications], 2003, issue 4, pp. 70–75.
  8. Zhaoyuan, W. A Modified Ant Colony Optimization Algorithm for Network Coding Resource Minimization / W. Zhaoyuan, X. Huanlai, L. Tianrui // IEEE Transactions on Evolutionary Computation, 2016. V. 20 (3). P. 325–342.
  9. Danchuk, V. An Improvement in Ant Algorithm Method for Optimizing a Transport Route with Regard to Traffic Flow / V. Danchuk, O. Bakulich, V. Svatko // Procedia Engineering, 2017. V. 187. P. 425–434.
  10. Danchuk, V.D., Svatko, V.V. Optymizatsiia poshuku shliakhiv po hrafu v dynamichnii zadachi komivoiazhera metodom modyfikovanoho murashynoho alhorytmu [Optimization of the search for paths along the graph in the dynamic problem of the traveling salesman using the method of the modified ant algorithm]. Systemni doslidzhennia ta informatsiini tekhnolohii NTUU «KPI» [System research and information technologies of NTUU "KPI"], 2012, issue 2, pp. 78–86.
  11. Nakaz Ministerstva transportu Ukrainy vid 05.02.2001 r. N 65 «Pro zatverdzhennia Metodychnykh rekomendatsii z formuvannia sobivartosti perevezen (robit, posluh) na transporti» [Order of the Ministry of Transport of Ukraine dated February 5, 2001 No. 65 "On the approval of Methodological recommendations on the formation of the cost of transportation (works, services) in transport"]. Available at: http://uazakon.com/document/spart34/inx34634.htm (Accessed 20 June 2022).
  12. Karta mista Kyieva dlia pobudovy marshrutiv po Ukraini [Map of the city of Kyiv for building routes across Ukraine]. Available at: https://www.google.com.ua/maps/ (Accessed 20 June 2022).
  13. Resurs sposterezhennia za chastynoiu dilianok VDM m. Kyieva [A resource for monitoring part of the URN sites in Kyiv]. Available at: http://videoprobki.ua (Accessed 20 June 2022).
  14. Lobanov, E.M., Sylianov, V.V., Sytnykov, Yu.M., Sapehyn, L.N. Propusknaia sposobnost avtomobylnikh doroh [Carrying capacity of highways]. M.: Transport, 1970, 152 p.
  15. Postanova Kabinetu Ministriv Ukrainy vid 10.11.2017 № 883 «Pro vnesennia zmin do Pravyl dorozhnoho rukhu» [Resolution of the Cabinet of Ministers of Ukraine dated November 10, 2017 No. 883 "On Amendments to the Traffic Rules"]. Available at: http://zakon3.rada.gov.ua/laws/show/883-2017-%D0%BF (Accessed 20 June 2022). 
Share
Facebook
Twitter
LinkedIn
Email
Telegram
Viber
WhatsApp

https://doi.org/10.33744/2308-6645-2022-3-53-127-137

Address
01010, Ukraine, Kyiv,
1, M. Omelianovycha-Pavlenka Str.


Email
ntu@ntu-bulletin.com

Main information
  • Aims and Scope
  • Indexing
  • Terms of Publication
  • Editorial Board
  • Publication Ethics
Additional information
  • Complaints Policy
  • Peer Review Process
  • Open Access Policy
  • Anti-plagiarism Policy
  • Generative AI Policy
  • Archiving