A Column-and-Row Generation Algorithm for a Crew Planning Problem in Railways

  • A. Ç. Suyabatmaz
  • G. Şahin
Conference paper
Part of the Operations Research Proceedings book series (ORP)


We develop a set-covering type formulation for a crew planning problem that determines the minimum sufficient crew size for a region over a finite planning horizon where the periodic repeatability of crew schedules is considered as well. The resulting problem formulation cannot be solved with a traditional column generation algorithm. We propose a column-and-row generation algorithm and present preliminary computational results.


Planning Horizon Column Generation Linear Programming Relaxation Crew Member Crew Schedule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ernst, A.T., Jiang, H., Krishnamoorthy, M., Nott, H., Sier, D.: Staff scheduling and rostering: A review of applications, methods and models. European Journal of Operations Research 153, 3–27 (2004).CrossRefGoogle Scholar
  2. 2.
    Muter, I., Birbil, S.I., Bulbul, K.: Simultaneous Column-and-Row Generation for Large-Scale Linear Programs with Column-Dependent-Rows. [Working Paper / Technical Report] Sabanci University ID: 0004(2001) SU-FENS-2010
  3. 3.
    Şahin, G., Yüceoḡlu , B.: Tactical crew planning in railways. Transportation Research Part E: Logistics and Transportation Review (2011) doi:  10.1016/j.tre.2011.05.013

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Manufacturing Systems/Industrial Engineering, Faculty of Engineering and Natural SciencesSabanci UniversityIstanbulTurkey

Personalised recommendations