Geodesic
Study of computational complexity of the algorithm for finding the traffic flow Wardrop equilibrium
Matematičeskaâ teoriâ igr i eë priloženiâ, Tome 16 (2024) no. 4, pp. 95-109.

Voir la notice de l'article provenant de la source Math-Net.Ru

The paper describes an algorithm for finding the Wardrop equilibrium and optimal distribution of traffic flows in the urban road network. Implementing this algorithm, the software has been developed. To study the computational complexity of the algorithm for finding the equilibrium distribution of traffic flows depending on the model dimension, the process of conducting and analyzing the results of computational experiments is presented.
Keywords: Wardrop equilibrium, route generation, computational complexity. 
@article{MGTA_2024_16_4_a4,
     author = {Julia V. Chirkova},
     title = {Study of computational complexity of the algorithm for finding the traffic flow {Wardrop} equilibrium},
     journal = {Matemati\v{c}eska\^a teori\^a igr i e\"e prilo\v{z}eni\^a},
     pages = {95--109},
     publisher = {mathdoc},
     volume = {16},
     number = {4},
     year = {2024},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MGTA_2024_16_4_a4/}
}
TY  - JOUR
AU  - Julia V. Chirkova
TI  - Study of computational complexity of the algorithm for finding the traffic flow Wardrop equilibrium
JO  - Matematičeskaâ teoriâ igr i eë priloženiâ
PY  - 2024
SP  - 95
EP  - 109
VL  - 16
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MGTA_2024_16_4_a4/
LA  - ru
ID  - MGTA_2024_16_4_a4
ER  - 
%0 Journal Article
%A Julia V. Chirkova
%T Study of computational complexity of the algorithm for finding the traffic flow Wardrop equilibrium
%J Matematičeskaâ teoriâ igr i eë priloženiâ
%D 2024
%P 95-109
%V 16
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MGTA_2024_16_4_a4/
%G ru
%F MGTA_2024_16_4_a4
Julia V. Chirkova. Study of computational complexity of the algorithm for finding the traffic flow Wardrop equilibrium. Matematičeskaâ teoriâ igr i eë priloženiâ, Tome 16 (2024) no. 4, pp. 95-109. http://geodesic.mathdoc.fr/item/MGTA_2024_16_4_a4/

[1] Gasnikov A. i dr., Vvedenie v matematicheskoe modelirovanie transportnykh potokov, Litres, 2022

[2] Mazalov V.V., Chirkova Yu.V., Setevye igry, uchebnoe posobie, Lan, SPb, 2018

[3] Sukharev A.G., Timokhov A.V., Fedorov V.V., Kurs metodov optimizatsii, Nauka, M., 1986 | MR

[4] Chirkova Yu.V., “Analiz transportnykh potokov na dorozhnom grafe g. Petrozavodska”, XIV Vserossiiskoe soveschanie po problemam upravleniya (VSPU-2024), sbornik nauchnykh trudov, ed. D.A. Novikov, IPU RAN, M., 2024, 3990–3994

[5] Ermolin N.A. et al., “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

[6] Leventhal T., Nemhauser G., Trotter L.J., “A column generation algorithm for optimal traffic assignment”, Transp. Sci., 7:2 (1973), 168–176 | DOI | MR

[7] Mtoi E., Moses R., “Calibration and Evaluation of Link Congestion Functions: Applying Intrinsic Sensitivity of Link Speed as a Practical Consideration to Heterogeneous Facility Types within Urban Network”, J. of Transportation Technologies, 4 (2014), 141–149 | DOI

[8] Sheffi Y., Urban transportation networks: Equilibrium analysis with mathematical programming methods, Prentice-Hall, Inc., 1985

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