Integer and combinatorial optimization
Integer and combinatorial optimization
The Preferential Bidding System at Air Canada
Transportation Science
A Column Generation Approach for Large-Scale Aircrew Rostering Problems
Operations Research
Color-Coding Algorithms to the Balanced Path Problem: Computational Issues
INFORMS Journal on Computing
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
Handling rest requirements and preassigned activities in airline crew pairing optimization
INOC'11 Proceedings of the 5th international conference on Network optimization
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Approximating the multi-level bottleneck assignment problem
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
| Hi-index | 0.00 |
The problem of finding a work assignment for airline crew members in a given time horizon is addressed. In the literature this problem is usually referred to as the airline crew rostering problem. It consists of constructing monthly schedules for crew members by assigning them pairings, rest periods, annual and sick leave, training periods, union activities, and so forth, so as to satisfy the collective agreements and security rules. We formulate the airline crew rostering problem as a 0-1 multicommodity flow problem where each employee corresponds to a commodity; determining a monthly schedule for an employee is the same as computing a path on a suitably defined graph while still satisfying union conventions. A preprocessing phase is performed that reduces the dimension of the graph. To tighten the linear programming formulation of our model, we propose some families of valid inequalities that have proved to be computationally effective. Some of them can be treated implicitly when constructing the graph. Computational results obtained with a commercial integer programming solver (CPLEX) are analyzed.