scholarly journals Resolving Infeasibilities in Railway Timetabling Instances

2018 ◽  
Author(s):  
Gert-Jaap Polinder ◽  
Leo Kroon ◽  
Karen Aardal ◽  
Marie Schmidt ◽  
Marco Molinaro
Keyword(s):  
2020 ◽  
Author(s):  
Fredrik Ljunggren ◽  
Kristian Persson ◽  
Anders Peterson ◽  
Christiane Schmidt

Abstract We present an algorithm to insert a train path in an existing railway timetable close to operation, when we want to affect the existing (passenger) traffic as little as possible. Thus, we consider all other trains as fixed, and aim for a resulting train path that maximizes the bottleneck robustness, that is, a train path that maximizes the temporal distance to neighboring trains in the timetable. Our algorithm is based on a graph formulation of the problem and uses a variant of Dijkstra’s algorithm. We present an extensive experimental evaluation of our algorithm for the Swedish railway stretch from Malmö to Hallsberg. Moreover, we analyze the size of our constructed graph.


2018 ◽  
Vol 8 (3-4) ◽  
pp. 167-183 ◽  
Author(s):  
Sabrina Herrigel ◽  
Marco Laumanns ◽  
Jacint Szabo ◽  
Ulrich Weidmann

Networks ◽  
2010 ◽  
Vol 57 (1) ◽  
pp. 3-18 ◽  
Author(s):  
Gabrio Caimi ◽  
Martin Fuchsberger ◽  
Marco Laumanns ◽  
Kaspar Schüpbach
Keyword(s):  

Author(s):  
Sabrina Herrigel ◽  
Marco Laumanns ◽  
Andrew Nash ◽  
Ulrich Weidmann

Author(s):  
F. Barber ◽  
P. Tormos ◽  
A. Lova ◽  
L. Ingolotti ◽  
M. A. Salido ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document