The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
Abstract
The equilibrium network design problem can be formulated as a mathematical program with variational inequality constraints. We know this problem is nonconvex; hence, it is difficult to solve for a globally optimal solution. In this paper we propose a simulated annealing algorithm for the equilibrium network design problem. We demonstrate the ability of this algorithm to determine a globally optimal solution for two different networks. One of these describes an actual city in the midwestern United States.
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
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
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
Simulated annealing algorithms: an overview
Rutenbar, R. A. (1989) · IEEE Circuits and Devices Magazine · doi:10.1109/101.17235 · Cited by 807
Cited by
Simulated annealing metaheuristics for the vehicle routing problem with time windows
Chiang, W.-C., & Russell, R. A. (1996) · Annals of Operations Research · doi:10.1007/bf02601637 · Cited by 354
Metadata
- Authors
- Friesz, T. L., Cho, H.-J., Mehta, N. J., Tobin, R. L., & Anandalingam, G.
- Venue
- Transportation Science
- Published
- 1992-02
- Volume
- 26
- Issue
- 1
- Pages
- 18-26
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W2060410323
- Cited by
- 285
- References
- 3
- FWCI
- 37.01
- 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: A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints. https://app.cochat.ai/papers/10.1287/trsc.26.1.18
- The paper
- Friesz, T. L., Cho, H.-J., Mehta, N. J., Tobin, R. L., & Anandalingam, G. (1992). A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints. Transportation Science. https://doi.org/10.1287/trsc.26.1.18
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.
