Multi-criteria path rationalization in the conditions of multi-type passenger transport systems

The article proposes methods of searching passenger travel routes in conditions where one or more optimization criteria must be taken into account in the presence of a pedestrian system and multi-type transport systems with their topologies, sets of parameters and tariff plans. The author carried out the research by means of mathematical modeling of the transport system in the form of its deterministic graph model. The author chose Dijk-stra's algorithm as the basic algorithm, on the basis of which the modifications of the previous ones were carried out and the construction of a new search technique was carried out. As a result, the study obtained algorithms for solving single-criteria and multi-criteria problems on graphs. For multicriterial problems, the author used the convolution method and the method of ordering criteria by the degree of decreasing their significance. The field of application of the developed algorithms is information systems focused on the end user and on the structures that design and manage transport networks.

1. Vuchik V. R. Transportation for livable cities: monograph, Moscow, Territoriya budushchego, 20ii, 574 p. (In Russian).

2. Vlasov D. N. Transport and transfer hubs: monograph, Moscow, Moscow State University of Civil Engineering Publishing House, 20i7, i92 p. (In Russian).

3. Kubil V. N. Research and development of methods for solving multi-criteria transport routing problems based on the ant algorithm: Dissertation of Candidate of Technical Sciences: 05.i3.0i, Platov South-Russian State Polytechnic University, Novocherkassk, 20i9, i84 p. (In Russian).

4. Semenov V. V. Mathematical modelling of transport stream dynamics of megacities, Moscow, Keldysh Institute of Applied Mathematics, 2004, 38 p. (Preprint, Keldysh Institute of Applied Mathematics, No. 34). (In Russian).

5. Blinkin M. Ya., Sarychev A. V. Urban transport: a liberal view of the problem, Polit.Ru, 2005, December 7. Available at: https://polit.ru/article/2005/i2/07/transport/ (accessed 28.03.202i). (In Russian).

6. Mironov V Passenger hubs: world experience for Moscow, RBC-Nedvizhimost', 2015, January 20. Available at: https://realty.rbc.ru/news/577d23aa9a7947a78ce9i868 (accessed 28.03.202i). (In Russian).

7. National Project “Digital Economy of the Russian Federation”, Ministry of Digital Development, Communications and Mass Media of the Russian Federation, 2021. Available at: https://digital.gov.ru/ru/activity/directions/858/ (accessed 28.03.2021). (In Russian).

8. The Project of Digitalization of the Urban Economy “Smart City”, Ministry of Construction and Housing and Communal Services of the Russian Federation, 2021. Available at: https://minstroyrf.gov.ru/trades/gorodskaya-sreda/proekt-tsifrovizatsii-gorodsk-ogo-khozyaystva-umnyy-gorod/ (accessed 28.03.2021). (In Russian).

9. Project Register, “Transport category”, National Project “Smart City”, 2021. Available at: https://russiasmartcity.ru/projects?-category=transport (accessed 28.03.2021). (In Russian).

10. Ruzmanova Yu. Not smart yet: What we need to learn from the smartest cities in the world, National Program “Digital Economy of the Russian Federation”, 2021. Available at: https://digital.ac.gov.ru/news/644/?sphrase_id=133429 (accessed 28.03.2021). (In Russian).

11. Abraham I., Delling D., Goldberg A. V., Werneck R. F. A hub-based labeling algorithm for shortest paths in road networks, Experimental Algorithms. SEA 2011. Lecture Notes in Computer Science, vol. 6630, Edited by P. M. Pardalos, S. Rebennack, Berlin, Springer, Heidelberg 2011, pp. 230-241. https://doi.org/10.1007/978-3-642-20662-7_20

12. Aljubayrin S. Algorithms for advanced path Optimization problems. Doctoral Thesis, University of Melbourne, 2016, 1974 p.

13. Braess D., Nagurney A., Wakolbinger T. On a paradox of traffic planning, Transportation Science, 2005, vol. 39, no. 4, pp. 444450. https://doi.org/10.1287/trsc.1050.0127

14. Dantzig G. On the shortest route through a network, Management Science, 1960, vol. 6, no. 2, pp. 187-190. https://doi.org/10.1287/mnsc.6.2.187

15. Dijkstra E. W. A note on two problems in connexion with graphs, Numerische Mathematik, 1959, no. 1, pp. 269-271. https://doi.org/10.1007/BF01386390

16. Galton F. On the construction of isochronic passage-charts, Proceedings of the Royal Geographical Society, 1881, vol. 3, no. 11, pp. 657-658.

17. Ni D. Traffic flow theory: characteristics, experimental methods, and numerical techniques, Butterworth-Heinemann, 2015, 412 p.