Abstract
We discuss how the use of Constraint Programming can help speed up a Column Generation process for the Tail Assignment problem. A generalized preprocessing technique based on constraint propagation is presented that can remove up to 98% of the connections of the flight network, much more than methods currently in use. The result is substantial speed-up and increased solution quality for the column generator. We also show how propagation can be used within fixing heuristics, and present a heuristic propagation-based preprocessing method taking cost into consideration. Computational results on data from several airlines is presented.
Research partly funded by Carmen Systems AB, http://www.carmen.se
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grönkvist, M. (2002). Using Constraint Propagation to Accelerate Column Generation in Aircraft Scheduling. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_73
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_73
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive