| Article ID: | iaor20052236 |
| Country: | United States |
| Volume: | 38 |
| Issue: | 3 |
| Start Page Number: | 357 |
| End Page Number: | 368 |
| Publication Date: | Aug 2004 |
| Journal: | Transportation Science |
| Authors: | Nemhauser George L., Johnson Ellis L., Rosenberger Jay M. |
| Keywords: | programming: integer |
Airline decision makers cancel flights in operations because of disruptions. When canceling a flight, they usually cancel a cycle, a sequence of flight that begins and ends at the same airport. Consequently, a fleet assignment and aircraft rotation with many short cycles is frequently less sensitive to a flight cancellation than one with only a few short cycles. In this paper, we determine a lower bound for the number of short cycles using the hub connectivity of a fleet assignment, and we present fleet-assignment models (FAMs) that embed many short cycles and reduce hub connectivity within a solution. We show that solutions to such models perform better in operations than those of traditional FAMs that minimize planned operating cost and passenger spill.