A Column-and-Row Generation Algorithm for a Crew Planning Problem in Railways
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.
KeywordsPlanning Horizon Column Generation Linear Programming Relaxation Crew Member Crew Schedule
Unable to display preview. Download preview PDF.
- 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 http://research.sabanciuniv.edu/14197/
- 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