An algorithm for train delay propagation on double-track railway lines under FCFS management

Abstract

This paper proposes an algorithm for train delay propagation on double-track railway lines under First-Come-First-Serve (FCFS) management. The objective is to handle the challenges faced by the dispatchers as they encounter train delays and their effects on the functioning of the railway system. We assume that the location and duration of disruptions are known, which are important inputs to the algorithm. This data enables calculation of delays experienced by each affected train. Our method analyzes factors such as train schedules, track capacities, and operation constraints to assess the manner in which delays would get propagated along railway lines. Key indicators of delay propagation, consisting of the number of delayed trains and stations, disruption settling time, and cumulative delays, are considered. Moreover, a numerical example is given to explain the practical application of this algorithm. Finally, we show that a tool like this would facilitate the dispatchers in managing and rescheduling trains in case of delays and will be improving resilience and efficiency of railway operations.

Graphical abstract

Keywords

train delay propagation / FCFS management / cumulative delays

References

[1] Carey M, (1999). Ex ante heuristic measures of schedule reliability. Transportation Research Part B: Methodological, 33( 7): 473–494

[2] Carey M, Kwieciński A, (1995). Properties of expected costs and performance measures in stochastic models of scheduled transport. European Journal of Operational Research, 83( 1): 182–199

[3] Frank O, (1966). Two-way traffic on a single line of railway. Operations Research, 14( 5): 801–811

[4] Goverde R M P, (2007). Railway timetable stability analysis using max-plus system theory. Transportation Research Part B: Methodological, 41( 2): 179–201

[5] Goverde R M P, (2010). A delay propagation algorithm for large-scale railway traffic networks. Transportation Research Part C: Emerging Technologies, 18( 3): 269–287

[6] HansenI AGoverdeR M Pvan der MeerD J (2010). Online train delay recognition and running time prediction. In: Proceedings of 13th International IEEE Conference on Intelligent Transportation Systems, IEEE, 1783–1788

[7] Harrod S, Cerreto F, Nielsen O A, (2019). A closed form railway line delay propagation model. Transportation Research Part C: Emerging Technologies, 102: 189–209

[8] Higgins A J, Kozan E, (1998). Modeling train delays in urban networks. Transportation Science, 32( 4): 346–357

[9] Huang P, Spanninger T, Corman F, (2022). Enhancing the understanding of train delays with delay evolution pattern discovery: A clustering and bayesian network approach. IEEE Transactions on Intelligent Transportation Systems, 23( 9): 15367–15381

[10] Jovanović P, Kecman P, Bojović N, Mandić D, (2017). Optimal allocation of buffer times to increase train schedule robustness. European Journal of Operational Research, 256( 1): 44–54

[11] Khan A, Ma H, Chung S, Wen X, (2021). Hierarchical integrated machine learning model for predicting flight departure delays and duration in series. Transportation Research Part C: Emerging Technologies, 129: 103225

[12] Li X, Shou B, Ralescu D, (2014). Train rescheduling with stochastic recovery time: A new track-backup approach. IEEE Transactions on Systems, Man, and Cybernetics. Systems, 44( 9): 1216–1233

[13] Li Z, Wen C, Hu R, Xu C, Huang P, Jiang X, (2021). Near-term train delay prediction in the dutch railways network. International Journal of Rail Transportation, 9( 6): 520–539

[14] Lian W, Wu X, Zhou M, Lü J, Dong H, (2024). Bi-directional delay propagation analysis and modeling for high-speed railway networks under disturbance. IEEE Transactions on Computational Social Systems, 11( 3): 3207–3217

[15] Liu Q, Wang S, Li Z, Li L, Zhang J, Wen C, (2023a). Prediction of high-speed train delay propagation based on causal text information. Railway Engineering Science, 31( 1): 89–106

[16] Liu X, Zhou M, Dong H, Wu X, Li Y, Wang F, (2023b). Admm-based joint rescheduling method for high-speed railway timetabling and platforming in case of uncertain perturbation. Transportation Research Part C: Emerging Technologies, 152: 104150

[17] Lu C, Pan Y, Cai C, (2021). Reliability guarantee framework for the Sichuan–Tibet railway. Frontiers of Engineering Management, 8( 4): 480–491

[18] Meester L E, Muns S, (2007). Stochastic delay propagation in railway networks and phase-type distributions. Transportation Research Part B: Methodological, 41( 2): 218–230

[19] Petersen E R, (1974). Over-the-road transit time for a single track railway. Transportation Science, 8( 1): 65–74

[20] Şahin İ, (2017). Markov chain model for delay distribution in train schedules: Assessing the effectiveness of time allowances. Journal of Rail Transport Planning & Management, 7( 3): 101–113

[21] SalidoM ABarberFIngolottiL (2008). Robustness in railway transportation scheduling. In: Proceedings of 7th World Congress on Intelligent Control and Automation, IEEE, 2880–2885

[22] Spanninger T, Trivella A, Büchel B, Corman F, (2022). A review of train delay prediction approaches. Journal of Rail Transport Planning & Management, 22: 100312

[23] Tiong K, Ma Z, Palmqvist C, (2023). A review of data-driven approaches to predict train delays. Transportation Research Part C: Emerging Technologies, 148: 104027

[24] Wendler E, (2007). The scheduled waiting time on railway lines. Transportation Research Part B: Methodological, 41( 2): 148–158

[25] Ye Y, Zhang J, (2020). Accident-oriented delay propagation in high-speed railway network. Journal of Transportation Engineering. Part A: Systems, 146( 4): 04020011

[26] Zhang C, Gao Y, Cacchiani V, Yang L, Gao Z, (2023a). Train rescheduling for large-scale disruptions in a large-scale railway network. Transportation Research Part B: Methodological, 174: 102786

[27] Zhang P, Yang X, Wu J, Sun H, Wei Y, Gao Z, (2023b). Coupling analysis of passenger and train flows for a large-scale urban rail transit system. Frontiers of Engineering Management, 10( 2): 250–261

Competing Interests

The authors declare that they have no competing interests.

RIGHTS & PERMISSIONS

2024 Higher Education Press