Comparative analysis of methods for finding the shortest distance in a graph
https://doi.org/10.31660/2782-232X-2022-1-80-87
Abstract
Currently, there is a high need to determine the shortest distances to form freight and passenger transportation routes. One of the most effective ways to determine routes of minimum length are methods of finding the shortest distances in a graph. The article discusses algorithms for finding shortest distances, as well as other methods based on the principles of their operation. It was conducted a comparative analysis to identify the advantages and disadvantages of using these methods in routing tasks.
About the Authors
E. A. BliznyakovaRussian Federation
Elena A. Bliznyakova, Student at the Department of Road Transport
Volgograd
A. A. Kulikov
Russian Federation
Andrey A. Kulikov, Student
Volgograd
A. V. Kulikov
Russian Federation
Alexey V. Kulikov, Candidate in Engineering, Associate Professor at the Department of Road Transport
Volgograd
References
1. Vel'mozhin, A. V., Gudkov, V. A., Mirotin, L. B., & Kulikov, A. V. (2016). Gruzovye avtomobil'nye perevozki. 3rd edition, revised. Moscow, Goryachaya liniya – Telekom Publ., 560 p. (In Russian).
2. Kulikov, A. V., & Firsova, S. Yu. (2020). Effectiveness of Road Transport Technology in Modern Housing Systems. Proceedings of the 5th International Conference on Industrial Engineering (ICIE 2019): Conference proceedings ICIE 2019, Sochi, Russia, March 25-29, 2019. South Ural State University (national research university), Platov South-Russian State Polytechnic University (NPI). Sochi, Springer International Publishing, Switzerland AG Publ., pp. 813-821. (In English). DOI: 10.1007/978-3-030-22063-1_87
3. Kulikov, A. V., Firsova, S. Y., & Dorokhina, V. S. (2021). Improving efficiency of car transportation in extreme north conditions in Russian Federation. The Russian Automobile and Highway Industry Journal, 18(3), pp. 286-305. (In Russian). DOI: 10.26518/2071-7296-2021-18-3-286-305
4. Domke, E. R., & Zhestkova, S. A. (2014). Metody optimizatsii marshrutnykh skhem razvozki gruzov avtomobil'nym transportom. Penza, PGUAS Publ., 164 p. (In Russian).
5. Sulimenova, E. R. (2021). Effektivnye matematicheskie metody v transportno-logisticheskom obsluzhivanii malykh predpriyatiy g. Volgograda. Konkurs nauchno-issledovatel'skikh rabot studentov Volgogradskogo gosudarstvennogo tekhnicheskogo universiteta: tezisy dokladov, Volgograd, April, 26–30. Volgograd, Volgograd State Technical University Publ., pp. 151. (In Russian).
6. Vybor optimal'nogo marshruta metodom dinamicheskogo programmirovaniya. Helpiks.Org. (In Russian). Available at: https://helpiks.org/2-66840.html (date of the application: 10.02.2022).
7. Opredelenie kratchayshikh rasstoyaniy s ispol'zovaniem metoda potentsialov. Studbooks.net. (In Russian). Available at: https://studbooks.net/2456287/tehnika/opredelenie_kratchayshih_ rasstoyaniy_ispolzovaniem_metoda_potentsialov (date of the application: 10.02.2022).
8. Aytbagina, E. R., & Vitvitskiy, E. E. (2017). The influence of the distance on the results of the work group of vehicles for the cargo transportation by the supplier. The Russian Automobile and Highway Industry Journal, 4-5(56-57), pp. 14-24. (In Russian).
9. Dorokhin, S., Likhachev, D., Artemov, A., Sevostyanov, A., Kulikov, A., & Novikov, A. (2022). The dynamic traffic modelling system. International Scientific Siberian Transport Forum. TransSiberia 2021. Cham, Publ. Springer, pp. 1586-1594. (In English). DOI: 10.1007/978-3-030-96380-4_175
10. Gorev, A. E. (2008). Gruzovye avtomobil'nye perevozki. 5th edition, revised. Moscow, Akademiya Publ., 288 p. (In Russian).
11. Afanas'ev, L. L., Ostrovsky, N. B., & Zuckerberg, S. M. (1984). Edinaya transportnaya sistema i avtomobil'nye perevozki. 2nd edition, revised. Moscow, Transport Publ., 333 p. (In Russian).
Review
For citations:
Bliznyakova E.A., Kulikov A.A., Kulikov A.V. Comparative analysis of methods for finding the shortest distance in a graph. Architecture, Construction, Transport. 2022;(1):80-87. (In Russ.) https://doi.org/10.31660/2782-232X-2022-1-80-87