Optimum Principle for Traffic and Transportation Networks: Minimum Probability of Congestion

This paper discusses an optimum principle for traffic and transportation networks with road bottlenecks that was recently introduced by the author. This network breakdown minimization (BM) principle states that the network optimum is reached, when dynamic traffic optimization and/or control are performed in the network in such a way that the probability for spontaneous occurrence of traffic breakdown in 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. It is stressed that the BM principle is applicable for the optimization, control, and management of any kind of traffic and transportation networks like freeway networks, city networks, urban networks, and any their combinations. A comparison of the BM principle with the well-known Wardrop's principles as well as with other classical fundamentals and methodologies of traffic and transportation theory is made.

  • Supplemental Notes:
    • Abstract reprinted with permission from Intelligent Transportation Society of America.
  • Corporate Authors:

    ITS America

    1100 17th Street, NW, 12th Floor
    Washington, DC  United States  20036
  • Authors:
    • Kerner, Boris S
  • Conference:
  • Publication Date: 2012


  • English

Media Info

  • Media Type: Digital/other
  • Features: CD-ROM; Figures; References;
  • Pagination: 12p
  • Monograph Title: 19th ITS World Congress, Vienna, Austria, 22 to 26 October 2012

Subject/Index Terms

Filing Info

  • Accession Number: 01494131
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Sep 12 2013 11:07AM