Abstract This study investigates dynamic system-optimal (DSO) and dynamic user equilibrium (DUE) traffic assignment of departure/arrival-time choices in a corridor network. A morning commute problem with a many-to-one pattern of origin–destination (OD) demand and an evening commute problem with a one-to-many OD pattern are considered. Specifically, we first derive a closed-form solution to the DSO problem based on the regularities of the cost and flow variables. By utilizing this solution, we prove that the bottleneck queuing delay of the DUE solution is equal to the optimal toll that eliminates the queue in the DSO solution under certain conditions on a schedule delay function. This enables us to derive a closed-form DUE solution from the DSO solution. We also show theoretical relationships between the DSO and DUE assignment. Numerical examples are provided to illustrate and verify the analytical results.
Highlights We study dynamic traffic assignment with departure time choice in corridor networks. Closed-form solutions to the DSO and DUE problems are obtained. Regularities of flow and cost patterns in the DSO and DUE states are clarified. Queuing delays in the DUE exactly match optimal tolls in the DSO state. The (a)symmetric properties in morning and evening commute problems are identified.
Dynamic traffic assignment in a corridor network: Optimum versus equilibrium
Transportation Research Part B: Methodological ; 161 ; 218-246
2022-04-27
29 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Parallel dynamic traffic equilibrium assignment
Online Contents | 1993
|Dynamic User Equilibrium Traffic Assignment on Congested Multidestination Network
British Library Online Contents | 2004
|Large Problems of Dynamic Network Assignment and Traffic Equilibrium
Transportation Research Record | 2009
|Dynamic User Equilibrium Traffic Assignment on Congested Multidestination Network
Online Contents | 2004
|