Polyhedral Analysis and Algorithms for a Demand-Driven Refleeting Model for Aircraft Assignment

Authors:
Hanif D. Sherali;Ebru K. Bish;Xiaomei Zhu
Affiliations:
Grado Department of Industrial and Systems Engineering (0118), Virginia Polytechnic Institute and State University, Blacksburg, Virginia 24061;Grado Department of Industrial and Systems Engineering (0118), Virginia Polytechnic Institute and State University, Blacksburg, Virginia 24061;Grado Department of Industrial and Systems Engineering (0118), Virginia Polytechnic Institute and State University, Blacksburg, Virginia 24061
Venue:
Transportation Science
Year:
2005

Citing 7
Cited 3

The fleet assignment problem: solving a large-scale integer program

Mathematical Programming: Series A and B
Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems

Operations Research
A Randomized Linear Programming Method for Computing Network Bid Prices

Transportation Science
Revenue Management: Research Overview and Prospects

Transportation Science
An Efficient Airline Re-Fleeting Model for the Incremental Modification of Planned Fleet Assignments

Transportation Science
Airline Fleet Assignment with Time Windows

Transportation Science
Itinerary-Based Airline Fleet Assignment

Transportation Science

Dynamic Airline Scheduling

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

INFORMS Journal on Computing
Robust airline schedule design in a dynamic scheduling environment

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The current airline practice in conducting fleet assignments is to begin assigning aircraft capacity to scheduled flights well in advance of departures. However, the accuracy of the passenger demand forecast improves markedly over time, and revisions to the initial fleet assignment become naturally pertinent when the observed demand differs considerably from the assigned aircraft capacities. The demand-driven refleeting (DDR) approach proposed in this paper offers a dynamic reassignment of aircraft capacities to the flight network, when improved demand forecasts become available, so as to maximize the total revenue. Because of the need to preserve the initial crew schedule, this reassignment approach is limited within a single family of aircraft types and to the flights assigned to this particular family. This restriction makes it computationally tractable to include more relevant path-level demand information into the DDR model. Accordingly, we construct a mixed-integer programming model for this enhanced problem context and study its polyhedral structure to explore ways for tightening its representation and for deriving certain classes of valid inequalities. Various schemes for implementing such reformulation techniques are investigated and tested using a set of simulated and real instances obtained from United Airlines.