Combinational Aspects of Move Up Crews

Holger Flier (), Abhishek Gaurav () and Marc Nunkesser ()
Additional contact information
Holger Flier: Institute of Theoretical Computer Science
Abhishek Gaurav: Department of Computer Science and Engineering
Marc Nunkesser: Institute of Theoretical Computer Science

Chapter 92 in Operations Research Proceedings 2008, 2009, pp 569-574 from Springer

Abstract: Summary In railway planning, a frequent problem is that a delayed train necessarily delays its crew. To prevent delay propagation along the crew‘s succeeding trips, a move-up crew may take over the rest of the crew‘s duty on time. We address two problems in this context: First, during the planning stage, one has to make a tradeoff between robustness gained and additional costs incurred by introducing move-up crews. We suggest different heuristics to solve this problem, depending on the size of the instance. Second, during operations, dispatchers have to make optimal crew swap decisions, i.e., use available move-up crews to minimize overall passenger delay. For the local case, we give an efficient algorithm. However, optimizing crew swaps over the whole railway network is NP-hard

Keywords: Bipartite Graph; Crew Schedule; Black Vertex; Unweighted Case; Crew Rostering (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

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:sprchp:978-3-642-00142-0_92

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

DOI: 10.1007/978-3-642-00142-0_92

Access Statistics for this chapter

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