Optimization model of freight transportation on the routes of international transport corridors
The article deals with the modified Dijkstra’s algorithm of searching the shortest routes between all transport nodes of the road-transport network, which allows presenting the transport problem in the classical matrix form. This makes it possible to apply each of the known methods of optimal transport plans to solve it. The object of study is the transport process of freight transportation on the transport network by routes of international transport corridors. The purpose of the work is to improve the methods of solving the problems of finding the shortest routes on the transport network, including sections of international transport corridors. The research method is the analysis and modeling of freight transportation on road networks. The modified Dijkstra’s algorithm of finding the shortest paths between all nodes of the road-transport network was work out, which allows to represent the transport problem in the classical matrix form, i.e. in the form of a table of connections. This makes it possible to apply each of the known methods of constructing optimal plans of cargo transportation in the table of connections. The software complex based on the developed algorithm was designed in the algorithmic language Delphi, which was tested on the example of a transport problem set in the form of a road network, as well as complex testing and debugging of a computer system to support decision-making on the optimization of freight traffic on Ukrainian and Western Europe transport systems.
1. Aulin, V., Hrynkiv, A., Lyashuk, O., Vovk, Y., Lysenko, S., Holub, D., ... & Lavrentieva, O. (2020). Increasing the Functioning Efficiency of the Working Warehouse of the “UVK Ukraine” Company Transport and Logistics Center. Communications-Scientific lett
2. Aulin, V., Lyashuk, O., Pavlenko, O., Velykodnyi, D., Hrynkiv, A., Lysenko, S., Holub, D., Vovk, Y., Dzyura, V., & Sokol, M. (2019). Realization of the Logistic Approach in the International Cargo Delivery System. Communications - Scientific Letters of th
3. Bekmagambetov, M., & Kochetkov, A. (2012). Analysis of modern software of transport simulation of research, design, technology. Journal of Automotive Engineers, 6(77), 25-34. Retrieved from http://www.aae-press.ru/f/77/25.pdf.
4. Cancela, H., Mauttone, A., & Urquhart, M. E. (2015). Mathematical programming formulations for transit network design. Transportation Research Part B: Methodological, 77, 17-37. doi:10.1016/j.trb.2015.03.006.
5. Cormen, T., Rivest, C., & Stein, R. (2006). Section 26.2: The Ford–Fulkerson method. Introduction to Algorithms (Second ed.). MIT Press and McGraw–Hill.
6. Kavita G. (2014). An algorithm for solving a capacitated indefinite quadratic transportation problem with enhanced flow. Yugoslav Journal of Operations Research, 24, 217-236. doi:10.2298/yjor120823043g.
7. Knight, H. (2014). New algorithm can dramatically streamline solutions to the 'max flow' problem. MIT News, 4, 21–26.
8. Lashenyh, A., & Turpak, S. (2016). Development of mathematical models for planning the duration of shunting operations. Eastern-European Journal of Enterprise Technologies, 5/3(83), 40-46. doi:10.15587/1729-4061.2016.80752.
9. Prokudin, G. (2006). Modeli i metody optimizatsii perevezen’ u transportnykh systemakh [Models and methods of optimization of transportation in transport systems]. Kyiv: NТU Publ [in Ukrainian].
10. Prokudin, G., Chupaylenko, A., & Dudnik, A. (2016). The conversion process network models of freight transport in the matrix model. Project Management, Systems Analysis and Logistics. Science Journal, 16(1), 125-136.
11. Prokudin, G., Chupaylenko, O., & Dudnik, O. (2016). Improvement of the methods for determining optimal characteristics of transportation networks. Eastern-European Journal of Enterprise Technologies, 6/3 (84), 54-61. https://doi.org/10.15587/1729-4061.201
12. Prokudin, G., Chupaylenko, O., & Dudnik, O. (2018). Application of information technologies for the optimization of itinerary when delivering cargo by automobile transport. Eastern-European Journal of Enterprise Technologies, 2/3 (92), 51-59. doi:10.15587
13. Prokudin, G., Chupaylenko, O., & Dudnik, O. (2018). Optimization of transport processes with the use of information technologies. European Journal of Intelligent Transportation Systems, 1(1), 11. doi:10.31435/rsglobal_ejits.
14. Pu, C., Li, S., Yang, Y., & Wang, K. (2016). Information transport in multiplex networks. Statistical Mechanics and its Applications, 477, 261-269. doi:10.1016/j.physa.2015.12.057.
15. Semenov, V. (2004). Mathematical modeling of dynamics of transport flows of a metropolis. Preprints of the IPM M. V. Keldysh, 034, 38-45. Retrieved from http://spkurdyumov.ru/uploads/2013/08/Semenov.pdf.
16. Singh, S., Dubey, G. C., & Shrivastava, R. (2016). Various method to solve the optimality for the transportation problem. Statistical Mechanics and its Applications, 12, 161-169.
17. Srour, F. J., & Newton, D. (2006). Freight-specific data derived from intelligent transportation systems: Potential uses in planning freight improvement projects. Transportation Research Record, 1957(1), 66-74. doi:10.3141/1957-10.66-74.
18. State Statistics Service of Ukraine. (2019). Transit freight for the period 2008-2019 years. Retrieved from https://www.ukrstat.gov.ua
19. Teodorovic, D., & Janic M. (2016). Transportation Systems. Transportation Engineering, 2, 5–62. doi:10.1016 / b978-0-12-803818-5.00002-0.
20. Wu, J., Guo, X., Sun, H., & Wang, B. (2014). Topological effects and performance optimization in transportation continuous network design. Mathematical Problems in Engineering, 2, 51-68. doi:10.1155/2014/490483.
21. Zakharov, Yu, & Karnauk, E. (2014). The main modern tools of simulation of traffic flows. Bulletin of Pridneprovsk State Academy of Civil Engineering and Architecture, 1 (190), 46-51. Retrieved from http://visnyk.pgasa.dp.ua/article/download/39889/36019.
22. Zou, Y., & Zhu J. (2016). Reachability of higher-order logical control networks via matrix method. Applied Mathematics and Computation, 287, 50-59. doi:10.1016/j.amc.2016.04.013.