Authors:
Lijie Bai
1
;
Thomas Bourdeaud'huy
2
;
Besoa Rabenasolo
1
and
Emmanuel Castelain
1
Affiliations:
1
École Centrale de Lille, France
;
2
LAGIS - Laboratoire d’Automatique and Génie Informatique et Signal, France
Keyword(s):
Train Scheduling, Train Routing, Mixed-Integer Linear Program, Robust Timetable.
Related
Ontology
Subjects/Areas/Topics:
Applications
;
Methodologies and Technologies
;
Operational Research
;
OR in Transportation
;
Pattern Recognition
;
Resource Allocation
;
Routing
;
Scheduling
;
Software Engineering
Abstract:
This paper studies a train routing and scheduling problem faced by railway station infrastructure managers to generate a conflict-free timetable which consists of two parts, commercial movements and technical movements. Firstly, we present the problem and propose a discrete-time mixed-integer linear mathematical model formulation. Due to the computational complexity of integer programming methods, we need to improve the calculation performance. On one hand, we consider the problem in continuous-time domain which decrease the computational size. The integrality of the scheduling variables is proved. On the other hand, the redundant constraints are cut off by probing the potential conflicts between trains and movements. The full practical problem is large: 247 trains consisting of 503 movements per day should be considered. The proposed approach can solve an instance made of 60 trains and 121 movements representing 385 minutes of traffic within less than 2 minutes.