Abstract
Currently, many railway operators are increasing the frequencies of their trains. By condensing the timetable, routing trains becomes increasingly difficult as the chosen routes not only have to meet safety restrictions, but also guarantee some stability if delays occur.
We address the problem of routing trains through railway stations for a given timetable and outline two algorithms. The first algorithm searches for a feasible solution for the train routing problem based on an independent set modeling that is solved using a fixed-point iteration method. The initial solution is then amended by applying the second algorithm in order to increase the time slot of a chosen route, i.e. the time interval during which a train may arrive and find its designated route open. This algorithm is based on a local search optimization scheme.
Results showed that the fixed-point iteration found feasible solutions within minutes even for difficult cases, i.e. tight timetables. Though more time-consuming, the second algorithm allowed the average time slot length to be doubled, thus implying that it is possible to find routings which are more delay-tolerant. This helps to decrease impacts of late trains.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
P.J. Zwaneveld, S. Dauzère-Pérès, S.P.M van Hoesel, L.G. Kroon, H.E. Romeijn, M. Salomon, and H.A. Ambergen. Routing Trains through Railway Stations: Model Formulation and Algorithms. In Transportation Science. 30(3):181–194, 1996.
L.G. Kroon, H.E. Romeijn, P.J. Zwanefeld. Routing Trains through Railway Stations: Complexity Issues. In European Journal of Operational Research. 98:485–498, 1997.
P.J. Zwanefeld, L.G. Kroon, S.P.M van Hoesel. Routing Trains through a Railway Station based on a Node Packing Model. In METEOR, Research Memoranda. 015, 1997.
G. Caimi. Routing mit Zielfunktion für den Bahnhof Bern. In IFOR, Diploma Thesis. 2004.
M. Burkard, M. Cochand, A. Gaillard. A Dynamical System Based Heuristic for a Class of Constrained Semi-Assignment Problems. In Operations Research Proceedings. 182–191, Springer 1998.
M. Cochand. A Fixed Point Operator for the Generalised Maximum Satisfiability Problem. In Discrete Applied Mathematics. 46:117–132, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caimi, G., Burkolter, D., Herrmann, T. (2005). Finding Delay-Tolerant Train Routings through Stations. In: Fleuren, H., den Hertog, D., Kort, P. (eds) Operations Research Proceedings 2004. Operations Research Proceedings, vol 2004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27679-3_17
Download citation
DOI: https://doi.org/10.1007/3-540-27679-3_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24274-1
Online ISBN: 978-3-540-27679-1
eBook Packages: Business and EconomicsBusiness and Management (R0)