DYNAMIC TRAFFIC ASSIGNMENT AND ORIGIN-DESTINATION PATTERNS

• AKAMATSU Takashi

  THE JAPAN SOCIETY OF CIVIL ENGINEERS

• TAKAMATSU Nozomu

  THE JAPAN SOCIETY OF CIVIL ENGINEERS

Bibliographic Information

Other Title

• 動的な交通ネットワーク・フローとOD構造の関係に関する理論的考察
• ドウテキ ナ コウツウ ネットワーク フロー ト OD コウゾウ ノ カンケイ ニ カンスル リロンテキ コウサツ

Abstract

This paper compares the dynamic flow patterns on two symmetrical networks: “Evening-network” which is a network with a one-to-many OD pattern; “Morning-network” which is one with a many-to-one OD pattern that can be obtained by reversing the direction of links, an origin and destinations of the Evening-network. Although the conventional static traffic assignment produces exactly the same flow pattern for both of the networks, we nevertheless find that such a simple conclusion does not hold for dynamic assignment models. As an example demonstrating the essential difference between the two dynamic flow patterns, a capacity increasing paradox (dynamic version of Braess's paradox) is also discussed

Journal

• Doboku Gakkai Ronbunshu

  Doboku Gakkai Ronbunshu 1999 (618), 39-51, 1999-04-20

  Japan Society of Civil Engineers

Keywords

• dynamic traffic assignment
• network flow
• OD pattern
• incidence matrix
• paradox

Details

• CRID: 1390001205310093056
• NII Article ID: 130003983207
• NII Article ID: 10002529310
• NII Book ID: AN10014020
• DOI: 10.2208/jscej.1999.618_39
• ISSN: 18827187
• ISSN: 02897806
• NDL BIB ID: 4713348
• Web Site: https://ndlsearch.ndl.go.jp/books/R000000004-I4713348
• Web Site: https://www.jstage.jst.go.jp/article/jscej1984/1999/618/1999_618_39/_pdf
• Data Source:
  • JaLC
  • NDL
  • Crossref
  • CiNii Articles
• Abstract License Flag: Disallowed