Tactical crew planning in railways

Tactical crew capacity planning problem in railways involves finding the minimum number of crews in a region required to operate a predetermined set of train duties satisfying the strict day-off requirement for crew. For the single-region problem, we develop two solution approaches based on a space–time network representation: the sequential approach and the integrated approach. We also study the multi-regional capacity planning problem where we minimize total system-wide capacity by simultaneously considering multiple regions within a neighborhood search algorithm based on our solution methods for the single-region problem. We present the computational study on problem instances from Turkish State Railways.

[1]  Balachandran Vaidyanathan,et al.  Multicommodity network flow approach to the railroad crew-scheduling problem , 2007, IBM J. Res. Dev..

[2]  Paolo Toth,et al.  A Global Method for Crew Planning in Railway Applications , 2001 .

[3]  Matteo Fischetti,et al.  Crew Scheduling for Netherlands Railways: "destination: customer" , 2000 .

[4]  Celso C. Ribeiro,et al.  Tutorials in Operations Research , 2012, Int. Trans. Oper. Res..

[5]  Andreas T. Ernst,et al.  Staff scheduling and rostering: A review of applications, methods and models , 2004, Eur. J. Oper. Res..

[6]  Taïeb Mellouli.  A Network Flow Approach to Crew Scheduling Based on an Analogy to an Aircraft/Train Maintenance Routing Problem , 2001 .

[7]  Birol Yüceoğlu.  Tactical crew planning at Turkish state railways , 2009 .

[8]  Ravindra K. Ahuja,et al.  Network flow approaches in railroad planning and scheduling , 2005 .

[9]  Michael F. Gorman,et al.  Formulation and Solution Approaches to the Rail Maintenance Production Gang Scheduling Problem , 2010 .

[10]  Ernesto M. Morgado,et al.  CREWS_NS: Scheduling Train Crews in The Netherlands , 1997, AI Mag..

[11]  Dennis Huisman,et al.  Solving Large Scale Crew Scheduling Problems by using Iterative Partitioning , 2008, ATMOS.

[12]  H. Kunzi,et al.  Lectu re Notes in Economics and Mathematical Systems , 1975 .

[13]  Matteo Fischetti,et al.  Algorithms for railway crew management , 1997, Math. Program..

[14]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[15]  Cid C. de Souza,et al.  Solving very large crew scheduling problems to optimality , 2000, SAC '00.

[16]  Matteo Fischetti,et al.  Solution of Large-Scale Railway Crew Planning Problems: the Italian Experience , 1999 .

[17]  Majid Sarrafzadeh,et al.  An application of dynamic programming to crew balancing at Burlington Northern Santa Fe Railway , 2000, Int. J. Serv. Technol. Manag..

[18]  Richard Freling,et al.  Scheduling train crews: a case study for the Dutch Railways , 2000 .

[19]  Matteo Fischetti,et al.  Crew Scheduling for Netherlands Railways , 2000 .

[20]  Leena Suhl,et al.  A partially integrated airline crew scheduling approach with time-dependent crew capacities and multiple home bases , 2006, Eur. J. Oper. Res..