Abstract
As shown in the previous chapter, crew scheduling applications are able to generate high quality solutions with a runtime of several hours to a few days even for large problem instances of about 20, 000 trips. Such runtimes are acceptable for most medium-term planning problems, where crew schedules are generated several weeks or months before operation. For some practical settings, though, the benefit of these algorithms is limited: Firstly, some medium-term problem instances consist of more than 50, 000 trips. In these dimensions, the runtime of the crew scheduling algorithm of Chapter 3 is too long to be of practical use.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer Fachmedien Wiesbaden GmbH, part of Springer Nature
About this chapter
Cite this chapter
Jütte, S. (2012). The Divide-and-Price Decomposition Algorithm. In: Large-Scale Crew Scheduling. Edition KWV. Springer Gabler, Wiesbaden. https://doi.org/10.1007/978-3-658-24360-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-658-24360-9_4
Published:
Publisher Name: Springer Gabler, Wiesbaden
Print ISBN: 978-3-658-24359-3
Online ISBN: 978-3-658-24360-9
eBook Packages: Business and EconomicsEconomics and Finance (R0)