Railway crew capacity planning problem with connectivity of schedules

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

[thumbnail of 2015_TRE_SuyabatmazSahin.pdf] PDF

Download (764kB)


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
Divisions: Faculty of Engineering and Natural Sciences > Academic programs > Industrial Engineering
Faculty of Engineering and Natural Sciences
Depositing User: Güvenç Şahin
Date Deposited: 23 Dec 2015 12:58
Last Modified: 22 May 2019 13:33
URI: https://research.sabanciuniv.edu/id/eprint/28480

Actions (login required)

View Item
View Item