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

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.