RUS  ENG
Full version
JOURNALS // Matematicheskaya Teoriya Igr i Ee Prilozheniya // Archive

Mat. Teor. Igr Pril., 2024 Volume 16, Issue 4, Pages 95–109 (Mi mgta359)

This article is cited in 1 paper

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

Julia V. Chirkova

IAMR KarRC RAS

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.

Keywords: Wardrop equilibrium, route generation, computational complexity.

UDC: 519.711.7
BBK: 22.1

Received: 22.10.2024
Revised: 10.11.2024
Accepted: 01.12.2024



© Steklov Math. Inst. of RAS, 2026