Displacement problem and dynamically scheduling aircraft landings
- First Online:
In this paper we define a generic decision problem — the displacement problem. The displacement problem arises when we have to make a sequence of decisions and each new decision that must be made has an explicit link back to the previous decision that was made. This link is quantified by means of the displacement function. One situation where the displacement problem arises is that of dynamically scheduling aircraft landings at an airport. Here decisions about the landing times for aircraft (and the runways they land on) must be taken in a dynamic fashion as time passes and the operational environment changes. We illustrate the application of the displacement problem to the dynamic aircraft landing problem. Computational results are presented for a number of publicly available test problems involving up to 500 aircraft and five runways.
Keywordsdisplacement problem air traffic control runway operations scheduling
- Odoni AR, Rousseau J-M and Wilson NHM (1994). Models in urban and air transportation. In: Pollock SM, Rothkopf MH and Barnett A (eds) Operations Research and the Public Sector: Handbooks in Operations Research and Management Science, Vol 6. North-Holland: Amsterdam, The Netherlands, pp 107–150.CrossRefGoogle Scholar
- Erzberger H (1995). Design principles and algorithms for automated air traffic management: In: Knowledge-based Functions in Aerospace Systems. AGARD Lecture Series no. 200. NATO Neuilly-Sur-Seine, France, 7:1–7:31.Google Scholar
- Dear RG (1976). The dynamic scheduling of aircraft in the near terminal area, Report R76-9 Flight Transportation Laboratory, MIT, Cambridge, MA, USA.Google Scholar
- Brinton CR (1992). An implicit enumeration algorithm for arrival aircraft scheduling. In: Proceedings of the 11th IEEE/AIAA Digital Avionics Systems Conference Seattle, WA. IEEE, NY, USA, pp 268–274.Google Scholar
- Psaraftis HN (1978). A dynamic programming approach to the aircraft sequencing problem, Report R78-4 Flight Transportation Laboratory, MIT, Cambridge MA, USA.Google Scholar
- Ciesielski V and Scerri P (1997). An anytime algorithm for scheduling of aircraft landing times using genetic algorithms. Aust J Intell Inf Process Systems 4: 206–213.Google Scholar
- Ciesielski V and Scerri P (1998). Real time genetic scheduling of aircraft landing times. In: Fogel D (ed) Proceedings of the 1998 IEEE International Conference on Evolutionary Computation (ICEC98). IEEE, NY, USA, pp 360–364.Google Scholar
- Carr GC, Erzberger H and Neuman F (1998). Airline arrival prioritization in sequencing and scheduling. Paper presented at the second USA/Europe Air Traffic Management R&D Seminar, Orlando. Available from. http://www.ctas.arc.nasa.gov/publications.
- ILOG Inc (1999). ILOG CPLEX 6.5 User's Manual. ILOG Inc.: Mountain View, CA, USA.Google Scholar