Accelerating column generation for aircraft scheduling using constraint propagation

Authors:
Mattias Grönkvist
Affiliations:
Carmen Systems AB, Odinsgatan, Göteborg, Sweden
Venue:
Computers and Operations Research
Year:
2006

Citing 15
Cited 2

Flight scheduling and maintenance base planning

Management Science
A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
The fleet assignment problem: solving a large-scale integer program

Mathematical Programming: Series A and B
Daily aircraft routing and scheduling

Management Science
Integrating constraint logic programming and operations research techniques for the crew rostering problem

Software—Practice & Experience
Constraint Programming Based Column Generation for Crew Assignment

Journal of Heuristics
Arc Consistency for Global Cardinality Constraints with Costs

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
The Aircraft Maintenance Routing Problem

Operations Research
Branch and Infer: a Unifying Framework for Integer and Finite Domain Constraint Programming

INFORMS Journal on Computing
Flight String Models for Aircraft Fleeting and Routing

Transportation Science
A Column Generation Approach for Large-Scale Aircrew Rostering Problems

Operations Research
An Efficient Airline Re-Fleeting Model for the Incremental Modification of Planned Fleet Assignments

Transportation Science
The Role of Integer Programming Techniques in Constraint Programming's Global Constraints

INFORMS Journal on Computing
Generalized arc consistency for global cardinality constraint

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

An iterative approach to robust and integrated aircraft routing and crew scheduling

Computers and Operations Research
On an exact method for the constrained shortest path problem

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

We discuss how constraint programming can improve the performance of a column generation solution process for the NP-hard Tail Assignment problem in aircraft scheduling. Combining a constraint model of a relaxed Tail Assignment problem with column generation, we achieve substantially improved performance. A generalized preprocessing technique based on constraint propagation is presented that can dramatically reduce the size of the flight network. We also present a heuristic preprocessing method based on the costs of connections, and show how constraint propagation can be used to improve fixing heuristics. Proof of concept is provided using real world Tail Assignment instances.