The optimal track allocation problem (OPTRA), also known as the train routing problem or the train timetabling problem, is to find, in a given railway network, a conflict-free set of train routes of maximum value. We propose a novel integer programming formulation for this problem that is based on additional 'configuration' variables. Its LP-relaxation can be solved in polynomial time. These results are the theoretical basis for a column generation algorithm to solve large-scale track allocation problems. Computational results for the Hanover-Kassel-Fulda area of the German long distance railway network involving up to 570 trains are reported.
CITATION STYLE
Borndörfer, R., & Schlechte, T. (2008). Solving Railway Track Allocation Problems. In Operations Research Proceedings 2007 (pp. 117–122). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-77903-2_18
Mendeley helps you to discover research relevant for your work.