| Summary: | Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2006. === Includes bibliographical references (p. 151-156). === Demand stochasticity is a major challenge for the airlines in their quest to produce profit maximizing schedules. Even with an optimized schedule, many flights have empty seats at departure, while others suffer a lack of seats to accommodate passengers who desire to travel. Recognizing that demand forecast quality for a particular departure date improves as the date comes close, we tackle this challenge by developing a dynamic scheduling approach that re-optimizes elements of the flight schedule during the passenger booking period. The goal is to match capacity to demand, given the many operational constraints that restrict possible assignments. We introduce flight re-timing as a dynamic scheduling mechanism and develop a re-optimization model that combines both flight re-timing and flight re-fleeting. Our re-optimization approach, re-designing the flight schedule at regular intervals, utilizes information from both revealed booking data and improved forecasts available at later re-optimizations. Experiments are conducted using data from a major U.S. airline. We demonstrate that significant potential profitability improvements are achievable using this approach. === (cont.) We complement this dynamic re-optimization approach with models and algorithms to de-peak existing hub-and-spoke flight schedules so as to maximize future dynamic scheduling capabilities. In our robust de-peaking approach, we begin by solving a basic de-peaking model to provide a basis for comparison of the robust de-peaked schedule we later generate. We then present our robust de-peaking model to produce a schedule that maximizes the weighted sum of potentially connecting itineraries and attains at least the same profitability as the schedule produced by the basic de-peaking model. We provide several reformulations of the robust de-peaking model and analyze their properties. To address the tractability issue, we construct a restricted model through an approximate treatment of the profitability requirement. The restricted model is solved by a decomposition based solution approach involving a variable reduction technique and a new form of column generation. We demonstrate, through experiments using data from a major U.S. airline, that the schedule generated by our robust de-peaking approach achieves improved profitability. === by Hai Jiang. === Ph.D.
|
|---|
