Abstract
A flight schedule defines a feasible plan of what cities to fly to and at what times. The task of airline schedule planning is to generate a flight schedule that achieves the most effective use of an airline’s resources. Typically, schedule planning is a sequential process. First, key decisions are made about the flight schedule and then, decisions are made concerning the matching of the airline’s fleet to the flights in the schedule. Finally, with all of these decisions fixed, crew planning is performed. These problems are solved sequentially, rather than simultaneously, primarily because of limitations in computer technology and solution algorithms. Simultaneous solution approaches are preferred, of course, because they do not create incompatibilities like those generated in sequential approaches and they might generate lower cost solutions.
We focus on the problem of quantifying the difference in solution quality between simultaneous and sequential solution methods for airline schedule planning. We describe an advanced solution approach that, while still sequential, begins to integrate the schedule planning process. We present a new model that incorporates downstreameffects into an upstream decision model. Using data provided by a large airline, we show that our approach is both tractable and capable of producing dramatically improved solutions to the overall schedule planning problem. Finally, we show that because of limitations imposed by computer hardware and solution algorithms. unlike current sequentially generated solutions, the solutions we generate are very close to the best possible solutions of a fully integrated solution process.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Andreatta, G., and L. Brunetta, “Multi Airport Ground Holding Problem: A Computational Evaluation of Exact Algorithms,” Technical Report, Department of Pure and Applied Mathematics, University of Padova, Padova, Italy, 1995.
Barnhart, C, N.L. Boland, L.W. Clarke, EX. Johnson, G.L. Nemhauser, and R.G. Shenoi, “Flight String Models for Aircraft Fleeting and Routing,” LSOG Working Paper, Center for Transportation Studies Massachusetts Institute of Technology, Cambridge, MA, 1997a.
Barnhart, C, E.L. Johnson, G. L. Nemhauser, M.W. Savelsbergh, and P.H. Vance, “Branch-and-Price: Column Generation for Solving Huge Integer Programs,” to appear in Operations Research, 1997b.
Barnhart, C, and R. Shenoi, “An Alternate Model and Solution Approach for the Long-Haul Crew Pairing Problem,” LSOG Working Paper, Center for Transportation Studies Massachusetts Institute of Technology, Cambridge, MA, 1996.
Bertsimas, D. and S. Stock, “The Air Traffic Flow Management Problem with Enroute Capacities,” Working Paper WP#-3726-94 MSA, Massachusetts Institute of Technology, Cambridge, MA, 1994.
Boyd, E. A., R. Burlingame, and K. S. Lindsay, “An Efficient Algorithm for Solving an Air Traffic Management Model of the National Airspace System,” 1994. To appear in the INFORMS Journal on Computing.
Bradley, S. P., A. Hax, and T.L. Magnanti, Applied Mathenatical Programming. Addison-Wesley Publishing Company, Reading, Massachusetts, 1977.
Clarke, L., C.A. Hane, E. L. Johnson, and G. L. Nemhauser, “Maintenance and Crew Considerations in Fleet Assignment,” Transportation Science 30, 3 (1996), 249–260.
Desaulniers, G., J. Desrosiers, M.M. Solomon, and F. Soumis, “Daily Aircraft Routing and Scheduling,” GERAD Technical Report, Montreal Quebec, Canada, 1994.
Etschmaier, M. M., and D. F. X. Mathaisel, “Airline Scheduling: An Overview,” Transportation Science 19, 2 (1985), 127–138.
Hane, C. A., C. Barnhart, E. L. Johnson, R. E. Marsten, G. L. Nemhauser, and G. Sigismondi, “The Fleet Assignment Problem: Solving a Large-Scale Integer Program,” Mathematical Programming 70, 211–232, 1995.
Talluri, K., and R. Gopalan, “Mathematical Models in Airline Schedule Planning: A Survey,” Technical Report, USAir, Operations Research Department, Arlington, VA, 1995.
Talluri, K., “Swapping Applications in a Daily Airline Fleet Assignment,” Transportation Science 30, 3, 237–248 (1996).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Barnhart, C., Lu, F., Shenoi, R. (1998). Integrated Airline Schedule Planning. In: Yu, G. (eds) Operations Research in the Airline Industry. International Series in Operations Research & Management Science, vol 9. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5501-8_13
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5501-8_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7513-5
Online ISBN: 978-1-4615-5501-8
eBook Packages: Springer Book Archive