A global approach to crew-pairing optimization
IBM Systems Journal
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Flight String Models for Aircraft Fleeting and Routing
Transportation Science
The Operational Airline Crew Scheduling Problem
Transportation Science
Transportation Science
Rerouting Aircraft for Airline Recovery
Transportation Science
A Robust Fleet-Assignment Model with Hub Isolation and Short Cycles
Transportation Science
Flight operations recovery: New approaches considering passenger recovery
Journal of Scheduling
Robust Airline Fleet Assignment: Imposing Station Purity Using Station Decomposition
Transportation Science
Robust Airline Crew Pairing: Move-up Crews
Transportation Science
Integrated Airline Fleet and Crew Robust Planning
Transportation Science
Disruption management in the airline industry-Concepts, models and methods
Computers and Operations Research
Hi-index | 0.00 |
Although the airline industry has benefited from advancements made in computational and operational research methods, most implementations arise from the frictionless environment of the planning stage. Because 22% of all flights have been delayed and 3% have been cancelled in the United States since 2001, schedule perturbations are inevitable. The complexity of the operational environment is exacerbated by the need for obtaining a solution in as close to real-time as possible. Given some time horizon, the recovery process seeks to repair the flight schedule, aircraft rotations, crew schedule, and passenger itineraries in a tractable manner. Each component individually can be difficult to solve, so early research on irregular operations has studied these problems in isolation, leading to a sequential process by which the recovery process is conducted. Recent work has integrated a subset of these four components, usually abstracting from crew recovery. We present an optimization-based approach to solve the fully integrated airline recovery problem. After our solution methodology is presented, it is tested using data from an actual U.S. carrier with a dense hub-and-spoke network using a single-day horizon. It is shown that in several instances an integrated solution is delivered in a reasonable runtime. Moreover, we show the integrated approach can substantially improve the solution quality over the incumbent sequential approach. To the best of our knowledge, we are the first to present computational results on the fully integrated problem.