The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
A General Fixed-Point Approach to Multimode Multi-User Equilibrium Assignment with Elastic Demand
Abstract
This paper presents a fixed-point formulation of multi-mode multi-user equilibrium assignment with elastic demand. Users of different classes may have different behavioral characteristics as well as sets of available routes and modes. They may also behave according to different deterministic and/or probabilistic choice models with different utility specifications. Demand elasticity is dealt with without using the inverse of demand function; in addition, the mode choice can be explicitly dealt with. Conditions for existence and uniqueness of solutions are stated, which generalize and extend those in the literature. A general framework for solution algorithms is also developed, and a simple new algorithm is proposed to solve asymmetric (stochastic) multi-mode multi-user equilibrium with elastic demand.
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
The Traffic Assignment Problem: Models and Methods
Patriksson, M. (1994) · Medical Entomology and Zoology · Cited by 1,047
On Stochastic Models of Traffic Assignment
Daganzo, C. F., & Sheffi, Y. (1977) · Transportation Science · doi:10.1287/trsc.11.3.253 · Cited by 936
Traffic Equilibrium and Variational Inequalities
Dafermos, S. (1980) · Transportation Science · doi:10.1287/trsc.14.1.42 · Cited by 926
The existence, uniqueness and stability of traffic equilibria
Smith, M. J. (1979) · Transportation Research Part B: Methodological · doi:10.1016/0191-2615(79)90022-5 · Cited by 857
Optimal strategies: A new assignment model for transit networks
Spiess, H., & Florian, M. (1989) · Transportation Research Part B: Methodological · doi:10.1016/0191-2615(89)90034-9 · Cited by 776
Directed hypergraphs and applications
Gallo, G., Longo, G., Pallottino, S., & Nguyen, S. (1993) · Discrete Applied Mathematics · doi:10.1016/0166-218x(93)90045-p · Cited by 705
Gutiérrez, Ó. D. M. (2014) · Springer eBooks · doi:10.1007/978-94-007-0753-5_748 · Cited by 642
Multidimensional Stochastic Approximation Methods
Blum, J. R. (1954) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177728659 · Cited by 523
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
Equilibrium traffic assignment for large scale transit networks
Nguyen, S., & Pallottino, S. (1988) · European Journal of Operational Research · doi:10.1016/0377-2217(88)90327-x · Cited by 389
Dynamic Processes and Equilibrium in Transportation Networks: Towards a Unifying Theory
Cantarella, G. E., & Cascetta, E. (1995) · Transportation Science · doi:10.1287/trsc.29.4.305 · Cited by 381
Self-citationMultinomial probit: The theory and its application to demand forecasting
(1981) · Transportation Research Part A: General · doi:10.1016/0191-2607(83)90021-3 · Cited by 348
The Traffic Assignment Problem for Multiclass-User Transportation Networks
Dafermos, S. C. (1972) · Transportation Science · doi:10.1287/trsc.6.1.73 · Cited by 302
The Convergence of Equilibrium Algorithms with Predetermined Step Sizes
Powell, W. B., & Sheffi, Y. (1982) · Transportation Science · doi:10.1287/trsc.16.1.45 · Cited by 285
Daganzo, C. F. (1983) · Transportation Science · doi:10.1287/trsc.17.3.282 · Cited by 146
Unconstrained Extremal Formulation of Some Transportation Equilibrium Problems
Daganzo, C. F. (1982) · Transportation Science · doi:10.1287/trsc.16.3.332 · Cited by 110
Convex programming formulations of the asymmetric traffic assignment problem
Hearn, D. W., Lawphongpanich, S., & Nguyen, S. (1984) · Transportation Research Part B Methodological · doi:10.1016/0191-2615(84)90017-1 · Cited by 42
Equilibria for Networks with Lower Semicontinuous Costs: With an Application to Congestion Pricing
Bernstein, D. H., & Smith, T. E. (1994) · Transportation Science · doi:10.1287/trsc.28.3.221 · Cited by 31
Cited by
Gentile, G. (2016) · Transportation Research Part B Methodological · doi:10.1016/j.trb.2016.02.005 · Cited by 45
Gentile, G. (2018) · Transportation Science · doi:10.1287/trsc.2018.0839 · Cited by 25
Metadata
- Authors
- Cantarella, G. E.
- Venue
- Transportation Science
- Published
- 1997-05
- Volume
- 31
- Issue
- 2
- Pages
- 107-128
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W2065881384
- Cited by
- 259
- References
- 18
- FWCI
- 27.95
- 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.