SIMULATION OF TRANSPORT AND LOGISTICS SCHEMES OF TRUCK TRANSPORTATION UNDER THE CONDITIONS OF GLOBAL RISKS
DOI:
https://doi.org/10.18372/0370-2197.3(100).17899Keywords:
traffic flows, transportation, modeling, network modification, global risksAbstract
As a result of the increase in the number of factors that ensure the efficiency of transport flows, the methods of building mathematical models, which are based on the consideration of general laws, turned out to be ineffective. Therefore, it is promising to involve experimental methods of identification based on the formalization of the results of observations and analysis of the arrival of new information about changes in the situation that has developed with the use of new digital technologies.
The article shows that in the near future, road connections together with water transport will be of key importance, and therefore the task of mathematically ensuring the management of the preservation of traffic flows under the conditions of global risks will always be relevant. The method of work is the modeling of traffic flows under conditions of preservation of global risks.
A solution to the problem of maintaining the dynamics of traffic flows caused by the pandemic, military actions and extreme situations is proposed. Based on graph theory, Ford-Falkerson and Dinitz algorithms, a modified algorithm for determining the structure of transportation was developed. A feature of the algorithm is the synchronization of the capacity of transport flows with the moments of lifting and introducing restrictions on transport. The novel proposed algorithm is the possibility of adjusting transport routes. Also, a new use of the proposed modified algorithm is the synchronization of technologies using the methodology of determining the throughput capacity of the branches of the implementation of transport flows with moments of the concept and introduction of restrictions due to unforeseen situations and global risks. The modified algorithm for determining traffic flows in the conditions of unforeseen situations and global risks based on the maximum algorithms of Ford-Falkerson and Dinitz ensures the minimization of losses of carriers and traffic flow. Implementation of the algorithm ensures maximum traffic flow in extreme conditions and global risks.
References
Wichmann J., Wibotzki M., Sandkuhl K. Toward a smart town: Digital innovation and transformation process in a public sector environment (2021) Smart Innovation, Systems and Technologies, 189, pp. 89-99. DOI: 10.1007/978-981-15-5784-2_8.
Zang B., Pu Y., Wang Y., Li J. Forecasting hotel accommodation demand based on LSTM model incorporating internet search index (2019) Sustainability (Switzerland), 11 (17), art. No.4708. DOI:10.1108/JPMD-09-2-17-0094.
Bartysh M.Ya., Dudzyanyy I.M. Doslidzhennya operatsiy. Chastyna 2. Alhorytmy optymizatsiyi na hrafakh: Pidruchnyk. – L'viv: Vydavnychyy tsentr LNU imeni Ivana Franka, 2007. – 120 s.
Sharko M., Lopushynskyi I., Petrushenko N., Zaitseva O., Kliutsevskyi V., Yarchenko Y. (2020) Management of tourists" enterprises adaptation strategies for identifying and predicting multidimensional non-stationary data flows in the face of uncertainties. Advances in Intelligent Systems and Computing, pp. 135-151. https://doi.org/10.1007/978-3-030-54215-3.
Zwick, Uri. The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate // Theoretical Computer Science : journal. 1995. 21 August (vol. 148, no. 1). P. 165-170. doi:10.1016/0304-3975(95)00022-O.
Qu, Q.-K., Chen, F.-J., Zhou, X.-J. Road traffic bottleneck analysis for expressway for safety under disaster events using blockchain machine learning (2019) Safety Science, 118, pp. 925-932. DOI: 10.1016/j.ssci.2019.06.030.
Ferreira, J., Callou, G., MacIel, P., Tutsch, D. An algorithm to optimise the energy distribution of data centre electrical infrastructures (2020) International Journal of Grid and Utility Computing, 11 (3), pp. 419-433. DOI: 10.1504/IJGUC.2020.107625.
Dolgopolov, P., Konstantinov, D., Rybalchenko, L., Muhitovs, R. Optimization of train routes based on neuro-fuzzy modeling and genetic algorithms (2019) Procedia Computer Science, 149, pp. 11-18.
Dash, P., Rahman, M.M., Zohora, F.T. An alternate simple approach to obtain the maximum flow in a network flow problem (2018) Journal of Engineering and Applied Sciences, 13 (Specialissue10), pp. 8270-8276. DOI: 10.3923/jeasci.2018.8270.8276.
Laube, U., Nebel, M.E. Maximum Likelihood Analysis of the Ford–Fulkerson Method on Special Graphs (2016) Algorithmica, 74 (4), pp. 1224-1266. DOI: 10.1007/s00453-015-9998-5.
Takahashi, T. The simplest and smallest network on which the ford-fulkerson maximum flow procedure may fail to terminate (2016) Journal of Information Processing, 24 (2), pp. 390-394. DOI: 10.2197/ipsjjip.24.390.
Dinitz, M., Nazari, Y. Massively parallel approximate distance sketches (2020) Leibniz International Proceedings in Informatics, LIPIcs, 153, art. no. 35. DOI: 10.4230/LIPIcs.OPODIS.2019.35.
Dinitz, M., Nazari, Y. Brief announcement: Massively parallel approximate distance sketches (2019) Leibniz International Proceedings in Informatics, LIPIcs, 146, art. no. 42. Cited 1 time. DOI: 10.4230/LIPIcs.DISC.2019.42.
