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.
Principles of Wardrop for Traffic Assignment in a Road Network
27.11.2019
27 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Estimating urban traffic states using iterative refinement and Wardrop equilibria
IET | 2018
|Estimating urban traffic states using iterative refinement and Wardrop equilibria
Wiley | 2018
|Traffic assignment to road network
Engineering Index Backfile | 1965
|Alec Peachey talks to Eurovia's Scott Wardrop
British Library Online Contents | 2014
Wardrop Equilibria with Risk-Averse Users
Online Contents | 2010
|