A PROBABILISTIC MULTIPATH TRAFFIC ASSIGNMENT MODEL WHICH OBVIATES PATH ENUMERATION. IN: THE AUTOMOBILE

This paper presents a probabilistic assignment model that attempts to circumvent path enumeration. It assigns trips to all reasonable paths simultaneously, in such a way that the resulting effect is identical to what would have been obtained if each path had been assigned trips separately under certain choice probability assumptions. The model is theoretically attractive and computationally very efficient compared to other multipath techniques. On the theoretical side it displays some highly desirable characteristics that are seldom present in other techniques. It evaluates as equiprobable all reasonable paths of egual length. As paths get longer, they become less likely to be used; how much less likely can be controlled by the model's user.

  • Availability:
  • Supplemental Notes:
    • Originally published in: Transportation Research, 1971, 5 (1), April, 83-111.
  • Corporate Authors:

    Edward Elgar Publishers

    William Pratt House, 9 Dewey Court
    Northampton, MA  United States  01060-3815
  • Authors:
    • Dial, R B
  • Publication Date: 2003

Language

  • English

Media Info

  • Features: Figures; References; Tables;
  • Pagination: p. 259-285
  • Serial:

Subject/Index Terms

Filing Info

  • Accession Number: 00964088
  • Record Type: Publication
  • ISBN: 1840647973
  • Files: TRIS
  • Created Date: Oct 29 2003 12:00AM