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.
Solving Railway Track Allocation Problems
01.01.2008
6 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Solving Railway Track Allocation Problems
TIBKAT | 2007
|Solving Railway Track Allocation Problems
British Library Conference Proceedings | 2008
|Springer Verlag | 2018
|Models for Railway Track Allocation
TIBKAT | 2007
|