A DISCRETE FLOW MODEL FOR DYNAMIC NETWORK LOADING

In this dissertation, the author presents an original discrete flow traffic model that is derived from a simplified car-following relationship. The node problem associated with a discrete-event discrete-flow arc model is defined, and a solution procedure is then proposed. When compared to existing traffic models, the proposed model provides a unique combination of accuracy and computational speed thus making it well-suited for use with dynamic traffic assignment algorithms.

• Supplemental Notes:
  • Publication Date: 2001. UMI Company, Ann Arbor MI. Remarks: Thesis (Ph. D.)--Universite de Montreal, 2001. Abstract also in: Dissertation abstracts international. B. Vol. 62 no. 2 (August 2001), p. 1052. Format: website
• Corporate Authors:

  Universite de Montreal

  ,    
• Authors:
  • Mahut, Michael
• Publication Date: 2001

Language

• English

Media Info

• Pagination: 118 p.

Subject/Index Terms

• TRT Terms: Car following; Simulation; Traffic assignment; Traffic flow
• Subject Areas: Operations and Traffic Management;

Filing Info

• Accession Number: 00962342
• Record Type: Publication
• Source Agency: UC Berkeley Transportation Library
• Report/Paper Numbers: AAT NQ57470 (UMI order #)
• Files: PATH
• Created Date: Sep 2 2003 12:00AM