The real-time railway traffic management problem consists of selecting appropriate train routes and schedules for minimizing the propagation of delay in case of traffic perturbation. In this paper, we tackle this problem by introducing RECIFE-MILP, a heuristic algorithm based on a mixed-integer linear programming model. RECIFE-MILP uses a model that extends one we previously proposed by including additional elements characterizing railway reality. In addition, it implements performance boosting methods selected among several ones through an algorithm configuration tool. We present a thorough experimental analysis that shows that the performances of RECIFE-MILP are better than the ones of the currently implemented traffic management strategy. RECIFE-MILP often finds the optimal solution to instances within the short computation time available in real-time applications. Moreover, RECIFE-MILP is robust to its configuration if an appropriate selection of the combination of boosting methods is performed.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    RECIFE-MILP: An Effective MILP-Based Heuristic for the Real-Time Railway Traffic Management Problem


    Contributors:


    Publication date :

    2015-10-01


    Size :

    813263 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Experimental Demonstrations of Real-Time MILP Control

    Richards, Arthur / Kuwata, Yoshiaki / How, Jonathan | AIAA | 2003


    Model Predictive Control for urban traffic networks via MILP

    Lin, Shu / Schutter, B. / Xi, Yugeng et al. | Tema Archive | 2010



    MILP formulation and polynomial time algorithm for an aircraft scheduling problem

    Bayen, A.M. / Tomlin, C.J. / Ye, Yinyu et al. | Tema Archive | 2003