×

Integration of timetable planning and rolling stock in rapid transit networks. (English) Zbl 1251.90082

Summary: The aim of this paper is to propose an integrated planning model to adequate the offered capacity and system frequencies to attend the increased passenger demand and traffic congestion around urban and suburban areas. The railway capacity is studied in line planning, however, these planned frequencies were obtained without accounting for rolling stock flows through the rapid transit network.
In order to provide the problem more freedom to decide rolling stock flows and therefore better adjusting these flows to passenger demand, a new integrated model is proposed, where frequencies are readjusted. Then, the railway timetable and rolling stock assignment are also calculated, where shunting operations are taken into account. These operations may sometimes malfunction, causing localized incidents that could propagate throughout the entire network due to cascading effects. This type of operations will be penalized with the goal of selectively avoiding them and ameliorating their high malfunction probabilities. Swapping operations will also be ensured using homogeneous rolling stock material and ensuring parkings in strategic stations.
We illustrate our model using computational experiments drawn from RENFE (the main Spanish operator of suburban passenger trains) in Madrid, Spain. The results show that through this integrated approach a greater robustness degree can be obtained.

MSC:

90B20 Traffic problems in operations research
90B06 Transportation, logistics and supply chain management
90C90 Applications of mathematical programming

Software:

PESPLib

References:

[1] Alfieri, A., Groot, R., Kroon, L. G., & Schrijver, A. (2006). Efficient circulation of railway rolling stock. Transportation Science, 40, 378–391. · doi:10.1287/trsc.1060.0155
[2] Brännlund, U., Lindberg, P. O., Nou, A., & Nilsson, J. E. (1998). Railway timetabling using Lagrangian relaxation. Transportation Science, 32, 358–369. · Zbl 1004.90035 · doi:10.1287/trsc.32.4.358
[3] Ben-Khedher, N., Kintanar, J., Queille, C., & Stripling, W. (1998). Schedule optimization at SNCF: from conception to day of departure. Interfaces, 28, 6–23. · doi:10.1287/inte.28.1.6
[4] Cacchiani, V., Caprara, A., & Toth, P. (2010). Scheduling extra freight trains on railway networks. Transportation Research. Part B: Methodological, 44(2), 215–231. · doi:10.1016/j.trb.2009.07.007
[5] Cadarso, L., & Marín, A. (2011). Robust rolling stock in rapid transit networks. Computers & Operations Research, 38(8), 1131–1142. · Zbl 1208.90041 · doi:10.1016/j.cor.2010.10.029
[6] Caprara, A., Fischetti, M., & Toth, P. (2002). Modeling and solving the train timetabling problem. Operations Research, 50, 851–861. · Zbl 1163.90482 · doi:10.1287/opre.50.5.851.362
[7] Caprara, A., Monaci, M., Toth, P., & Guida, P. L. (2006). A Lagrangian heuristic approach to real-world train timetabling problems. Discrete Applied Mathematics, 154, 738–753. · Zbl 1120.90324 · doi:10.1016/j.dam.2005.05.026
[8] Caprara, A., Kroon, L., Monaci, M., Peeters, M., & Toth, P. (2007). Passenger railway optimization. In C. Barnhart & G. Laporte (Eds.), Handbook in operations research and management science (vol. 14). Elsevier: Amsterdam.
[9] Carraresi, P., Malucelli, F., & Pallottino, S. (1996). Regional mass transit assignment with resource constraints. Transportation Research. Part B: Methodological, 30(2), 81–98. · doi:10.1016/0191-2615(95)00027-5
[10] Cordeau, J. F., Soumis, F., & Desrosiers, J. (2000). A Benders decomposition approach for the locomotive and car assignment problem. Transportation Science, 34, 133–149. · Zbl 1004.90045 · doi:10.1287/trsc.34.2.133.12308
[11] Cordeau, J. F., Desaulniers, G., Lingaya, N., Soumis, F., & Desrosiers, J. (2001). Simultaneous locomotive and car assignment at VIA Rail Canada. Transportation Research. Part B: Methodological, 35, 767–787. · doi:10.1016/S0191-2615(00)00022-9
[12] Fioole, P. J., Kroon, L. G., Maróti, G., & Schrijver, A. (2006). A rolling stock circulation model for combining and splitting of passenger trains. European Journal of Operational Research, 174(2), 1281–1297. · Zbl 1102.90312 · doi:10.1016/j.ejor.2005.03.032
[13] Kroon, L. G., & Peeters, L. W. P. (2003). A variable trip time model for cyclic railway timetabling. Transportation Science, 37, 198–212. · doi:10.1287/trsc.37.2.198.15247
[14] Liebchen, C., & Möhring, R. H. (2008). The modeling power of the periodic event scheduling problem: railway timetables–and beyond. In Lecture notes in economics and mathematical systems: Vol. 600 (II). Computer-aided Systems in Public Transport (pp. 117–150). · Zbl 1168.90459
[15] Maróti, G. (2006). Operations research models for railway rolling stock planning. PhD thesis, Eindhoven, Technische Universiteit Eindhoven.
[16] Mellouli, T., & Suhl, L. (2007). Rotation planning of locomotive and carriage groups with shared capacities. In F. Geraets, L. G. Kroon, A. Schöbel, D. Wagner, & C. Zaroliagis (Eds.), Algorithmic methods for railway optimization. Berlin: Springer.
[17] Nachtingall, K. (1996). Periodic network optimization with different arc frequencies. Discrete Applied Mathematics, 69, 1–17. · Zbl 0856.90118 · doi:10.1016/0166-218X(95)00073-Z
[18] Nachtingall, K., & Voget, S. (1997). Minimizing waiting times in integrated fixed interval timetables by upgrading railway tracks. European Journal of Operational Research, 103, 610–627. · Zbl 0921.90068 · doi:10.1016/S0377-2217(96)00284-6
[19] Serafini, P., & Ukovich, W. (1989). A mathematical model for periodic event scheduling problems. SIAM Journal on Discrete Mathematics, 2, 550–581. · Zbl 0676.90030 · doi:10.1137/0402049
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.