Abstract
The main goal of this paper is to present an extended model and a solution algorithm for the joint problem of train run rescheduling and track closure planning. Inclusion of the possibility of rerouting increases the complexity, on one hand, but potentially leads to better overall solutions, on the other. Presented and tested is a heuristic solution algorithm working under the assumption of obligatory character of both runs and closures. The algorithm finds both, time shifts of planned runs and execution times of closures while attempting to minimize the total time divergence of the new schedule as compared with the original schedule. This approach fits squarely into a concept of a multi-stage train run and closure selection and scheduling system which is referenced in this work.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Albrecht, A.R., Panton, D.M., Lee, D.H.: Rescheduling rail networks with maintenance disruptions using problem space search. Comput. Oper. Res. 40(3), 703–712 (2013)
Brannlund, U., Lindberg, P.O., Nou, A., Nilsson, J.-E.: Railway timetabling using Lagrangian relaxation. Transp. Sci. 32(4), 358–369 (1998)
Cacchiani, V., Huisman, D., Kidd, M., Kroon, L., Toth, P., Veelentruf, L., Wagenaar, J.: An overview of recovery models and algorithms for real-time railway rescheduling. Transp. Res. Part B Methodol. 63, 15–37 (2014)
Filcek, G., Gąsior, D., Hojda, M., Józefczyk, J.: Joint train rescheduling and track closures planning: model and solution algorithm. In: Borzemski, L., Grzech, A., Świątek, J., Wilimowska, Z. (eds.) Information Systems Architecture and Technology: Proceedings of 36th International Conference on Information Systems Architecture and Technology – ISAT 2015 – Part I. AISC, vol. 429, pp. 215–225. Springer, Heidelberg (2016). doi:10.1007/978-3-319-28555-9_19
Fokkert, J., Hertog, D., Berg, F., Verhoeven, J.: The Netherlands schedules track maintenance to improve track workers safety. Interfaces 37(2), 133–142 (2007)
Hojda, M.: Optimization of time shifts in train timetables and track closure schedules. In: Proceedings of Krajowa Konferencja Automatyzacji Procesw Dyskretnych 2016, Poland (in print, 2016)
Lid, T.: Survey of railway maintenance activities from a planning perspective and literature review concerning the use of mathematical algorithms for solving such planning and scheduling problems, Technical report, Linkpings universitet (2014)
Meng, L., Zhou, X.: Simultaneous train rerouting, rescheduling on an N-track network, : A model reformulation with network-based cumulative flow variables. Transp. Res. Part B: Methodological 67, 208–234 (2014)
Niu, H., Zhou, X.: Optimizing urban rail timetable under time-dependent demand and oversaturated conditions. Trans. Res. Part C: Emerg. Technol. 36, 212–230 (2013)
Schobel, A.: Capacity constraints in delay management. J. Public Transp. 1, 135–154 (2009)
Tornquist, J., Persson, J.: Train traffic deviation handling using tabu search and simulated annealing. In: Proceedings of 38th Hawaii International Conference on System Sciences, p. 73a. IEEE (2005)
Tornquist, J., Persson, J.: N-tracked railway traffic rescheduling during disturbances. Transp. Res. Part B 41, 342–362 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Hojda, M., Filcek, G. (2017). A Joint Problem of Track Closure Planning and Train Run Rescheduling with Detours. In: ÅšwiÄ…tek, J., Tomczak, J. (eds) Advances in Systems Science. ICSS 2016. Advances in Intelligent Systems and Computing, vol 539. Springer, Cham. https://doi.org/10.1007/978-3-319-48944-5_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-48944-5_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-48943-8
Online ISBN: 978-3-319-48944-5
eBook Packages: EngineeringEngineering (R0)