The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
A Model and an Algorithm for the Dynamic Traffic Assignment Problems
Abstract
A discrete time model is presented for dynamic traffice assignment with a single destination. Congestion is treated explicitly in the flow equations. The model is a nonlinear and nonconvex mathematical programming problem. A piecewise linear version of the model, with additional assumptions on the objective function, can be solved for a global optimum using a one-pass simplex algorithm—branch-and-bound is not required. The piecewise linear program has a staircase structure and can be solved by decomposition techniques or compactification methods for sparse matrices.
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
Nemhauser, G. L., & Wolsey, L. A. (1972) · Cited by 3,371
Self-citationFlows in Transportation Networks
(1972) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6182-x · Cited by 189
A Unified Approach to Equilibrium Methods for Traffic Assignment
Nguyen, S. (1976) · Lecture notes in economics and mathematical systems · doi:10.1007/978-3-642-48123-9_8 · Cited by 71
Cited by
Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future
Peeta, S., & Ziliaskopoulos, A. K. (2001) · Networks and Spatial Economics · doi:10.1023/a:1012827724856 · Cited by 779
Ziliaskopoulos, A. K. (2000) · Transportation Science · doi:10.1287/trsc.34.1.37.12281 · Cited by 498
The path most traveled: Travel demand estimation using big data resources
Toole, J. L., Colak, S., Sturt, B., Alexander, L. P., Evsukoff, A., & González, M. C. (2015) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2015.04.022 · Cited by 417
System performance and user response under real-time information in a congested traffic corridor
Mahmassani, H. S., & Jayakrishnan, R. (1991) · Transportation Research Part A: General · doi:10.1016/0191-2607(91)90145-g · Cited by 395
Network Models for Building Evacuation
Chalmet, L. G., Francis, R. L., & Saunders, P. B. (1982) · Management Science · doi:10.1287/mnsc.28.1.86 · Cited by 256
Metadata
- Authors
- Merchant, D. K., & Nemhauser, G. L.
- Venue
- Transportation Science
- Published
- 1978-08
- Volume
- 12
- Issue
- 3
- Pages
- 183-199
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W2114485638
- Cited by
- 632
- References
- 3
- FWCI
- 23.87
- 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 Model and an Algorithm for the Dynamic Traffic Assignment Problems. https://app.cochat.ai/papers/10.1287/trsc.12.3.183
- The paper
- Merchant, D. K., & Nemhauser, G. L. (1978). A Model and an Algorithm for the Dynamic Traffic Assignment Problems. Transportation Science. https://doi.org/10.1287/trsc.12.3.183
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.
