The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem
Abstract
Recently, Daganzo introduced the cell transmission model—a simple approach for modeling highway traffic flow consistent with the hydrodynamic model. In this paper, we use the cell transmission model to formulate the single destination System Optimum Dynamic Traffic Assignment (SO DTA) problem as a Linear Program (LP). We demonstrate that the model can obtain insights into the DTA problem, and we address various related issues, such as the concept of marginal travel time in a dynamic network and system optimum necessary and sufficient conditions. The model is limited to one destination and, although it can account for traffic realities as they are captured by the cell transmission model, it is not presented as an operational model for actual applications. The main objective of the paper is to demonstrate that the DTA problem can be modeled as an LP, which allows the vast existing literature on LP to be used to better understand and compute DTA. A numerical example illustrates the simplicity and applicability of the proposed approach.
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
Linear and nonlinear programming.
(1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90092-3 · Cited by 4,805
On kinematic waves II. A theory of traffic flow on long crowded roads
Lighthill, M. J., & Whitham, G. B. (1955) · Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences · doi:10.1098/rspa.1955.0089 · Cited by 4,590
Richards, P. I. (1956) · Operations Research · doi:10.1287/opre.4.1.42 · Cited by 3,645
Daganzo, C. F. (1994) · Transportation Research Part B: Methodological · doi:10.1016/0191-2615(94)90002-7 · Cited by 2,901
Linear and Nonlinear Programming
Luenberger, D. G., & Ye, Y. (2008) · International Series in Operations Research & Management Science · doi:10.1007/978-0-387-74503-9 · Cited by 2,804
Urban transportation networks: Equilibrium analysis with mathematical programming methods
(1986) · Transportation Research Part A: General · doi:10.1016/0191-2607(86)90023-3 · Cited by 2,349
The cell transmission model, part II: Network traffic
Daganzo, C. F. (1995) · Transportation Research Part B: Methodological · doi:10.1016/0191-2615(94)00022-r · Cited by 1,938
On kinematic waves I. Flood movement in long rivers
Lighthill, M. J., & Whitham, G. B. (1955) · Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences · doi:10.1098/rspa.1955.0088 · Cited by 1,622
A Model and an Algorithm for the Dynamic Traffic Assignment Problems
Merchant, D. K., & Nemhauser, G. L. (1978) · Transportation Science · doi:10.1287/trsc.12.3.183 · Cited by 632
Optimality Conditions for a Dynamic Traffic Assignment Model
Merchant, D. K., & Nemhauser, G. L. (1978) · Transportation Science · doi:10.1287/trsc.12.3.200 · Cited by 324
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
Self-citationRobotic load balancing for mobility-on-demand systems
Pavone, M., Smith, S. L., Frazzoli, E., & Rus, D. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364912444766 · Cited by 287
Congestion-aware system optimal route choice for shared autonomous vehicles
Levin, M. W. (2017) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2017.06.020 · Cited by 152
Laszka, A., Abbas, W., Vorobeychik, Y., & Koutsoukos, X. (2020) · Cyber-Physical Systems · doi:10.1080/23335777.2019.1624620 · Cited by 22
Metadata
- Authors
- Ziliaskopoulos, A. K.
- Venue
- Transportation Science
- Published
- 2000-02
- Volume
- 34
- Issue
- 1
- Pages
- 37-49
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W2120646221
- Cited by
- 498
- References
- 12
- FWCI
- 34.80
- 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 Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem. https://app.cochat.ai/papers/10.1287/trsc.34.1.37.12281
- The paper
- Ziliaskopoulos, A. K. (2000). A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem. Transportation Science. https://doi.org/10.1287/trsc.34.1.37.12281
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.
