This article presents a mixed-integer linear-programming formulation for integrating short-term maintenance planning in a network-wide railway rolling stock circulation problem. This is a key problem in railway rostering planning that requires covering a given set of services and maintenance works with a minimum amount of rolling stock units. In our formulation, a rostering solution is viewed as a minimal cost Hamiltonian cycle in a graph with service pairings, empty runs, and short-term maintenance tasks. We use a commercial MILP solver to compute efficient solutions in a short time. Experimental results on real-world scenarios from the main Italian railway company Trenitalia show that this integrated approach can reduce significantly the number of trains and empty runs when compared with the current rolling stock circulation plan.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Rolling Stock Rostering Optimization Under Maintenance Constraints


    Beteiligte:

    Erschienen in:

    Erscheinungsdatum :

    02.01.2014




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Rolling Stock Rostering Optimization Under Maintenance Constraints

    Giacco, Giovanni Luca | Online Contents | 2014


    MISTRAL - short- and mid-term rolling stock rostering for NMBS-SNCB

    Geistler, Alexander / Vermeulen, Wim | IuD Bahn | 2007


    Modelling constraints in automatic vehicle rostering - demands and possibilities

    Schumacher, A. / Monecke, L. / Freiberger, K.-U. | British Library Conference Proceedings | 2004


    Maintenance of rolling stock

    Ubelacker, C.E. | Engineering Index Backfile | 1896


    Automated Rolling Stock Maintenance

    Kilian, K. / Mazur, V. / Kilian, M. et al. | British Library Conference Proceedings | 2001