Platforming Trains in Multi-Line Stations Under Flexible Track Utilization Policy

Articles in Press

Document Type : Original paper

Authors

1 Department of Industrial Engineering, Engineering Faculty, Eşkisehir Technical University, Türkiye

2 Industrial Engineering Department, Faculty of Engineering and Architecture, Eskişehir Osmangazi University, Eskişehir, Türkiye

Abstract

In railway stations, there are two track utilization policies: fixed and flexible. Under fixed track utilization, platform tracks are grouped as inbound and outbound parts associated with directions. The trains from the same direction occupy the tracks in each part, and the platforming problem can be considered separately. Under flexible track utilization rule, trains can be assigned to any platform track considering the station layout, which provides more flexibility when platforming. However, it naturally causes a more complex platforming problem. In this paper, we address the train platforming problem in a multi-directional station under flexible track utilization policy. A mixed-integer linear programming formulation is proposed to assign trains to the station’s resources without conflict routes. The objective function is to minimize total weighted delays of trains in which weight refers to the importance level of each train. Previously published studies have only been carried out in small stations with limited trains. However, this study considers busy and complex stations, accommodating more than 1000 trains, and unlike the previous studies, a genetic algorithm is proposed to obtain near-optimal solutions in a short time. Computational analyses are conducted on derived test problems. We construct test problems based on planning periods and traffic volume levels. The performances of the mathematical model and the genetic algorithm are presented in terms of both solution quality and solution time.

Keywords

Main Subjects

References

[1] A. Billionnet, Using integer programming to solve the train-platforming problem, Transportation Science 37 (2003), no. 2, 213–222. https://doi.org/10.1287/trsc.37.2.213.15250
[2] A. Caprara, L. Galli, and P. Toth, Solution of the train platforming problem, Transportation Science 45 (2011), no. 2, 246–257. https://doi.org/10.1287/trsc.1100.0366
[3] D.D.L. Cardillo and N. Mione, k L-list $\lambda$ colouring of graphs, European J. Oper. Res. 106 (1998), no. 1, 160–164.
[4] M. Carey and S. Carville, Scheduling and platforming trains at busy complex stations, Transportation Research Part A: Policy and Practice 37 (2003), no. 3, 195–224. https://doi.org/10.1016/S0965-8564(02)00012-5
[5] F. Corman, R.M. Goverde, and A. D’Ariano, Rescheduling dense train traffic over complex station interlocking areas, Robust and online large-scale optimization: models and techniques for transportation systems 5868 (2009), 369–386.
https://doi.org/10.1007/978-3-642-05465-5_16
[6] Y. Gao, L. Kroon, L. Yang, and Z. Gao, Three-stage optimization method for the problem of scheduling additional trains on a high-speed rail corridor, Omega 80 (2018), 175–191. https://doi.org/10.1016/j.omega.2017.08.018
 [7] R. García-Ródenas, M.L. López-García, L. Cadarso, and E. Codina, An efficient greedy heuristic for the real-time train platforming problem, Computers and Operations Research 164 (2024), 106525. https://doi.org/10.1016/j.cor.2023.106525
[8] J.H. Holland, Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence, MIT press, 1992.
[9] R.M. Lusby, J. Larsen, M. Ehrgott, and D. Ryan, Railway track allocation: models and methods, OR spectrum 33 (2011), no. 4, 843–883. https://doi.org/10.1007/s00291-009-0189-0
[10] J. Rodriguez, A constraint programming model for real-time train scheduling at junctions, Transportation Research Part B: Methodological 41 (2007), no. 2, 231–245. https://doi.org/10.1016/j.trb.2006.02.006
[11] P. Sels, P. Vansteenwegen, T. Dewilde, D. Cattrysse, B. Waquet, and A. Joubert, The train platforming problem: The infrastructure management company perspective, Transportation Research Part B: Methodological 61 (2014), 55–72.
https://doi.org/10.1016/j.trb.2014.01.004
[12] Z. Yao, L. Nie, and Z. He, A genetic algorithm for heterogeneous high-speed railway timetabling with dense traffic: The train-sequence matrix encoding scheme, Journal of Rail Transport Planning and Management 23 (2022), 100334.
https://doi.org/10.1016/j.jrtpm.2022.100334
[13] B. Zhang, Y. Zhang, A. D’Ariano, T. Bosi, G. Lu, and Q. Peng, Optimal platforming, routing, and scheduling of trains and locomotives in a rail passenger station yard, Transportation Research Part C: Emerging Technologies 152 (2023),
104160. https://doi.org/10.1016/j.trc.2023.104160
[14] H. Zhang, M. Guo, L. Hu, and G. Lu, A multi-agent simulation based train platforming research for facilitating passenger transfer in a high-speed railway station, Simulation Modelling Practice and Theory 130 (2024), 102856.
https://doi.org/10.1016/j.simpat.2023.102856
[15] Q. Zhang, R.M. Lusby, P. Shang, and X. Zhu, Simultaneously re-optimizing timetables and platform schedules under planned track maintenance for a high-speed railway network, Transportation Research Part C: Emerging Technologies
121 (2020), 102823. https://doi.org/10.1016/j.trc.2020.102823
[16] Q. Zhang, X. Zhu, and L. Wang, Track allocation optimization in high-speed railway stations from infrastructure management and service perspectives, Measurement and Control 51 (2018), no. 7-8, 243–259. https://doi.org/10.1177/0020294018785187
[17] Q. Zhang, X. Zhu, and L. Wang, Track allocation optimization in multi-direction high-speed railway stations, Symmetry 11 (2019), no. 4, 459. https://doi.org/10.3390/sym11040459
[18] Q. Zhang, X. Zhu, L. Wang, and S. Wang, Simultaneous optimization of train timetabling and platforming problems for high-speed multiline railway network, Journal of Advanced Transportation 2021 (2021), no. 1, 1–16. https://doi.org/10.1155/2021/6679008
[19] Y. Zhang, R. Hu, Q. Zeng, Y. Wang, Y. Liu, and S. Huang, Optimal train platforming with shunting operations for multidirectional passenger stations: A case study of guangzhou station, Mathematics 11 (2023), no. 14, Article number:
3136. https://doi.org/10.3390/math11143136
[20] Y. Zhang, Q. Zhong, Y. Yin, X. Yan, and Q. Peng, A fast approach for reoptimization of railway train platforming in case of train delays, Journal of Advanced Transportation 2020, no. 1, 560952. https://doi.org/10.1155/2020/5609524
[21] J. Zhong, X. Hu, J. Zhang, and M. Gu, Comparison of performance between different selection strategies on simple genetic algorithms, Proc. Int. Conf. on Computational Intelligence for Modelling, Control and Automation (CIMCA-
IAWTIC’06), IEEE, 2005, pp. 1115–1121.
[22] P.J. Zwaneveld, L.G. Kroon, H.E. Romeijn, M. Salomon, S. Dauzere-Peres, S.P. Van Hoesel, and H.W. Ambergen, Routing trains through railway stations: Model formulation and algorithms, Transportation Science 30 (1996), no. 3, 181–194.
https://doi.org/10.1287/trsc.30.3.181
[23] P.J. Zwaneveld, L.G. Kroon, and S.P. Van Hoesel, Routing trains through a railway station based on a node packing model, European J. Oper. Res. 128 (2001), no. 1, 14–33. https://doi.org/10.1016/S0377-2217(00)00087-4
Communications in Combinatorics and Optimization

Articles in Press, Accepted Manuscript
Available Online from 28 May 2026

Files

Share

How to cite

Statistics