Airline crew scheduling: models, algorithms, and data sets

By Atoosa Kasirzadeh, Mohammed Saddoune, François Soumis. 2014

137 citations recorded by the source corpus.

The airline crew scheduling problem has received extensive attention, particularly in the last 60 years. This problem is frequently divided into crew pairing and crew assignment because of its large size and the complex safety agreements and contractual rules. Several solution methodologies have been developed, but many objectives and constraints are treated approximately and research is ongoing. In this paper, we present a comprehensive problem definition for the airline crew scheduling problem, and we review existing problem formulations and solution methodologies. In addition, we formulate the personalized cockpit crew scheduling problem as a set covering problem and we solve it using column generation. We present computational results for real data from a major US carrier, and we describe the data sets (available on the internet) in detail to establish a basis for future research.

Subfields: Automotive Engineering, Industrial and Manufacturing Engineering, Management Science and Operations Research, Mathematical Optimization

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Automotive Engineering

In Industrial and Manufacturing Engineering

In Management Science and Operations Research

In Mathematical Optimization

Citations in the corpus

Structured Convolutional Kernel Networks for Airline Crew Scheduling (2021, background): “The CPP has been traditionally modelled as a set partitioning problem, with a covering constraint for each flight and a variable for each feasible pairing (Desaulniers et al., 1997; Kasirzadeh et al., 2017).”
Dynamic Constraint Aggregation for Solving Very Large-scale Airline Crew Pairing Problems (2020, background): “For more information of the CRP, see, e.g., the recent surveys of [11, 21].”
Machine Learning in Airline Crew Pairing to Construct Initial Clusters for Dynamic Constraint Aggregation (2020, methodology): “The reader is referred to [22] for further details on the likelihood of these scenarios.”
Flight-connection Prediction for Airline Crew Scheduling to Construct Initial Clusters for OR Optimizer (2019, methodology): “We use the following conditions that are always satisfied for the next flight taken by the crew: – The departure time of the next flight should follow the arrival time of the previous flight to the connecting city; – The departure time of the next flight should not exceed 48 hours following the arri”