Aircraft landing problems with aircraft classes
- 725 Downloads
This article focuses on the aircraft landing problem that is to assign landing times to aircraft approaching the airport under consideration. Each aircraft’s landing time must be in a time interval encompassing a target landing time. If the actual landing time deviates from the target landing time additional costs occur which depend on the amount of earliness and lateness, respectively. The objective is to minimize overall cost. We consider the set of aircraft being partitioned into aircraft classes such that two aircraft of the same class are equal with respect to wake turbulence. We develop algorithms to solve the corresponding problem. Analyzing the worst case run-time behavior, we show that our algorithms run in polynomial time for fairly general cases of the problem. Moreover, we present integer programming models. We show by means of a computational study how optimality properties can be used to increase efficiency of standard solvers.
KeywordsAircraft scheduling Landing times Aircraft classes Complexity MIP models
- Bianco, L., Dell‘Olmo, P., & Giordani, S. (2006). Scheduling models for air traffic control in terminals areas. Journal of Scheduling, pp. 223–253.Google Scholar
- Fahle, T., Feldmann, R., Gtz, S., Grothklags, S., & Monien, B. (2003). The aircraft sequencing problem. In R. Klein, H.-W. Six, & L. M. Wegner (Eds.), Computer Science in Perspective, Essays Dedicated to Thomas Ottmann, Lecture Notes in Computer Science (Vol. 2598, pp. 152–166). Springer: Berlin.Google Scholar
- Harikiopoulo, D., & Neogi, N. (2011). Polynomial-time feasibility condition for multiclass aircraft sequencing on a single-runway airport. IEEE Transactions on Intelligent Transportation Systems, 12(1): 2–14.Google Scholar
- Potts, C. N., & Kovalyov, M. Y. (2000). Scheduling with batching: A review. European Journal of Operational Research, 120, 228–249.Google Scholar
- Psaraftis, H. N. (1978). A dynamic programming approach to the aircraft sequencing problem. Flight Transportation Laboratory, Technical report, MIT. Google Scholar
- Soomer, M., & Koole, G. (2008). Fairness in the aircraft landing problem. Technical report, Department of Mathematics, Vrije Universiteit Amsterdam. http://www.math.vu.nl/koole/articles/report08a/art.pdf.
- Soomer, M. J., & Franx, G. J. (2008). Scheduling aircraft landings using airlines’ preferences. European Journal of Operational Research, 190(1), 277–291.Google Scholar