The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
An algorithm for the equilibrium assignment problem with random link times
Abstract
In this article we offer an equivalent minimization formulation for the traffic assignment problem when the link travel times are flow‐dependent random variables. The paper shows the equivalency between the first‐order conditions of this program and the stochastic equilibrium conditions as well as the uniqueness of the solution. The paper also describes an algorithmic approach to the solution of this program, including a proof of convergence. Finally, we conduct some limited numerical experiments on the rate of convergence of the algorithm and the merits of the stochastic equilibrium model, in general, as compared with deterministic approaches.
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
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
An algorithm for quadratic programming
Frank, M., & Wolfe, P. (1956) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800030109 · Cited by 3,030
Some Theoretical Aspects of Road Traffic Research
Wardrop, J. G. (1952) · Cited by 2,325
Studies in the Economics of Transportation.
R., D. J., Beckman, M., McGuire, C. B., Winsten, C. B., & Koopmans, T. (1956) · OR · doi:10.2307/3007560 · Cited by 1,613
On the Formation of Travel Demand Models and Economic Evaluation Measures of User Benefit
Williams, H. C. W. L. (1977) · Environment and Planning A: Economy and Space · doi:10.1068/a090285 · Cited by 1,030
On Stochastic Models of Traffic Assignment
Daganzo, C. F., & Sheffi, Y. (1977) · Transportation Science · doi:10.1287/trsc.11.3.253 · Cited by 936
Self-citationA 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
Multidimensional Stochastic Approximation Methods
Blum, J. R. (1954) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177728659 · Cited by 523
An Algorithm for the Discrete Network Design Problem
LeBlanc, L. J. (1975) · Transportation Science · doi:10.1287/trsc.9.3.183 · Cited by 479
Cited by
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
Chapter 3 Stochastic and dynamic networks and routing
Powell, W. B., Jaillet, P., & Odoni, A. (1995) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(05)80107-0 · Cited by 334
Self-citationGuo, Z., & Wilson, N. H. M. (2011) · Transportation Research Part A: Policy and Practice · doi:10.1016/j.tra.2010.11.002 · Cited by 281
Pedestrian environment and route choice: evidence from New York City and Hong Kong
Guo, Z., & Loo, B. P. Y. (2013) · Journal of Transport Geography · doi:10.1016/j.jtrangeo.2012.11.013 · Cited by 256
Pradhan, A., & Kockelman, K. M. (2002) · Transportation Research Record: Journal of the Transportation Research Board · doi:10.3141/1805-15 · Cited by 56
Metadata
- Authors
- Sheffi, Y., & Powell, W. B.
- Venue
- Networks
- Publisher
- Wiley
- Published
- 1982-06
- Volume
- 12
- Issue
- 2
- Pages
- 191-207
- ISSN
- 0028-3045 (ISSN-L)
- 1097-0037
- OpenAlex
- W1972180777
- Cited by
- 333
- References
- 15
- FWCI
- 8.98
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An algorithm for the equilibrium assignment problem with random link times. https://app.cochat.ai/papers/10.1002/net.3230120209
- The paper
- Sheffi, Y., & Powell, W. B. (1982). An algorithm for the equilibrium assignment problem with random link times. Networks. https://doi.org/10.1002/net.3230120209
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.