Geodesic
Edge ranking in a transport graph of Petrozavodsk basing on equilibrium flows
Contributions to game theory and management, Tome 17 (2024), pp. 147-154 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Game-theoretic methods are frequently used to model the dynamic processes in urban road networks and evaluate network efficiency. One of the key concepts in this field is a Wardrop equilibrium (user equilibrium), the situation where no driver can reduce their journey time by unilaterally choosing another route. The concept is widely used in the literature to model the distribution of regular trips in a transport network. In general case, the equilibrium is unstable, and the construction of a new equilibrium trip distribution may require significant time. At the same time, when analyzing transport networks, one is often interested in the impact of short-term changes, when a road is closed for a short time, and the drivers do not seek for a new equilibrium but rather select acceptable routes in the current situation. Here, Wardrop equilibrium can be seen as the basic flow distribution, and the temporal changes in agents' strategies have some impact on local or global characteristics of the network. One may predict the scale of this impact by estimating the importance of the edge being temporarily unavailable. In this work, we analyze edge centralities within a Wardrop equilibrium in the transport graph of Petrozavodsk. We propose a modification of edge betweenness centrality that incorporates precalculated equilibrium flows passing through the road segment. We illustrate how the resulting edge ranking can be used to enhance the classical betweenness centrality to consider not only the topological graph properties, but also the actual flow distribution. One can use the modified centrality measure to estimate the properties of Wardrop equilibrium and to increase the efficiency of its recalculation upon graph modifications. The results can be used in the traffic analysis and planning the development of the transport network.
Keywords: transport graph, betweenness centrality, Wardrop equilibrium. 
@article{CGTM_2024_17_a12,
     author = {Natalia Nikitina and Evgeny Ivashko},
     title = {Edge ranking in a transport graph of {Petrozavodsk} basing on equilibrium flows},
     journal = {Contributions to game theory and management},
     pages = {147--154},
     year = {2024},
     volume = {17},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CGTM_2024_17_a12/}
}
TY  - JOUR
AU  - Natalia Nikitina
AU  - Evgeny Ivashko
TI  - Edge ranking in a transport graph of Petrozavodsk basing on equilibrium flows
JO  - Contributions to game theory and management
PY  - 2024
SP  - 147
EP  - 154
VL  - 17
UR  - http://geodesic.mathdoc.fr/item/CGTM_2024_17_a12/
LA  - en
ID  - CGTM_2024_17_a12
ER  - 
%0 Journal Article
%A Natalia Nikitina
%A Evgeny Ivashko
%T Edge ranking in a transport graph of Petrozavodsk basing on equilibrium flows
%J Contributions to game theory and management
%D 2024
%P 147-154
%V 17
%U http://geodesic.mathdoc.fr/item/CGTM_2024_17_a12/
%G en
%F CGTM_2024_17_a12
Natalia Nikitina; Evgeny Ivashko. Edge ranking in a transport graph of Petrozavodsk basing on equilibrium flows. Contributions to game theory and management, Tome 17 (2024), pp. 147-154. http://geodesic.mathdoc.fr/item/CGTM_2024_17_a12/

[1] Ahmad, F., Al-Fagih, L., “Game Theory Applications in Micro and Macroscopic Simulation in Transportation Network: A Comprehensive Review”, IEEE Access, 11 (2023), 93635–93663 | DOI | MR

[2] Akbarzadeh, M., Memarmontazerin, S., Derrible, S., Salehi Reihani, S. F., “The role of travel demand and network centrality on the connectivity and resilience of an urban street system”, Transportation, 46 (2019), 1127–1141 | DOI

[3] Bavelas, A., “A mathematical model for group structures”, Hum. organ, 7 (1948), 16–30 | DOI

[4] Chirkova, J. V., “Analysis of traffic flows on the road graph of Petrozavodsk”, XIV All-Russia Control Conference (VSPU-2024) Proceedings (17-20 June 2024), ed. Novikov, D. A., V.A. Trapeznikov Inst. of Control Sciences of the Russian Academy of Sciences, M., 2024, 3990-3994 (In Russian)

[5] Englert, M., Franke, T., Olbrich, L., “Sensitivity of Wardrop Equilibria”, Theory Comput. Syst., 47 (2010), 3–14 | DOI | MR

[6] Ermolin, N. A., Khitraya, V. A., Khitryi, A. V., Mazalov, V. V., Nikitina, N. N., “Modeling of the City's Transport Network Using Game-Theoretic Methods on the Example of Petrozavodsk”, Contributions to Game Theory and Management, 15 (2022), 18–31 | DOI | MR

[7] Freeman, L. C., “A set of measures of centrality based on betweenness”, Sociometry, 1 (1977), 35–41 | DOI

[8] Kurmankhojayev, D., Li, G., Chen, A., “Link criticality index: Refinement, framework extension, and a case study”, Reliability Engineering System Safety, 243 (2024), 109889 | DOI

[9] Mattsson, L.-G., Jenelius, E., “Vulnerability and resilience of transport systems – A discussion of recent research”, Transportation Research Part A, 81 (2015), 16–34

[10] Mylonas, C., Mitsakis, E., Kepaptsoglou, K., “Criticality analysis in road networks with graph-theoretic measures, traffic assignment, and simulation”, Physica A: Statistical Mechanics and its Applications, 629 (2023), 129197 | DOI

[11] U.S. Bureau of Public Roads, Traffic Assignment Manual, U.S. Department of Commerce, Washington, D.C., 1964

[12] Wardrop, J. G., “Some theoretical aspects of road traffic research”, Proc. Institute of Civil Engineers, Part II, 1 (1952), 325–378

[13] Zadeh, A. S. M., Rajabi, M. A., “Analyzing the effect of the street network configuration on the efficiency of an urban transportation system”, Cities, 31 (2013), 285–297 | DOI