The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Control Strategies for an Idealized Public Transportation System
Abstract
Vehicles load passengers at a single service point and, after traversing some route, return for another trip. The travel times of successive trips are independent identically distributed random variables with a known distribution function. After a vehicle returns to the service point, one has the option of holding it, or dispatching it immediately. Passengers arrive at a uniform rate and the objective is to minimize the average wait per passenger. The problem of determining the optimal strategy (dispatch or hold) for a system of m vehicles is formulated as a dynamic programming problem. It is analyzed in detail for m = 1 and m = 2. For m = 1, the optimal strategy will hold a vehicle if it returns within less than about half the mean trip time. For m = 2, and for a small coefficient of variation of trip time C(T), the optimal strategy will control the vehicles so as to retain nearly equally spaced dispatch times, within a range of time proportional to C 4/3(T).
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Dynamic Programming and Markov Processes.
Freimer, M., & Howard, R. A. (1961) · Journal of the American Statistical Association · doi:10.2307/2282268 · Cited by 3,378
Cited by
Optimizing urban rail timetable under time-dependent demand and oversaturated conditions
Niu, H., & Zhou, X. (2013) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2013.08.016 · Cited by 523
A headway-based approach to eliminate bus bunching: Systematic analysis and comparisons
Daganzo, C. F. (2009) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2009.04.002 · Cited by 406
Reducing bunching with bus-to-bus cooperation
Daganzo, C. F., & Pilachowski, J. (2011) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2010.06.005 · Cited by 325
Demand-driven timetable design for metro services
Sun, L., Jin, J. G., Lee, D.-H., Axhausen, K. W., & Erath, A. (2014) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2014.06.003 · Cited by 304
The Holding Problem with Real–Time Information Available
Eberlein, X. J., Wilson, N. H. M., & Bernstein, D. (2001) · Transportation Science · doi:10.1287/trsc.35.1.1.10143 · Cited by 293
Xuan, Y., Argote, J., & Daganzo, C. F. (2011) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2011.07.009 · Cited by 274
Public transport for smart cities: Recent innovations and future challenges
Kuo, Y.-H., Leung, J. M. Y., & Yan, Y. (2023) · European Journal of Operational Research · doi:10.1016/j.ejor.2022.06.057 · Cited by 201
Real-time holding control for high-frequency transit with dynamics
Sánchez-Martínez, G. E., Koutsopoulos, H. N., & Wilson, N. H. M. (2016) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2015.11.013 · Cited by 125
Design and implementation of bus-holding control strategies with real-time information
Fu, L., & Yang, X. (2002) · Transportation Research Record: Journal of the Transportation Research Board · doi:10.3141/1791-02 · Cited by 116
A predictive-control framework to address bus bunching
Andres, M., & Nair, R. (2017) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2017.06.013 · Cited by 95
Bai, Y., Hu, Q., Ho, T. K., Guo, H., & Mao, B. (2021) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2019.2954895 · Cited by 33
“This is easy for implementation and it minimizes passenger waiting time (PWT) when passenger demand at stations follows Uniform distributions [1].”
BackgroundBus bunching: a comprehensive review from demand, supply, and decision-making perspectives
Rezazada, M., Nassir, N., Tanin, E., & Ceder, A. (. (2024) · Transport Reviews · doi:10.1080/01441647.2024.2313969 · Cited by 26
Quek, W. L., Chung, N. N., Saw, V.-L., & Chew, L. Y. (2021) · Complexity · doi:10.1155/2021/2606191 · Cited by 10
Metadata
- Authors
- Osuna, E. E., & Newell, G. F.
- Venue
- Transportation Science
- Published
- 1972-02
- Volume
- 6
- Issue
- 1
- Pages
- 52-72
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W2071277963
- Cited by
- 409
- References
- 1
- FWCI
- 23.41
- 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.