Principles of Wardrop for Traffic Assignment in a Road Network

5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this chapter is devoted to user equilibrium and system optimum of Wardrop. Discussion on the mathematical formulation of traffic assignment problems with regard to their meaning is available in the Sect. 2.1. The specification of necessary basic statements completes this discussion further. The dual traffic assignment problem with travel times between all origins and destinations as dual variables is considered in the Sect. 2.2. The practical significance of such dual formulation is shown to become evident due to the wide spread of online traffic services. The route-flow assignment problem and link-flow assignment problem are reduced to fixed-point problems with explicit operators in the Sect. 2.3 and Sect. 2.4 respectively. Proofs of corresponding theorems are fully given.

Cite

CITATION STYLE

APA

Krylatov, A., Zakharov, V., & Tuovinen, T. (2020). Principles of Wardrop for Traffic Assignment in a Road Network. In Springer Tracts on Transportation and Traffic (Vol. 15, pp. 17–43). Springer. https://doi.org/10.1007/978-3-030-34102-2_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free