Railway crew capacity planning problem with connectivity of schedules

Warning The system is temporarily closed to updates for reporting purpose.

Suyabatmaz, Ali Çetin and Şahin, Güvenç (2015) Railway crew capacity planning problem with connectivity of schedules. Transportation Research Part E: Logistics and Transportation Review, 84 . pp. 88-100. ISSN 1366-5545

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.1016/j.tre.2015.10.003


We study a tactical level crew capacity planning problem in railways which determines the minimum required crew size in a region while both feasibility and connectivity of schedules are maintained. We present alternative mathematical formulations which depend on network representations of the problem. A path-based formulation in the form of a set-covering problem along with a column-and-row generation algorithm is proposed. An arc-based formulation of the problem is solved with a commercial linear programming solver. The computational study illustrates the effect of schedule connectivity on crew capacity decisions and shows that arc-based formulation is a viable approach.

Item Type:Article
Uncontrolled Keywords:Railway crew; Crew scheduling; Crew rostering; Capacity planning; Path-based formulation; Arc-based formulation; Column generation
Subjects:T Technology > T Technology (General) > T055.4-60.8 Industrial engineering. Management engineering > T57.6-57.97 Operations research. Systems analysis
ID Code:28480
Deposited By:Güvenç Şahin
Deposited On:23 Dec 2015 12:58
Last Modified:22 May 2019 13:33

Repository Staff Only: item control page