СРАВНИТЕЛЬНЫЙ АНАЛИЗ МЕТОДОВ ПОИСКА КРАТЧАЙШЕГО ПУТИ В ГРАФЕ

Elena A. Bliznyakova; А. А. Куликов; А. В. Куликов

doi:10.31660/2782-232X-2022-1-80-87

COMPARATIVE ANALYSIS OF METHODS FOR FINDING THE SHORTEST DISTANCE IN A GRAPH

Authors

Elena A. Bliznyakova Volgograd State Technical University
А. А. Куликов Lyceum No. 5 named after Yu. A. Gagarin, Volgograd
А. В. Куликов Volgograd State Technical University https://orcid.org/0000-0003-4395-590X

DOI:

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.

Keywords:

transport, freight transportation, transportation routing, Dijkstra’s algorithm, Bellman-Ford algorithm, dynamic method, “broom” method, method of potentials

About the authors:

Elena A. Bliznyakova, Volgograd State Technical University

Student at the Department of Road Transport

А. А. Куликов, Lyceum No. 5 named after Yu. A. Gagarin, Volgograd

Student

А. В. Куликов, Volgograd State Technical University

Candidate in Engineering, Associate Professor at the Department of Road Transport

Downloads

PDF (Русский)

Published

2022-03-31

How to Cite

Bliznyakova, E.A. COMPARATIVE ANALYSIS OF METHODS FOR FINDING THE SHORTEST DISTANCE IN A GRAPH / E.A. Bliznyakova, А.А. Куликов, А.В. Куликов. – DOI 10.31660/2782-232X-2022-1-80-87 // Architecture, construction, transport. – 2022. – № 1. – P. 80-87.