On Stochastic Models of Traffic Assignment

Carlos F. Daganzo and Yosef Sheffi
Additional contact information
Carlos F. Daganzo: University of California, Berkeley, California
Yosef Sheffi: Massachusetts Institute of Technology, Cambridge, Massachusetts

Transportation Science, 1977, vol. 11, issue 3, 253-274

Abstract: This paper contains a quantitative evaluation of probabilistic traffic assignment models and proposes an alternate formulation. First, the concept of stochastic-user-equilibration (S-U-E) is formalized as an extension of Wardrop's user-equilibration criterion. Then, the stochastic-network-loading (S-N-L) problem (a special case of S-U-E for networks with constant link costs) is analyzed in detail and an expression for the probability of route choice which is based on two general postulates of user behavior is derived. The paper also discusses the weaknesses of existing S-N-L techniques with special attention paid to Dial's multipath method and compares them to the suggested approach. The proposed model seems reasonable and does not exhibit the inherent weaknesses of the logit model when applied to sets of routes which overlap heavily. 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.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (194)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.11.3.253 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:11:y:1977:i:3:p:253-274

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().