Optimum Principle for Calculating the Minimum Probability of Congestion

This paper discusses an optimum principle for traffic and transportation networks with road bottlenecks. This network breakdown minimization (BM) principle states that the network optimum is reached when dynamic traffic optimization is performed in the network in such a way that the probability for spontaneous occurrence of traffic breakdown at one of the network bottlenecks during a given observation time reaches the minimum possible value. This is equivalent to the maximization of the probability that traffic breakdown occurs at none of the network bottlenecks. In comparison to the well-known Wardrop’s principles the application of the BM principle permits considerably greater network inflow rates at which no traffic breakdown occurs and, therefore, free flow remains throughout the entire network.

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/00410683
• Authors:
  • Kerner, Boris S
• Publication Date: 2011-10

Language

• English

Media Info

• Media Type: Print
• Features: Figures; References;
• Pagination: pp 379-386
• Serial:
  • Traffic Engineering & Control
  • Volume: 52
  • Issue Number: 9
  • Publisher: Hemming Group, Limited
  • ISSN: 0041-0683
  • Serial URL: http://www.tecmagazine.com/

Subject/Index Terms

• TRT Terms: Bottlenecks; Dynamic traffic assignment; Highway capacity; Networks; Optimization; Traffic congestion; Traffic flow
• Subject Areas: Highways; Operations and Traffic Management; I72: Traffic and Transport Planning; I73: Traffic Control;

Filing Info

• Accession Number: 01356960
• Record Type: Publication
• Files: TRIS, ATRI
• Created Date: Nov 16 2011 2:51PM