A POLICY-BASED APPROACH TO STOCHASTIC DYNAMIC TRAFFIC ASSIGNMENT

Stochasticity is prevalent in transportation networks in general, and traffic networks in particular. We study policy-based stochastic dynamic traffic assignment (DTA) methods. This paper introduces a generic approach and another paper by the authors contains an actual model. The policy-based DTA methods work in a stochastic time- dependent network where link travel times are time-dependent random variables. Routing policies rather than paths are used as users' routing choices. A routing policy is a decision rule which specifies what node to take next out of current node based on current time and realized link travel times. We first give a conceptual framework for the policy-based stochastic DTA. We then develop generic methods for the routing policy generation problem, users' policy choice problem and dynamic network loading problem, which are the three major components of the overall DTA model. We present a generic heuristic algorithm to solve the proposed policy-based DTA model. Using an illustrative example, we show that policy-based DTA models have solutions different in expected travel times than the path-based models which are commonly used in the literature

• Supplemental Notes:
  • Publication Date: 2003. Transportation Research Board, Washington DC. Remarks: Paper prepared for presentation at the 82nd annual meeting of the Transportation Research Board, Washington, D.C., January 2003. Format: CD ROM
• 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

  University of California, Berkeley

  Department of Electrical Engineering and Computer Sciences
  Berkeley, CA  United States  94720
• Authors:
  • Gao, Song
  • Chabini, Ismail
• Conference:
  • Transportation Research Board 82nd Annual Meeting
  • Location: Washington DC, United States
  • Date: 2003-1-12 to 2003-1-16
• Date: 2003

Language

• English

Media Info

• Pagination: 14 p.

Subject/Index Terms

• TRT Terms: Computer algorithms; Routing; Traffic assignment; Travel time
• Subject Areas: Operations and Traffic Management;

Filing Info

• Accession Number: 00944335
• Record Type: Publication
• Source Agency: UC Berkeley Transportation Library
• Files: PATH, STATEDOT
• Created Date: Jul 3 2003 12:00AM