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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Solving Railway Track Allocation Problems


    Contributors:


    Publication date :

    2008-01-01


    Size :

    6 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    Solving Railway Track Allocation Problems

    Borndörfer, Ralf / Schlechte, Thomas | TIBKAT | 2007


    Solving railway track allocation problems

    Borndörfer, Ralf ;Schlechte, Thomas | TIBKAT | 2007

    Free access

    Solving Railway Track Allocation Problems

    Borndorfer, R. / Schlechte, T. / Gesellschaft fur Operations Research | British Library Conference Proceedings | 2008


    Railway Track Allocation

    Caimi, Gabrio / Fischer, Frank / Schlechte, Thomas | Springer Verlag | 2018


    Models for Railway Track Allocation

    Borndörfer, Ralf / Schlechte, Thomas | TIBKAT | 2007