Abstract
Demand for railway transportation keeps on growing. Therefore, a thorough understanding of the capacity of railway networks is crucial. In this paper, the well-known compression method based on max-plus algebra is extended. A number of challenges are addressed to apply this compression method to large and complex networks, such as the one considered in this paper. Some trains have to be split artificially, while keeping the parts together during the compression. The trains should also be ordered explicitly, since there is no part of the infrastructure used by all trains. The results in this paper indicate that it is possible to thoroughly analyse the capacity by the adjusted compression method for large and complex networks, but the results should be interpreted with care. The results show, for instance, that the capacity occupation heavily depends on the size of the network that is considered and that it is not easy to give a clear, practical interpretation of the capacity occupation. Nevertheless, the method allowed to determine a number of critical paths and, even more importantly, a number of critical resources in the zones considered.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abril M, Barber F, Ingolotti L, Salido MA, Tormos P, Lova A (2008) An assessment of railway capacity. Transport Res Part E 44(5):774–806
Baccelli F, Cohen G, Olsder GJ, Quadrat JP (1992) Synchronization and linearity: an algebra for discrete event systems, New York, Wiley.
Bešinović N, Goverde RMP (2018) Capacity Assessment in Railway Networks. In: Borndörfer R, Klug T, Lamorgese L, Mannino C, Reuther M, Schlechte T (Eds) Handbook of Optimization in the railway Industry. International Series in Operations Research & Management Science, vol. 26. Springer, Cham, pp 25–45 https://doi.org/10.1007/978-3-319-72153-8_2
Bešinović N, Goverde RMP, Quaglietta E (2017) Microscopic models and network transformations for automated railway traffic planning. Comput-Aided Civil Infrastruct Eng 32(2):89–106. https://doi.org/10.1111/mice.12207
Butkovič P (2010) Max-linear systems: theory and algorithms. Springer Science & Business Media.
De Kort AF, Heidergott B, Van Egmond RJ, Hooghiemstra G (1999) Train movement analysis at railway stations: Procedures & evaluation of Wakob’s Approach. TRAIL Studies in Transportation Science, S99/1, Delft University Press.
Gestrelius S, Häll CH, Peterson A (2021) Capacity utilization, travel time, stability and heterogeneity—a linear programming analysis for railway timetabling. In Proceedings of the RailBeijing Conference, Beijing, China, 3–7 November 2021.
Heidergott B, Olsder GJ, Van Der Woude J (2014) Max plus at work. In Max Plus at Work. Princeton University Press
Jensen LW, Landex A, Nielsen OA, Kroon LG, Schmidt M (2017) Strategic assessment of capacity consumption in railway networks: framework and model. Transport Res Part C 74:126–149. https://doi.org/10.1016/j.trc.2016.10.013
Landex A, Kaas AH, Schittenhelm B, Schneider-Tilli J (2006) Practical use of the UIC 406 capacity leaflet by including timetable tools in the investigations. WIT Transact Built Environ 88:643–652. https://doi.org/10.2495/CR060631
Lindner T (2011) Applicability of the analytical UIC Code 406 compression method for evaluating line and station capacity. J Rail Transport Planning Manag 1(1):49–57. https://doi.org/10.1016/j.jrtpm.2011.09.002
Pascariu B, Coviello N, D’Ariano A (2021) Railway freight node capacity evaluation: a timetable-saturation approach and its application to the Novara freight terminal. Transport Res Proc 52:155–162
Pellegrini P, Marlière G, Pesenti R, Rodriguez J (2015) RECIFE-MILP: an effective MILP-based heuristic for the real-time railway traffic management problem. IEEE Trans Intell Transp Syst 16(5):2609–2619
UIC (2004) Capacity (UIC Code 406) (1st edition).
UIC (2013) Capacity (UIC Code 406) (Issue 2nd edition).
Weik N, Warg J, Johansson I, Bohlin M, Nießen N (2020) Extending UIC 406-based capacity analysis–New approaches for railway nodes and network effects. J Rail Transport Plann Manag 15:100199
Acknowledgements
The authors would like to thank Infrabel, the Belgian railway infrastructure manager, and NMBS, the Belgian railway passenger operator for their collaboration and support.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Uyttendaele, J., Van Hoeck, I., Besinovic, N. et al. Timetable compression using max-plus automata applied to large railway networks. TOP 31, 414–439 (2023). https://doi.org/10.1007/s11750-022-00641-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11750-022-00641-5