Abstract A two-phase approach was adopted to solve the problem given during the ROADEF/EURO Challenge 2014 competition. The problem focuses on rolling stock management at railway sites, as defined by French Railways (SNCF). In the first phase, a train assignment problem is solved by combining a greedy heuristic procedure with integer programming. The objective is to maximize the number of assigned departures while meeting technical constraints. The second phase consists of scheduling train movements inside the station while minimizing the number of cancelled (uncovered) arrivals and departures. This schedule has to comply with resource constraints such as capacity, length, order of trains, etc. A constructive heuristic is used to build a feasible schedule, which is subject to improvement by an iterative procedure based on a local search. Experiment results, that demonstrate the effectiveness of our approach on the large scale instances provided by SNCF, are presented hereafter.
Two-phase heuristic for SNCF rolling stock problem
Annals of Operations Research ; 271 , 2 ; 1107-1129
2017-06-08
23 pages
Article (Journal)
Electronic Resource
English
SNCF rolling stock and maintenance strategy
IuD Bahn | 2009
|SNCF Rolling Stock Division seeks to expand
IuD Bahn | 2008
|La SNCF achète SynergiA . SNCF purchases SynergiA . Die SNCF kauft SynergiA
Online Contents | 2009
|IuD Bahn | 1998
|