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

A. Ç. Suyabatmaz () and G. Şahin ()
Additional contact information
A. Ç. Suyabatmaz: Sabanci University
G. Şahin: Sabanci University

A chapter in Operations Research Proceedings 2011, 2012, pp 335-340 from Springer

Abstract: 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.

Keywords: Planning Horizon; Column Generation; Linear Programming Relaxation; Crew Member; Crew Schedule (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (2)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-642-29210-1_54

Ordering information: This item can be ordered from
http://www.springer.com/9783642292101

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

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().