QUEUE SPILLOVERS IN TRANSPORTATION NETWORKS WITH A ROUTE CHOICE

This paper examines different traffic phenomena that occur when drivers have to navigate a network in which queues backup past diverge intersections. In particular, it looks at the bottleneck capacity of a network and how reducing it to below a critical level can resume the attractiveness of an alternative route, thus preventing the system from reaching the saturation point. The author concludes that the time-dependent traffic assignment problem with physical queues is chaotic in nature and that it may be impossible to obtain input data with the required accuracy to make reliable predictions of cumulative output flows on severely congested networks.

• Supplemental Notes:
  • Publication Date: 1997 Published By: Institute of Transportation Studies, University of California, Berkeley CA
• Corporate Authors:

  University of California, Berkeley

  California PATH Program, Institute of Transportation Studies
  Richmond Field Station, 1357 South 46th Street
  Richmond, CA  United States  94804-4648

  California Department of Transportation

  1120 N Street
  Sacramento, CA  United States  95814
• Authors:
  • Daganzo, Carlos
• Publication Date: 1997

Language

• English

Media Info

• Pagination: 22, [5] p.
• Serial:
  • PATH technical note ; 97-1
  • Publisher: University of California, Berkeley

Subject/Index Terms

• TRT Terms: Route choice; Traffic congestion; Traffic flow
• Subject Areas: Operations and Traffic Management;

Filing Info

• Accession Number: 00777717
• Record Type: Publication
• Source Agency: UC Berkeley Transportation Library
• Files: PATH, STATEDOT
• Created Date: Nov 17 1999 12:00AM