The DOI matches its Crossref record; 38 of the 39 references it cites were found in a registry or an index.
Timetable Optimization for Metro Lines Connecting to Intercity Railway Stations to Minimize Passenger Waiting Time
Abstract
In major metropolitan cities, metro and intercity rail services usually share stations or have stations in close proximity to facilitate smooth connections for passengers. A large number of passengers may arrive on metro platforms within a short period of time upon the arrivals of intercity trains, while the number may drop significantly afterward. This injected passenger demand is not coped well by the metro timetable with the commonly adopted regular train headway. Focusing on metro lines connecting to intercity railways, this study puts forward a timetable model to optimize train headways at each station, assuming all passengers board the first train available. The objective is to minimize the total waiting time of passengers at platforms throughout the metro line, without changing the number of vehicle trips. To calculate the passenger waiting time accurately, a mathematical model is proposed to obtain the number of transfer passengers arriving at metro platform in each time interval, based on arrivals of intercity trains and transfer facilities at the station. A genetic algorithm, combined with interior-point algorithm, is developed to obtain the solution of the proposed timetable model. Real-life case studies show that the optimized timetable reduces the total passenger waiting time when compared with the current timetable and the solution of another model optimizing train departure times at the first station only. In addition, the peak number of passengers congregating at metro platforms drops significantly, which relieves passenger crowding on the platform.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002 · cited 1×
“GA is a powerful tool in solving such nonlinear and nonconvex optimization problems, for the advantage of quick searching of near-optimal solutions [37].”
BackgroundSelf-Organized Pedestrian Crowd Dynamics: Experiments, Simulations, and Design Solutions
Helbing, D., Buzna, L., Johansson, A., & Werner, T. (2005) · Transportation Science · doi:10.1287/trsc.1040.0108 · Cited by 1,471 · cited 2×
“Given this information and the layout of facilities at the station, simulation is a possible way to obtain the ARTP at metro platforms by incorporating Social Force Model [13], Cellular Automaton Model [14], Agent-based Model [15] to depict passenger behaviors in walking and queueing.”
MethodTime Series Prediction Using Support Vector Machines: A Survey
Sapankevych, N., & Sankar, R. (2009) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2009.932254 · Cited by 1,129 · cited 1×
“Typical causality-based models include neural networks [10] and support-vector machine [11], which are able to map any complex relationships.”
BackgroundCellular automata microsimulation for modeling bi-directional pedestrian walkways
Blue, V. J., & Adler, J. L. (2001) · Transportation Research Part B: Methodological · doi:10.1016/s0191-2615(99)00052-1 · Cited by 703 · cited 2×
“Given this information and the layout of facilities at the station, simulation is a possible way to obtain the ARTP at metro platforms by incorporating Social Force Model [13], Cellular Automaton Model [14], Agent-based Model [15] to depict passenger behaviors in walking and queueing.”
MethodTraffic Flow Forecasting: Comparison of Modeling Approaches
Smith, B. L., & Demetsky, M. J. (1997) · Journal of Transportation Engineering · doi:10.1061/(asce)0733-947x(1997)123:4(261 · Cited by 681
The Statistics of Crowd Fluids
HENDERSON, L. F. (1971) · Nature · doi:10.1038/229381a0 · Cited by 657 · cited 1×
“covered that passenger walking speed follows Gaussian distribution [36].”
BackgroundOptimizing 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 · cited 2×
“Taking into account the detailed time-varying passenger demand and train capacity constraint, a series of nonlinearity models were developed to optimize train timetable to minimize PWT [12], [25].”
MethodWilliams, B. M., Durvasula, P. K., & Brown, D. E. (1998) · Transportation Research Record: Journal of the Transportation Research Board · doi:10.3141/1644-14 · Cited by 514 · cited 1×
“The classical time series models include historical average model [6], exponential smoothing model [7], and autoregressive integrated moving average model [7,8].”
MethodNiu, H., Zhou, X., & Gao, R. (2015) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2015.03.004 · Cited by 460 · cited 3×
“The average waiting time of each passenger is then set as 50% of train headway, and optimization models on train arrival and departure times at all stations were proposed to minimize PWT [27]–[29].”
BackgroundMethodMultivariate Vehicular Traffic Flow Prediction: Evaluation of ARIMAX Modeling
Williams, B. M. (2001) · Transportation Research Record: Journal of the Transportation Research Board · doi:10.3141/1776-25 · Cited by 458 · cited 1×
“The classical time series models include historical average model [6], exponential smoothing model [7], and autoregressive integrated moving average model [7,8].”
Method
Cited by
Darsena, D., Gelli, G., Iudice, I., & Verde, F. (2023) · IEEE Sensors Journal · doi:10.1109/jsen.2022.3223297 · Cited by 71
“Crowd prediction algorithms for transport applications can be classified on the basis of the prediction horizon into short-term (less than 60 minutes) and long-term ones [67].”
BackgroundMethodA review of railway feeding infrastructures: Mathematical models for planning and operation
Arboleyá, P., Mayet, C., Mohamed, B., Aguado, J. A., & de la Torre, S. (2020) · eTransportation · doi:10.1016/j.etran.2020.100063 · Cited by 41
Metro timetable optimization for improving regenerative braking energy utilization efficiency
Zhang, Z., Zhao, H., Yao, X., Xing, Z., & Liu, X. (2024) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2024.141970 · Cited by 27
Xie, J., Zhan, S., Wong, S. C., & Lo, S. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2022.3173925 · Cited by 19
“Many methods have been proposed to solve this problem, including genetic algorithm [28]–[31], Lagrangian duality theory [32], alternating direction method”
MethodTransport capacity analysis for sharing-corridor metro lines under virtual coupling
Wang, P., Ge, J., Xiao, X., Ye, Y., & Lu, M. (2024) · Computers & Industrial Engineering · doi:10.1016/j.cie.2024.110217 · Cited by 17
Metadata
- Authors
- Bai, Y., Hu, Q., Ho, T. K., Guo, H., & Mao, B.
- Affiliations
- Beijing Jiaotong University (CN)
- Anhui Transport Consulting & Design Institute (China) (CN)
- Venue
- IEEE Transactions on Intelligent Transportation Systems
- Published
- 2021-01
- Volume
- 22
- Issue
- 1
- Pages
- 79-90
- ISSN
- 1524-9050 (ISSN-L)
- 1558-0016
- OpenAlex
- W2994235265
- Cited by
- 33
- References
- 39
- Citations by year
- 2026: 5 · 2025: 9 · 2024: 10 · 2023: 3 · 2022: 5
- FWCI
- 1.11
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Intelligent Transportation Systems (publishedVersion)
- Funders
- National Natural Science Foundation of China (71971016, 71621001)
- Topics
- Social Sciences › Transportation › Railway Systems and Energy Efficiency
- Social Sciences › Transportation › Transportation Planning and Optimization
- Physical Sciences › Engineering › Aerospace Engineering › Air Traffic Management and Optimization
- Keywords
- train headway, passenger waiting time, transfer passengers, genetic algorithm, interior point methods, vehicle trips
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: Timetable Optimization for Metro Lines Connecting to Intercity Railway Stations to Minimize Passenger Waiting Time. https://app.cochat.ai/papers/10.1109/tits.2019.2954895
- The paper
- Bai, Y., Hu, Q., Ho, T. K., Guo, H., & Mao, B. (2021). Timetable Optimization for Metro Lines Connecting to Intercity Railway Stations to Minimize Passenger Waiting Time. IEEE Transactions on Intelligent Transportation Systems. https://doi.org/10.1109/tits.2019.2954895
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.