A dynamic traffic equilibrium assignment paradox

研究成果: Article査読

30 被引用数 (Scopus)

抄録

This paper explores the properties of dynamic flow patterns on two symmetrical networks: an `evening-rush-hour' network (E-net) with a one-to-many origin-destination (OD) pattern and a `morning-rush-hour' network (M-net) with a many-to-one OD pattern that can be obtained by reversing the direction of links and the origin and destinations of the evening-rush-hour network. Although conventional static traffic assignment produces exactly the same flow pattern for both networks, such a simple result does not hold for dynamic assignment. We show this result theoretically by using dynamic equilibrium assignment with a point queue model. Specifically, we first derive the closed form solutions of the dynamic assignment for both networks. We then identify the essential differences between the two dynamic network flow patterns by comparing the mathematical structure of the solutions. Furthermore, a type of capacity paradox (a dynamic version of Braess's paradox) is identified in order to demonstrate the differences.

本文言語English
ページ(範囲)515-531
ページ数17
ジャーナルTransportation Research Part B: Methodological
34
6
DOI
出版ステータスPublished - 2000 8月
外部発表はい

ASJC Scopus subject areas

  • 土木構造工学
  • 輸送

フィンガープリント

「A dynamic traffic equilibrium assignment paradox」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル