Журнал
Журнал

Журнал

Институт прикладных математических исследований
Журнал
Журнал

О журнале



Редакционный совет



Выпуски



Редакция



Авторам



Условия подписки

ПУБЛИКАЦИИ
Н.Н. Никитина, Е.Е. Ивашко.
Расчет центральности в анализе загруженности городских дорог на примере г. Петрозаводск
// Математическая Теория Игр и ее Приложения, т. 15, в. 3. 2023. C. 41-63
Ключевые слова: graph theory, centrality, transport graph, betweenness centrality
Centrality is a numerical measure that characterizes the structural properties of a graph. In the presented work, centrality is used to analyze the load of the graph of urban roads in the city of Petrozavodsk. In the paper, we describe the method used to construct the road graph, present a modified centrality measure that takes into account the features of the transport network and the distribution of passenger traffic, and demonstrate the results of numerical simulations. For the transport graph, betweenness centralities were calculated with and without regard to the distribution of passenger traffic; a connectivity analysis was carried out to identify critical, overloaded and reserve roads, and the routes that make the greatest contribution to the centrality of the most loaded roads. The obtained results show that centrality can be used for the analysis of the structural features of the graph of urban roads, modeling sustainability and planning the development of the transport network.
Индексируется в РИНЦ, РИНЦ (WS)

Расчет центральности в анализе загруженности городских дорог на примере г. Петрозаводск (4.63 Mb, скачиваний: 102)



  Последние изменения: 23 октября 2023
поиск