Date: 14 Apr 2012

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

* Final gross prices may vary according to local VAT.

Get Access


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.