TY  - GEN
A1  - Borndörfer, Ralf
A1  - Schlechte, Thomas
T1  - Solving Railway Track Allocation Problems
N2  - The \emph{optimal track allocation problem} (\textsc{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.
T3  - ZIB-Report - 07-20 
KW  - railway track allocation
KW  - timetabling
KW  - column generation
Y1  - 2007
UR  - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/963
UR  - https://nbn-resolving.org/urn:nbn:de:0297-zib-9631
SN  - 1438-0064
ER  -