Timetable rearrangement to cope with railway maintenance activities

被引:25
作者
Arenas, Diego [1 ,2 ,3 ,5 ]
Pellegrini, Paola [2 ,4 ]
Hanafi, Said [5 ]
Rodriguez, Joaquin [2 ,3 ]
机构
[1] Inst Rech Technol Railenium, F-59308 Valenciennes, France
[2] Univ Lille Nord France, F-59000 Lille, France
[3] IFSTTAR, COSYS, ESTAS, F-59650 Villeneuve dAscq, France
[4] IFSTTAR, COSYS, LEOST, F-59650 Villeneuve dAscq, France
[5] Univ Valenciennes & Hainaut Cambresis, LAMIH UMR CNRS 8201, F-59313 Valenciennes, France
关键词
Train timetabling; Railway maintenance; MILP; Temporary speed limitations;
D O I
10.1016/j.cor.2018.02.018
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码:123 / 138
页数:16
相关论文
共 13 条
[1]   Rescheduling rail networks with maintenance disruptions using Problem Space Search [J].
Albrecht, A. R. ;
Panton, D. M. ;
Lee, D. H. .
COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (03) :703-712
[2]  
Budai G, 2004, IEEE SYS MAN CYBERN, P4171
[3]   Nominal and robust train timetabling problems [J].
Cacchiani, Valentina ;
Toth, Paolo .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 219 (03) :727-737
[4]   A Lagrangian heuristic algorithm for a real-world train timetabling problem [J].
Caprara, A ;
Monaci, M ;
Toth, P ;
Guida, PL .
DISCRETE APPLIED MATHEMATICS, 2006, 154 (05) :738-753
[5]  
Edwards AL, 1976, INTRO LINEAR REGRESS, P33
[6]   Maintaining tracks and traffic flow at the same time [J].
Forsgren, Malin ;
Aronsson, Martin ;
Gestrelius, Sara .
JOURNAL OF RAIL TRANSPORT PLANNING & MANAGEMENT, 2013, 3 (03) :111-123
[7]  
Hachemane P, 1997, THESIS
[8]   Scheduling of railway track maintenance activities and crews [J].
Higgins, A .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1998, 49 (10) :1026-1033
[9]   RECIFE-MILP: An Effective MILP-Based Heuristic for the Real-Time Railway Traffic Management Problem [J].
Pellegrini, Paola ;
Marliere, Gregory ;
Pesenti, Raffaele ;
Rodriguez, Joaquin .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2015, 16 (05) :2609-2619
[10]   A Heuristic Approach to the Railroad Track Maintenance Scheduling Problem [J].
Peng, Fan ;
Kang, Seungmo ;
Li, Xiaopeng ;
Ouyang, Yanfeng ;
Somani, Kamalesh ;
Acharya, Dharma .
COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, 2011, 26 (02) :129-145