Planning for Robust Airline Operations: Optimizing Aircraft Routings and Flight Departure Times to Minimize Passenger Disruptions

Shan Lan (), John-Paul Clarke () and Cynthia Barnhart ()
Additional contact information
Shan Lan: Risk Management Department, American Express Company, 200 Vesey Street, New York, New York 10285
John-Paul Clarke: School of Aerospace Engineering, Georgia Institute of Technology, 270 Ferst Drive, Atlanta, Georgia 30332-0150
Cynthia Barnhart: Center for Transportation and Logistics, Massachusetts Institute of Technology, 77 Massachusetts Avenue 1-235A, Cambridge, Massachusetts 02139-4307

Transportation Science, 2006, vol. 40, issue 1, 15-28

Abstract: Airlines typically construct their schedules assuming that every flight leg will depart and arrive as planned. Because this optimistic scenario rarely occurs, these plans are frequently disrupted and airlines often incur significant costs in addition to those originally planned. Flight delays and schedule disruptions also cause passenger delays and disruptions. A more robust plan can reduce the occurrence and impact of these delays, thereby reducing costs. In this paper, we present two new approaches to minimize passenger disruptions and achieve robust airline schedule plans. The first approach involves routing aircraft, and the second involves retiming flight departure times.Because each airplane usually flies a sequence of flight legs, delay of one flight leg might propagate along the aircraft route to downstream flight legs and cause further delays and disruptions. We propose a new approach to reduce delay propagation by intelligently routing aircraft. We formulate this problem as a mixed-integer programming problem with stochastically generated inputs. An algorithmic solution approach is presented. Computational results obtained using data from a major U.S. airline show that our approach can reduce delay propagation significantly, thus improving on-time performance and reducing the numbers of passengers disrupted.Our second area of research considers passengers who miss their flight legs due to insufficient connection time. We develop a new approach to minimize the number of passenger misconnections by retiming the departure times of flight legs within a small time window. We formulate the problem and an algorithmic solution approach is presented. Computational results obtained using data from a major U.S. airline show that this approach can substantially reduce the number of passenger misconnections without significantly increasing operational costs.

Keywords: airline operations; aircraft routing; flight scheduling; robust operations (search for similar items in EconPapers)
Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (70)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1050.0134 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:40:y:2006:i:1:p:15-28

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().