Timetable rearrangement to cope with railway maintenance activities

Autor: Saïd Hanafi, Diego Arenas, Paola Pellegrini, Joaquin Rodriguez
Přispěvatelé: L'Institut de Recherche Technologique (IRT) de la filière Ferroviaire (IRT Railenium), Université Polytechnique Hauts-de-France (UPHF), Laboratoire Électronique Ondes et Signaux pour les Transports (IFSTTAR/COSYS/LEOST), Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-PRES Université Lille Nord de France, Laboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201 (LAMIH), Université de Valenciennes et du Hainaut-Cambrésis (UVHC)-Centre National de la Recherche Scientifique (CNRS)-INSA Institut National des Sciences Appliquées Hauts-de-France (INSA Hauts-De-France), Évaluation des Systèmes de Transports Automatisés et de leur Sécurité (IFSTTAR/COSYS/ESTAS)
Rok vydání: 2018
Předmět:
Zdroj: Computers and Operations Research
Computers and Operations Research, Elsevier, 2018, 95, pp123-138. ⟨10.1016/j.cor.2018.02.018⟩
ISSN: 0305-0548
Popis: International audience; Maintenance activities on the railway infrastructure are necessary to maintain its functionality and availability. Commonly, the maintenance activities are planned first. Then, the timetable is elaborated respecting the unavailability periods caused by the former. However, sometimes unplanned maintenance activities have to be introduced at short notice, and the timetable must be rearranged to respect the new unavailabilities. In addition, specific trains may be necessary to perform maintenance activities, and they are typically not scheduled in the timetable. In this case, the timetable may need to be further rearranged to integrate the maintenance trains. In this paper, we propose a mixed-integer linear programming formulation that rearranges a timetable to cope with the capacity consumption produced by maintenance activities. It includes the consideration of maintenance trains and other specific constraints, such as temporary speed limitations. In this formulation, the rearrangement of the timetable is optimized based on a microscopic representation of both the infrastructure and the rolling stock. We assess three algorithms founded on this formulation on a real case study in the French railway network and we show their practical applicability.
Databáze: OpenAIRE