Study of computational complexity of the algorithm for finding the traffic flow Wardrop equilibrium

  • Julia V. Chirkova Institute of Applied Mathematical Research of the Karelian Research Center of RAS
  • Юлия Васильевна Чиркова Institute of Applied Mathematical Research of the Karelian Research Center of RAS
DOI: https://doi.org/10.17076/mgta_2024_4_82
Keywords: Wardrop equilibrium, route generation, computational complexity

Abstract

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.

Published
2024-12-06
How to Cite
Chirkova, J., & Чиркова, Ю. (2024). Study of computational complexity of the algorithm for finding the traffic flow Wardrop equilibrium. Mathematical Game Theory and Applications, 16(4), 95-109. https://doi.org/10.17076/mgta_2024_4_82
Issue
Vol 16 No 4 (2024): Mathematical game theory and applications
Section
Статьи
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.