Combining column generation and constraint programming to solve the tail assignment problem

Combining column generation and constraint programming to solve the tail assignment problem

0.00 Avg rating0 Votes
Article ID: iaor200971092
Country: Germany
Volume: 171
Issue: 1
Start Page Number: 61
End Page Number: 76
Publication Date: Oct 2009
Journal: Annals of Operations Research
Authors: ,
Keywords: vehicle routing & scheduling, programming: constraints
Abstract:

Within the area of short term airline operational planning, Tail Assignment is the problem of assigning flight legs to individual identified aircraft while satisfying all operational constraints, and optimizing some objective function. In this article, we propose that Tail Assignment should be solved as part of both the short and the long term airline planning. We further present a hybrid column generation and constraint programming solution approach. This approach can be used to quickly produce solutions for operations management, and also to produce close-to-optimal solutions for long and mid term planning scenarios. We present computational results which illustrate the practical usefulness of the approach.

Reviews

Required fields are marked *. Your email address will not be published.