Integrated Airline Crew Pairing and Crew Assignment by Dynamic Constraint Aggregation

Authors:
Mohammed Saddoune;Guy Desaulniers;Issmail Elhallaoui;François Soumis
Affiliations:
École Polytechnique de Montréal and GERAD, Department of Mathematics and Industrial Engineering, C.P. 6079, Succ. Centre-Ville, Montréal, Québec H3C 3A7, Canada;École Polytechnique de Montréal and GERAD, Department of Mathematics and Industrial Engineering, C.P. 6079, Succ. Centre-Ville, Montréal, Québec H3C 3A7, Canada;École Polytechnique de Montréal and GERAD, Department of Mathematics and Industrial Engineering, C.P. 6079, Succ. Centre-Ville, Montréal, Québec H3C 3A7, Canada;École Polytechnique de Montréal and GERAD, Department of Mathematics and Industrial Engineering, C.P. 6079, Succ. Centre-Ville, Montréal, Québec H3C 3A7, Canada
Venue:
Transportation Science
Year:
2012

Citing 15
Cited 0

Solving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong Branching

Computational Optimization and Applications
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
An Approximate Model and Solution Approach for the Long-Haul Crew Pairing Problem

Transportation Science
A Two-Phase Genetic Algorithm for Large-Scale Bidline-Generation Problems at Delta Air Lines

Interfaces
Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling

Transportation Science
Airline Crew Scheduling with Time Windows and Plane-Count Constraints

Transportation Science
Improving Crew Scheduling by Incorporating Key Maintenance Routing Decisions

Operations Research
A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem

Computers and Operations Research
Dynamic Aggregation of Set-Partitioning Constraints in Column Generation

Operations Research
Robust Airline Crew Pairing: Move-up Crews

Transportation Science
Bi-dynamic constraint aggregation and subproblem reduction

Computers and Operations Research
Integrated Airline Fleeting and Crew-Pairing Decisions

Operations Research
Integrated Airline Fleet and Crew Robust Planning

Transportation Science
Multi-phase dynamic constraint aggregation for set partitioning type problems

Mathematical Programming: Series A and B
Aircrew pairings with possible repetitions of the same flight number

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditionally, the airline crew scheduling problem has been decomposed into a crew pairing problem and a crew assignment problem, both of which are solved sequentially. The first consists of generating a set of least-cost crew pairings (sequences of flights starting and ending at the same crew base) that cover all flights. The second aims at finding monthly schedules (sequences of pairings) for crew members that cover all pairings previously built. Pairing and schedule construction must respect all safety and collective agreement rules. In this paper, we focus on the pilot crew scheduling problem in a bidline context where anonymous schedules must be built for pilots and high fixed costs are considered to minimize the number of scheduled pilots. We propose a model that completely integrates the crew pairing and crew assignment problems, and we develop a combined column generation/dynamic constraint aggregation method for solving them. Computational results on real-life data show that integrating crew pairing and crew assignment can yield significant savings---on average, 3.37% on the total cost and 5.54% on the number of schedules for the 7 tested instances. The integrated approach, however, requires much higher computational times than the sequential approach.