Dynamic traffic assignment in a corridor network: Optimum versus equilibrium

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, the authors first derive a closed-form solution to the DSO problem based on the regularities of the cost and flow variables. By utilizing this solution, the authors 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 the authors to derive a closed-form DUE solution from the DSO solution. The authors also show theoretical relationships between the DSO and DUE assignment. Numerical examples are provided to illustrate and verify the analytical results.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01848351
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jun 10 2022 3:44PM