Skip to main content
SpringerLink
Log in

Mathematical models in airline schedule planning: A survey

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The schedule is an airline's primary product, having the most influence (along with price) on a passenger's choice of an airline. Once an airline decides (at least tentatively) on a schedule, a host of related problems have to be resolved before it can consider the schedule feasible, and can proceed to market the schedule. Among these problems are traffic forecasting and allocation that forecasts traffic on each flight leg for use in the fleet assignment model, fleet assignment that decides the fleet type of the aircraft flying the legs in the schedule, equipment swapping to change an assigned equipment type on a leg if and when necessary, through flight selection for determining which pairs of flights to market as one-stops (without any aircraft change), maintenance routing that develops aircraft rotations to provide adequate opportunities for overnight maintenance, and flight numbering to number flights as consistently as possible with a prior schedule. Considerable methodological and computational advances have been made in the recent past in developing models and solution methods for almost all of the problems mentioned above. In this paper we survey these various models and solution techniques.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Abara, Applying integer linear programming to the fleet assignment problem, Interfaces 19(1989).

  2. R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.

    Google Scholar 

  3. R. Anbil, E. Gelman, B. Patty, and R. Tanga, Recent advances in crew-pairing optimization at American Airlines, Interfaces 21(1991)62 -74.

    Google Scholar 

  4. J. Bard and I.G. Cunningham, Improving through flight schedules, IIE Transactions 19(1987)242 -251.

    Google Scholar 

  5. T.E. Bartlett, An algorithm for the minimum number of transport units to maintain a fixed schedule, Naval Research Logistics Quarterly 4(1957)139 -149.

    Google Scholar 

  6. T.E. Bartlett and A. Charnes, Cyclic scheduling and combinatorial topology: Assignment and routing of motive power to meet scheduling and maintenance requirements: II. Generalization and analysis, Naval Research Logistics Quarterly 4(1957)207 - 220.

    Google Scholar 

  7. M. Ben-Akiva and S. Lerman, Discrete Choice Analysis: Theory and Application to Predict Travel Demand, MIT Press, Cambridge, MA, 1985.

    Google Scholar 

  8. M.A. Berge and C.A. Hopperstad, Demand driven dispatch: A method for dynamic aircraft capacity assignment, models and algorithms, Operations Research 41(1993).

  9. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, McMillan, London, 1978.

    Google Scholar 

  10. C. Barnhart, N. Boland, L. Clarke, E. Johnson, G. Nemhauser and R.G. Shenoi, String-based models and methods for aircraft routing and fleeting, Center for Transportation Studies Working Paper, CTS, MIT, Cambridge, MA 02139, 1996.

    Google Scholar 

  11. G. Box and G. Jenkins, Time Series Analysis - Forecasting and Control, Holden-Day, Oakland, CA, 1976.

    Google Scholar 

  12. L.W. Clarke, C.A. Hane, E.L. Johnson and G.L. Nemhauser, Maintenance and crew considerations in fleet assignment, Transportation Science 30(1996).

  13. L.W. Clarke, E.L. Johnson, G.L. Nemhauser and Z. Zhu, The aircraft rotation problem, Annals of Operations Research 69(1997)33- 46.

    Google Scholar 

  14. G.B. Dantzig and D.R. Fulkerson, Minimizing the number of tankers to meet a fixed schedule, Naval Research Logistics Quarterly 1(1954)217 - 222

    Google Scholar 

  15. M.S. Daskin and N.D. Panayotopoulos, A Lagrangian relaxation approach to assigning aircraft to routes in hub and spoke networks, Transportation Science 23(1989).

  16. J. Dillon, R. Gopalan, S. Ramachandran, R. Rushmeir and K.T. Talluri, Fleet assignment at USAir, TIMS/ORSA Joint National Meeting, Phoenix, AZ, 1993.

  17. G. Dobson and P.J. Lederer, Airline scheduling and routing in a hub-and-spoke system, Transportation Science 27(1993)281 - 297.

    Google Scholar 

  18. M. Dror, P. Trudeau and S.P. Ladany, Network models for seat allocation on flights, Transportation Research 22 B(1988)239 - 250.

    Google Scholar 

  19. M.M. Etschmaier and D.F.X. Mathaisel, Airline scheduling: An overview, Transportation Science 19(1985)127 - 138.

    Google Scholar 

  20. T.A. Feo and J.F. Bard, Flight scheduling and maintenance base planning, Management Science 35(1989)1415 - 1432.

    Google Scholar 

  21. J.J.H. Forrest and D. Goldfarb, Steepest-edge simplex algorithms for linear programming, Mathematical Programming 57(1992)341 - 374.

    Google Scholar 

  22. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness, W.H. Freeman, San Francisco, CA, 1979.

    Google Scholar 

  23. R. Gerbracht, A model for multi-fleet aircraft routing, ORSA/TIMS, 1982.

  24. D. Goldfarb and J.K. Reid, A practicable steepest-edge simplex algorithm, Mathematical Programming 12(1977)361 - 371.

    Google Scholar 

  25. R. Gopalan and K.T. Talluri, The aircraft maintenance routing problem, Operations Research (1998), to appear.

  26. D. Gray, Airworthiness: Decision support for aircraft maintenance scheduling, OR/MS Today (December, 1992)24 - 29.

  27. D. Gray and N. Kabbani, Right tool, place, time, OR/MS Today (April,1994)34 - 41.

  28. Z. Gu, E.J. Johnson, G.L. Nemhauser and Y. Wang, Some properties of the fleet assignment problem, Technical Report COC-92-06, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332, 1992.

    Google Scholar 

  29. C.A. Hane, C. Barnhart, E.J. Johnson, R.E. Marsten, G.L. Nemhauser and G. Sigismondi, OSL solves the fleet assignment problem, IBM EKKNEWS, Fourth Quarter (1992)5-7.

  30. C.A. Hane, C. Barnhart, E.J. Johnson, R.E. Marsten, G.L. Nemhauser and G. Sigismondi, The fleet assignment problem: Solving a large-scale integer program, Mathematical Programming 70(1995) 211 - 232.

    Google Scholar 

  31. M. Hersh and S.P. Ladany, Optimal seat allocation for flights with one intermediate stop, Computers and Operations Research 5(1978)31 - 37.

    Google Scholar 

  32. O. Holst and B. Sorenson, Combined scheduling and maintenance planning for an aircraft fleet, Operations Research 32(1984)735 - 747.

    Google Scholar 

  33. A.I. Jarrah, The fleet assignment model, TIMS/ORSA Joint National Meeting Presentation, Chicago, IL, 1993.

  34. A.I.Z. Jarrah and G. Yu, A mathematical programming model for airline maintenance scheduling, Working Paper 89/90-3-3, Department of Management Science and Information Systems, University of Texas at Austin, 1990.

  35. S. Joshi and R. Muthukrishnan, Incremental tools for aircraft scheduling, AGIFORS 33rd Annual Symposium Proceedings, Chicago, IL, 1993.

  36. N.M. Kabbani and B.W. Patty, Aircraft routing at American airlines, Proceedings of The 32nd Annual Symposium of AGIFORS, Budapest, Hungary, 1992.

  37. R.M. Karp, A characterization of the minimum cycle mean in a digraph, Discrete Mathematics 23(1978)309 - 311.

    Google Scholar 

  38. J.B. Orlin, Dynamic network flows, Ph.D. Thesis, Department of Operations Research, Stanford University, 1984.

  39. J.B. Orlin, Minimizing the number of vehicles to meet a fixed periodic schedule: An application of periodic posets, Operations Research 30(1982)760 - 776.

    Google Scholar 

  40. R.L. Phillips, D.W. Boyd and T.A. Grossman, Jr., An algorithm for calculating consistent itinerary flows, Transportation Science 25(1991)225 - 239.

    Google Scholar 

  41. T. Sapountzis, Using distributed processing to generate aircraft rotations at American airlines, AGIFORS 33rd Annual Symposium Proceedings, Chigao, IL, 1993.

  42. R.W. Simpson, Scheduling and routing models for airline systems, Report FTL-R68-3, Flight Transportation Lab, MIT, 1969.

  43. R.W. Simpson, A market share model for US domestic airline competitive markets, Memorandum M 70-5, Flight Transportation Lab, MIT, 1970.

  44. F. Soumis and A. Nagurney, A stochastic, multiclass airline network equilibrium model, Operations Research 41(1993).

  45. R. Subramanian and R. Marsten, Strategic planning and scheduling of aircraft heavy maintenance at Delta Airlines, AGIFORS 33rd Annual Symposium Proceedings, Chicago, IL, 1993.

  46. R. Subramanian, R.P. Scheff, J.D. Quillinan, D.S. Wiper and R.E. Marsten, ColdStart - fleet assignment at Delta Airlines, Interfaces 24(1994).

  47. R. Swann, Spill models revisited, Preprint, Boeing Co.

  48. K.T. Talluri, Swapping applications in a daily airline fleet assignment, Transportation Science 30(1996).

  49. K.T. Talluri, The four-day aircraft maintenance problem, Universitat Pompeu Fabra Working Paper, 1996.

  50. N. Taneja, Airline Traffic Forecasting, Lexington Books, Lexington, MA, 1978.

    Google Scholar 

  51. R.D. Wollmer, An airline schedule tail routing algorithm, ORSA /TIMS Conference, Colorado Springs, Fall, 1980.

Download references

Authors
  1. Ram Gopalan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kalyan T. Talluri
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gopalan, R., Talluri, K.T. Mathematical models in airline schedule planning: A survey. Annals of Operations Research 76, 155–185 (1998). https://doi.org/10.1023/A:1018988203220

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018988203220

Keywords

Search

Navigation