A column-and-row generation algorithm for a crew planning problem in railways

Suyabatmaz, Ali Çetin and Şahin, Güvenç (2012) A column-and-row generation algorithm for a crew planning problem in railways. In: International Conference on Operations Research (OR 2011), Zurich, Switzerland

This is the latest version of this item.

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1007/978-3-642-29210-1_54

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.

Item Type:	Papers in Conference Proceedings
Uncontrolled Keywords:	* Transportation and Logistics * Capacity Planning * Rostering
Subjects:	T Technology > TF Railroad engineering and operation > TF501-668 Railway operation and management T Technology > T Technology (General) > T055.4-60.8 Industrial engineering. Management engineering > T57.6-57.97 Operations research. Systems analysis
ID Code:	21051
Deposited By:	Güvenç Şahin
Deposited On:	27 Nov 2012 15:12
Last Modified:	27 Nov 2012 15:12

Available Versions of this Item

A column-and-row generation algorithm for a crew planning problem in railways. (deposited 25 Dec 2011 13:02)
- A column-and-row generation algorithm for a crew planning problem in railways. (deposited 27 Nov 2012 15:12) [Currently Displayed]

Repository Staff Only: item control page