Integrated Airline Fleeting and Crew-Pairing Decisions

Authors:
Rivi Sandhu;Diego Klabjan
Affiliations:
United Airlines, Elk Grove Village, Illinois 60007;Department of Mechanical and Industrial Engineering, University of Illinois at Urbana--Champaign, Urbana, Illinois 61801
Venue:
Operations Research
Year:
2007

Citing 0
Cited 10

Integrated Airline Fleet and Crew Robust Planning

Transportation Science
An iterative approach to robust and integrated aircraft routing and crew scheduling

Computers and Operations Research
A Time-Space Network Approach for the Integrated Vehicle-and Crew-Scheduling Problem with Multiple Depots

Transportation Science
Integrated Airline Schedule Design and Fleet Assignment: Polyhedral Analysis and Benders' Decomposition Approach

INFORMS Journal on Computing
Truck Driver Scheduling in the European Union

Transportation Science
On a New Rotation Tour Network Model for Aircraft Maintenance Routing Problem

Transportation Science
On a New Rotation Tour Network Model for Aircraft Maintenance Routing Problem

Transportation Science
Exact approaches for integrated aircraft fleeting and routing at TunisAir

Computational Optimization and Applications
Integrated Airline Crew Pairing and Crew Assignment by Dynamic Constraint Aggregation

Transportation Science
Robust Airline Schedule Planning: Minimizing Propagated Delay in an Integrated Routing and Crewing Framework

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The tactical planning process of an airline is typically decomposed into several stages among which fleeting, aircraft routing, and crew pairing form the core. In such a decomposed and sequential approach, the output of fleeting forms the input to aircraft routing and crew pairing. In turn, the output to aircraft routing is part of the input to crew pairing. Due to this decomposition, the resulting solution is often suboptimal. We propose a model that completely integrates the fleeting and crew-pairing stages and guarantees feasibility of plane-count feasible aircraft routings, but neglects aircraft maintenance constraints. We design two solution methodologies to solve the model. One is based on a combination of Lagrangian relaxation and column generation, while the other one is a Benders decomposition approach. We conduct computational experiments for a variety of instances obtained from a major carrier.