This paper contains a quantitative evaluation of probabilistic traffic assignment models and proposes an alternate formulation. The paper also discusses the weaknesses of existing stochastic-network-loading techniques (with special attention paid to Dial's multipath method) and compares them to the suggested approach. The discussion is supported by several numerical examples on small contrived networks. The paper concludes with the discussion of two techniques that can be used to approximate the link flows resulting from the proposed model in large networks.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    428 East Preston Street
    Baltimore, MD  United States  21202
  • Authors:
    • Daganzo, C F
    • Sheffi, Y
  • Publication Date: 1977-8

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00176815
  • Record Type: Publication
  • Source Agency: Engineering Index
  • Files: TRIS
  • Created Date: Jun 28 1978 12:00AM