The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
On Stochastic Models of Traffic Assignment
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
The measurement of urban travel demand
McFadden, D. (1974) · Journal of Public Economics · doi:10.1016/0047-2727(74)90003-6 · Cited by 2,546
An Introduction to Probability Theory and Its Application.
Blackwell, D., & Feller, W. (1951) · Journal of the American Statistical Association · doi:10.2307/2280517 · Cited by 866
A probabilistic multipath traffic assignment model which obviates path enumeration
Dial, R. B. (1971) · Transportation Research · doi:10.1016/0041-1647(71)90012-8 · Cited by 842
An efficient approach to solving the road network equilibrium traffic assignment problem
LeBlanc, L. J., Morlok, E. K., & Pierskalla, W. P. (1975) · Transportation Research · doi:10.1016/0041-1647(75)90030-1 · Cited by 804
The Greatest of a Finite Set of Random Variables
Clark, C. E. (1961) · Operations Research · doi:10.1287/opre.9.2.145 · Cited by 708
STRUCTURE OF PASSENGER TRAVEL DEMAND MODELS
Ben-Akiva, M. E. (1974) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 389
Multinomial Probit and Qualitative Choice: A Computationally Efficient Algorithm
Daganzo, C. F., Bouthelier, F., & Sheffi, Y. (1977) · Transportation Science · doi:10.1287/trsc.11.4.338 · Cited by 130
Self-citationAN ITERATIVE ASSIGNMENT APPROACH TO CAPACITY RESTRAINT ON ARTERIAL NETWORKS
(1962) · Cited by 55
Cited by
Discrete Choice Methods and their Applications to Short Term Travel Decisions
Ben-Akiva, M., & Bierlaire, M. (1999) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4615-5203-1_2 · Cited by 908
Route choice modeling: past, present and future research directions
Prato, C. G. (2009) · Journal of Choice Modelling · doi:10.1016/s1755-5345(13)70005-8 · Cited by 495
Some developments in equilibrium traffic assignment
Fisk, C. (1980) · Transportation Research Part B: Methodological · doi:10.1016/0191-2615(80)90004-1 · Cited by 489
An algorithm for the equilibrium assignment problem with random link times
Sheffi, Y., & Powell, W. B. (1982) · Networks · doi:10.1002/net.3230120209 · Cited by 333
Self-citationOn Boundedly Rational User Equilibrium in Transportation Systems
Mahmassani, H. S., & Chang, G.-L. (1987) · Transportation Science · doi:10.1287/trsc.21.2.89 · Cited by 316
Metadata
- Authors
- Daganzo, C. F., & Sheffi, Y.
- Venue
- Transportation Science
- Published
- 1977-08
- Volume
- 11
- Issue
- 3
- Pages
- 253-274
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W2039423859
- Cited by
- 936
- References
- 9
- FWCI
- 51.27
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.