Highlights Novel algorithm to solve the problem of rescheduling trains in real-time. Introduction of a modelling framework that is extremely flexible and mixes elements typical of both micro- and macroscopic approaches. Development of a very fast algorithm that builds upon two known metaheuristics to produce solutions of good measurable quality. Computational experiments, conducted by testing the algorithm extensively on real-life instances and with tight real-time constraints, show that it is suitable for practical applications.

    Abstract We consider the real-time resolution of conflicts arising in real-world train management applications. In particular, given a nominal timetable for a set of trains and a set of modifications due to delays or other resources unavailability, we are aiming at defining a set of actions which must be implemented to grant safety, e.g., to avoid potential conflicts such as train collisions or headway violations, and restore quality by reducing the delays. To be compatible with real-time management, the required actions must be determined in a few seconds, hence specialized fast heuristics must be used.We propose a fast and effective parallel algorithm that is based on an iterated greedy scheduling of trains on a time-space network. The algorithm uses several sortings to define the initial train dispatching rule and different shaking methods between iterations. The performance is further enhanced by using various sparsification methods for the time-space network. The best algorithm configuration is determined through extensive experiments, conducted on a set of instances derived from real-world networks and instances from the literature. The resulting heuristic proved able to consistently resolve the existing conflicts and obtaining excellent solution quality within just two seconds of computing time on a standard personal computer, for instances involving up to 151 trains and two hours of planning time horizon.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A real-time conflict solution algorithm for the train rescheduling problem


    Beteiligte:


    Erscheinungsdatum :

    2017-10-09


    Format / Umfang :

    29 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Real-time train rescheduling in junction areas

    Chen, L. / Schmid, F. / Dasigi, M. et al. | British Library Online Contents | 2010


    Real-Time Train Rescheduling in Junction Areas

    Chen, L / Schmid, F / Dasigi, M et al. | SAGE Publications | 2010


    Real-time train rescheduling in junction areas

    Chen, L | Online Contents | 2010



    Research on Greedy Train Rescheduling Algorithm

    He, Z. / Li, H. / Miao, J. et al. | British Library Conference Proceedings | 2009