The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
The Convergence of Equilibrium Algorithms with Predetermined Step Sizes
Abstract
The focus of this paper is on a certain class of equilibrium traffic assignment problems characterized by a path formulation of the associated mathematical programs. In such cases the equilibration iterations would require path enumeration, and are therefore prohibitively expensive. In this paper we prove that a predetermined sequence of step sizes (in a descent direction) would guarantee, under certain regularity conditions, convergence to the equilibrium solution. This algorithm was suggested in the literature without a proof of convergence, which we give here.
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
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
Multidimensional Stochastic Approximation Methods
Blum, J. R. (1954) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177728659 · Cited by 523
A comparison of stochastic and deterministic traffic assignment over congested networks
Sheffi, Y., & Powell, W. B. (1981) · Transportation Research Part B Methodological · doi:10.1016/0191-2615(81)90046-1 · Cited by 113
Self-citation
Cited by
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-citationAn 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-citationA General Fixed-Point Approach to Multimode Multi-User Equilibrium Assignment with Elastic Demand
Cantarella, G. E. (1997) · Transportation Science · doi:10.1287/trsc.31.2.107 · Cited by 259
Gentile, G. (2018) · Transportation Science · doi:10.1287/trsc.2018.0839 · Cited by 25
Metadata
- Authors
- Powell, W. B., & Sheffi, Y.
- Venue
- Transportation Science
- Published
- 1982-02
- Volume
- 16
- Issue
- 1
- Pages
- 45-55
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W2038606782
- Cited by
- 285
- References
- 5
- FWCI
- 44.90
- 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.