Communications - Scientific Letters of the University of Zilina 2003, 5(4):89-91 | DOI: 10.26552/com.C.2003.4.89-91

The Aircraft Landing Problem

Jan Pelikan1
1 University of Economics, Prague, Czechia

The problem studied in the paper is an air traffic problem on the airport runway. The goal is finding an aircraft landing sequence that meets the time window for the particular aircraft and at the same time the separation times between two aircraft, which is necessary for the security of landings. The integer programming formulations and the relationship to the traveling salesman problem with cumulative costs are shown.

Keywords: mathematical programming, integer programming, scheduling

Published: December 31, 2003  Show citation

ACS AIP APA ASA Harvard Chicago Chicago Notes IEEE ISO690 MLA NLM Turabian Vancouver
Pelikan, J. (2003). The Aircraft Landing Problem. Communications - Scientific Letters of the University of Zilina5(4), 89-91. doi: 10.26552/com.C.2003.4.89-91
Download citation

References

  1. BEASLEY, J. E., KRISHNAMOORTHY, M., SHARAIHA, Y.M., ABRAMSON, D.: Scheduling aircraft landings - the static case. Transportation Science, vol. 34 No. 2 (2000) Go to original source...
  2. BIANCO, L., MINGOZZI, A., RICCIARDELI, S.: The Traveling Salesman Problem with Cumulative costs. Networks, vol. 23 (1993) Go to original source...
  3. ERNST, A. T., KRISHNAMOOTHY, M., STORER, R. H.: Heuristic and exact algorithms for scheduling aircraft landings. Networks 34 (1999) Go to original source...
  4. FISCHETTI, M., LAPORTE, G., MARTELLO, S.: The delivery man problem and cumulative matroids. Operations Research vol. 41, no. 6 (1993) Go to original source...
  5. MĚLNÍČEK, S.: Diplomová práce VŠE 2002

This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0), which permits use, distribution, and reproduction in any medium, provided the original publication is properly cited. No use, distribution or reproduction is permitted which does not comply with these terms.