Two-phase heuristic for SNCF rolling stock problem

Collection Location Koleksi E-book & E-Journal Perpustakaan Pusat Unila
Edition Vol. 271, Issue 2
Call Number
ISBN/ISSN 1572-9338
Author(s) Buljubaši, Mirsad
Vasquez, Michel
Gavranovi´ , Haris
Subject(s) Business and Management
Classification NONE
Series Title
GMD E-Journal
Language English
Publisher Springer
Publishing Year 2018
Publishing Place Switzerland
Abstract/Notes 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 schedulehastocomplywithresourceconstraintssuchascapacity,length,orderoftrains,etc. Aconstructiveheuristicisusedtobuildafeasibleschedule,whichissubjecttoimprovement 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. Keywords Greedy heuristic · Integer programming · Local search · Rolling stock · Scheduling
Specific Detail Info
  Back To Previous