In this paper, we describe the railway crew scheduling problem as a set covering model. Due to the large size of the problem and its intrinsic complexity, we propose an approach that starts with a decomposition phase to assign all trips to depots and gets a set of subproblems. A column generation algorithm is embed in genetic algorithm to get the lower bounds of the subproblems. In the second phase, we solve the linear programming relaxation of the models using a column generation scheme. Then we use a branch-and-bound technique to get satisfied integer solutions. The performance of this appraoch is compared with central solution by an instance. And our column geration based two-phase approach shows an improvement with respect to computation time.
A Column Generation-Based Approach for Railway Crew Scheduling Problem
Sixth International Conference of Traffic and Transportation Studies Congress (ICTTS) ; 2008 ; Nanning, China
2008-07-17
Conference paper
Electronic Resource
English
A column generation approach to airline crew scheduling
Tema Archive | 2006
|Genetic Algorithm-Based Column Generation Approach to Passenger Rail Crew Scheduling
Online Contents | 2010
|Genetic Algorithm–Based Column Generation Approach to Passenger Rail Crew Scheduling
Transportation Research Record | 2010
|Springer Verlag | 2015
|Results Obtained with Crew-Opt: A Column Generation Method for Transit Crew Scheduling
British Library Conference Proceedings | 1995
|