Advertisement

The Aircraft Sequencing Problem

  • Torsten Fahle
  • Rainer Feldmann
  • Silvia Götz
  • Sven Grothklags
  • Burkhard Monien
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2598)

Abstract

In this paper we present different exact and heuristic optimization methods for scheduling planes which want to land (and start) at an airport - the Aircraft Sequencing Problem (ASP). We compare two known integer programming formulations with four new exact and heuristic solution methods regarding quality, speed and flexibility.

Keywords

Simulated Annealing Algorithm Constraint Programming Valid Solution Mixed Integer Programming Formulation Plane Land 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Andreussi, L. Bianco, and S. Ricciardelli. A simulation model for aircraft sequencing in the near terminal area. European Journal of Operational Research, 8:345–354, 1981.CrossRefGoogle Scholar
  2. 2.
    J.E. Beasley. Obtaining test problems via internet. Journal of Global Optimization, 8:429–433, 1996.zbMATHCrossRefGoogle Scholar
  3. 3.
    J.E. Beasley, M. Krishnamoorthy, Y.M. Sharaiha, and D. Abramson. The displacement problem and dynamically scheduling aircraft landings. to appear.Google Scholar
  4. 4.
    J.E. Beasley, M. Krishnamoorthy, Y.M. Sharaiha, and D. Abramson. Scheduling aircraft landings-the static case. Transportation Science, 34:180–197, 2000.zbMATHCrossRefGoogle Scholar
  5. 5.
    L. Bianco, S. Ricciardelli, G. Rinaldi, and A. Sassano. Scheduling tasks with sequence dependent processing times. Naval Research Logistics, 35:177–184, 1988.zbMATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    R.G. Dear and Y.S. Sherif. The dynamic scheduling of aircraft in high density terminal areas. Microelectronics and Reliability, 29:743–749, 1989.CrossRefGoogle Scholar
  7. 7.
    A.T. Ernst, M. Krishnamoorthy, and R.H. Storer. Heuristic and exact algorithms for scheduling aircraft landings. Networks, 34:229–241, 1999.zbMATHCrossRefGoogle Scholar
  8. 8.
    R. Feldmann, B. Monien, and S. Schamberger. A distributed algorithm to evaluate quantified boolean formulae. In Proc. of the 17th National Conference on Artificial Intelligence (AAAI-2000), pages 285–290, 2000.Google Scholar
  9. 9.
    J. Milan. The flow management problem in air traffic control: A model of assigning priorities for landings at a congested airport. Transportation, Planning and Technology, 20:131–162, 1997.CrossRefGoogle Scholar
  10. 10.
    H.N. Psaraftis. A dynamic programming approach to the aircraft sequencing problem. Research report R78-4, Flight Transportation Laboratory, MIT, 1978.Google Scholar
  11. 11.
    H.N. Psaraftis. A dynamic programming approach for sequencing groups of identical jobs. Operations Research, 28:1347–1359, 1980.zbMATHMathSciNetCrossRefGoogle Scholar
  12. 12.
    C.S. Venkatakrishnan, A. Barnett, and A.R. Odoni. Landings at Logan Airport: Describing and increasing airport capacity. Transportation Science, 27, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Torsten Fahle
    • 1
  • Rainer Feldmann
    • 1
  • Silvia Götz
    • 1
  • Sven Grothklags
    • 1
  • Burkhard Monien
    • 1
  1. 1.Department of Computer ScienceUniversity of PaderbornPaderbornGermany

Personalised recommendations