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

Conference paper

DOI: 10.1007/978-3-642-29210-1_54

Part of the Operations Research Proceedings book series (ORP)
Cite this paper as:
Suyabatmaz A.Ç., Şahin G. (2012) A Column-and-Row Generation Algorithm for a Crew Planning Problem in Railways. In: Klatte D., Lüthi HJ., Schmedders K. (eds) Operations Research Proceedings 2011. Operations Research Proceedings (GOR (Gesellschaft für Operations Research e.V.)). Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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