Introduction to algorithms
A generic arc-consistency algorithm and its specializations
Artificial Intelligence
Solving airline crew scheduling problems by branch-and-cut
Management Science
Arc-consistency and arc-consistency again
Artificial Intelligence
Software—Practice & Experience
A Heuristic Algorithm for the Set Covering Problem
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Modeling and Solving the Crew Rostering Problem
Operations Research
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
Branch and Infer: a Unifying Framework for Integer and Finite Domain Constraint Programming
INFORMS Journal on Computing
An Approximate Model and Solution Approach for the Long-Haul Crew Pairing Problem
Transportation Science
The Preferential Bidding System at Air Canada
Transportation Science
Mathematical Programming Techniques in Constraint Programming: A Short Overview
Journal of Heuristics
Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A flexible system for scheduling drivers
Journal of Scheduling
A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
Computers and Operations Research
Accelerating column generation for aircraft scheduling using constraint propagation
Computers and Operations Research
An integer programming approach to generating airline crew pairings
Computers and Operations Research
Efficient context-free grammar constraints
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Constraints
Computers and Operations Research
A greedy heuristic for airline crew rostering: unique challenges in a large airline in China
IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II
Solving shortest path problems with a weight constraint and replenishment arcs
Computers and Operations Research
Constraint programming based column generation for employee timetabling
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Shorter path constraints for the resource constrained shortest path problem
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A totally unimodular description of the consistent value polytope for binary constraint programming
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A hybrid column generation and constraint programming optimizer for the tail assignment problem
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Computers and Operations Research
Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling
INFORMS Journal on Computing
| Hi-index | 0.00 |
Airline crew assignment problems are large-scale optimization problems which can be adequately solved by column generation. The subproblem is typically a so-called constrained shortest path problem and solved by dynamic programming. However, complex airline regulations arising frequently in European airlines cannot be expressed entirely in this framework and limit the use of pure column generation. In this paper, we formulate the subproblem as a constraint satisfaction problem, thus gaining high expressiveness. Each airline regulation is encoded by one or several constraints. An additional constraint which encapsulates a shortest path algorithm for generating columns with negative reduced costs is introduced. This constraint reduces the search space of the subproblem significantly. Resulting domain reductions are propagated to the other constraints which additionally reduces the search space. Numerical results based on data of a large European airline are presented and demonstrate the potential of our approach.