This paper considers a network comprised of parallel routes with the Bureau of Public Road (BPR) latency function and suggests an optimal distribution method for incoming traffic flow. The authors analytically derive a system of equations defining the optimal distribution of the incoming flow with minimum social costs, as well as a corresponding system of equations for the Wardrop equilibrium in this network. In particular, the Wardrop equilibrium is applied to the competition model with rational consumers who use the carriers with minimal cost, where cost is equal to the price for service plus the waiting time for the service. Finally, the social costs under the equilibrium and under the optimal distribution are compared. It is shown that the price of anarchy can be infinitely large in the model with strategic pricing.
CITATION STYLE
Lien, J. W., Mazalov, V. V., Melnik, A. V., & Zheng, J. (2016). Wardrop equilibrium for networks with the BPR latency function. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9869 LNCS, pp. 37–49). Springer Verlag. https://doi.org/10.1007/978-3-319-44914-2_4
Mendeley helps you to discover research relevant for your work.