Abstract
We consider a version of the aircraft rotation problem where the objective is to minimize delay risks. Given a set of flights to be flown by a subfleet the rotation problem is to find a specific route for each aircraft of the subfleet such that each flight is flown by exactly one aircraft. Additionally, the sequence of flights defining a route must satisfy certain requirements mainly to avoid delays. We present a mathematical model for the problem of minimizing the delay risk according to special requirements of a major airline. An efficient Lagrangian heuristic is proposed that uses subgradient optimization and linear assignments as subproblems. Computational results on real data are given and compared to actual aircraft rotations of that airline.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
[1993] Ahuya, R. K., Magnanti, T. L., and Orlin, J. B., Network Flows: Theory, Algorithms, and Applications, Prentice Hall, Englewood Cliffs, NJ, 1993.
[1998] Boland, N. L., Clarke, L. W., Johnson, E. L., Nemhauser, G., and Shenoi, R.G.: Flight String Models for Aircraft, Fleeting and Routing, Transportation Science. Focused Issue on Airline Optimization, Vol. 32, No. 3, pp. 208–220, 1998.
[1946] Birkhoff, G.: Tres observationes sobre el algebra lineal. Revista Facultad de Ciencias Exactas, Puras y Applicadas Universidad Nacional de Tucuman, Serie A (Matematicas y Fisica Teoretica) 5, pp. 147–151, 1946.
[1997] Clarke, L., Johnson, E., Nehmhauser, G., and Zhu, Z.: The Aircraft Rotation Problem. Annals of Operations Research 69, pp. 33–46, 1997.
[1976] Crowder, H.: Computational Improvements for Subgradient Optimization. Symposia Mathematica, Vol XIX., Academic Press, London, 1976.
[1985] Fisher, M.L.: An Application Oriented Guide to Lagrangian Relaxation. Interfaces 15, pp. 10–21, 1985.
[1955] Kuhn, H.W.: The Hungarian Method for the Assignment Problem. Naval Research Logistics Quaterly 2, pp. 83–97, 1955.
[1993] Schrijver, A.: Theory of Linear and Integer Programming, John Wiley & Sons, Inc., New York, 1986.
[1953] von Neumann, J.: A certain zero-sum two-person game equivalent to the optimal assignment problem. In: Contributions to the Theory of Games, Vol. II, Kuhn, H. W. and Tucker, A. W. (eds.), Princeton University Press, pp. 5–12, 1953.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jünger, M., Elf, M., Kaibel, V. (2003). Rotation Planning for the Continental Service of a European Airline. In: Jäger, W., Krebs, HJ. (eds) Mathematics — Key Technology for the Future. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55753-8_51
Download citation
DOI: https://doi.org/10.1007/978-3-642-55753-8_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-62914-3
Online ISBN: 978-3-642-55753-8
eBook Packages: Springer Book Archive