The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Single-line rail rapid transit timetabling under dynamic passenger demand
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
(1979) · Cited by 43,841
Ropke, S., & Pisinger, D. (2006) · Transportation Science · doi:10.1287/trsc.1050.0135 · Cited by 2,580
Apostol, T. M. (1957) · UCLA Biblioteca de Ingenieria Civil · Cited by 2,395
A Survey of Optimization Models for Train Routing and Scheduling
Cordeau, J., Toth, P., & Vigo, D. (1998) · Transportation Science · doi:10.1287/trsc.32.4.380 · Cited by 785
Transit network design and scheduling: A global review
Guihaire, V., & Hao, J.-K. (2008) · Transportation Research Part A: Policy and Practice · doi:10.1016/j.tra.2008.03.011 · Cited by 669
Urban Transit : Operations, Planning and Economics
Vuchic, V. R. (2005) · Cited by 549
Urban Transit: Operations, Planning and Economics
Smerk, G. M. (2006) · Transportation Journal · doi:10.2307/20713645 · Cited by 538
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 Mathematical Model for Periodic Scheduling Problems
Serafini, P., & Walter Ukovich, A. (1989) · SIAM Journal on Discrete Mathematics · doi:10.1137/0402049 · Cited by 499
Urban Transit Systems and Technology
Vuchic, V. R. (2007) · Wiley eBooks · doi:10.1002/9780470168066 · Cited by 487
Nominal and robust train timetabling problems
Cacchiani, V., & Toth, P. (2011) · European Journal of Operational Research · doi:10.1016/j.ejor.2011.11.003 · Cited by 379
A tabu search algorithm for rerouting trains during rail operations
Corman, F., D’Ariano, A., Pacciarelli, D., & Pranzo, M. (2009) · Transportation Research Part B Methodological · doi:10.1016/j.trb.2009.05.004 · Cited by 354
Optimizing Timetable Synchronization for Rail Mass Transit
Wong, R. C. W., Yuen, T. W. Y., Fung, K. W., & Leung, J. M. Y. (2008) · Transportation Science · doi:10.1287/trsc.1070.0200 · Cited by 335
Dispatching Policies for a Transportation Route
Newell, G. F. (1971) · Transportation Science · doi:10.1287/trsc.5.1.91 · Cited by 253
Exact formulations and algorithm for the train timetabling problem with dynamic demand
Barrena, E., Canca, D., Coelho, L. C., & Laporte, G. (2014) · Computers & Operations Research · doi:10.1016/j.cor.2013.11.003 · Cited by 232
Self-citationDeveloping railway timetables which guarantee a better service
Vansteenwegen, P., & Oudheusden, D. V. (2005) · European Journal of Operational Research · doi:10.1016/j.ejor.2004.12.013 · Cited by 150
A genetic algorithm approach to periodic railway synchronization
Nachtigall, K., & Voget, S. (1996) · Computers & Operations Research · doi:10.1016/0305-0548(95)00032-1 · Cited by 140
Design and analysis of demand‐adapted railway timetables
Canca, D., Barrena, E., Algaba, E., & Zarzo, A. (2014) · Journal of Advanced Transportation · doi:10.1002/atr.1261 · Cited by 133
Self-citationMetaheuristics for Scheduling in Industrial and Manufacturing Applications
Kacprzyk, J., Xhafa, F., & Abraham, A. (2008) · Studies in computational intelligence · doi:10.1007/978-3-540-78985-7 · Cited by 106
Ueber die Darstellbarkeit einer Function durch eine trigonometrische Reihe
Riemann, B. (2013) · Cambridge University Press eBooks · doi:10.1017/cbo9781139568050.013 · Cited by 88
A Genetic Algorithm for Railway Scheduling Problems
Tormos, P., Lova, A., Barber, F., Ingolotti, L., Abril, M. A., & Salido, M. Á. (2008) · Studies in computational intelligence · doi:10.1007/978-3-540-78985-7_10 · Cited by 79
A Case Study in Periodic Timetabling
Liebchen, C., & Möhring, R. H. (2002) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(04)80526-7 · Cited by 79
Bus Timetables with Even Passenger Loads as Opposed to Even Headways
Ceder, A. A. (2001) · Transportation Research Record Journal of the Transportation Research Board · doi:10.3141/1760-01 · Cited by 46
Iterated Greedy Algorithms for a Real-World Cyclic Train Scheduling Problem
Yuan, Z. J., Fügenschuh, A. R., Homfeld, H., Balaprakash, P., Stützle, T., & Schoch, M. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88439-2_8 · Cited by 24
A Cut-Based Heuristic to Produce Almost Feasible Periodic Railway Timetables
Liebchen, C. (2005) · Lecture notes in computer science · doi:10.1007/11427186_31 · Cited by 12
Cited by
Niu, H., Zhou, X., & Gao, R. (2015) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2015.03.004 · Cited by 460
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
Metadata
- Authors
- Barrena, E., Canca, D., Coelho, L. C., & Laporte, G.
- Venue
- Transportation Research Part B: Methodological
- Publisher
- Elsevier BV
- Published
- 2014-12
- Volume
- 70
- Pages
- 134-150
- ISSN
- 0191-2615 (ISSN-L)
- OpenAlex
- W2105470033
- Cited by
- 282
- References
- 25
- FWCI
- 23.24
- 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.