The Aircraft Sequencing Problem
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.
KeywordsSimulated Annealing Algorithm Constraint Programming Valid Solution Mixed Integer Programming Formulation Plane Land
Unable to display preview. Download preview PDF.
- 3.J.E. Beasley, M. Krishnamoorthy, Y.M. Sharaiha, and D. Abramson. The displacement problem and dynamically scheduling aircraft landings. to appear.Google Scholar
- 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
- 10.H.N. Psaraftis. A dynamic programming approach to the aircraft sequencing problem. Research report R78-4, Flight Transportation Laboratory, MIT, 1978.Google Scholar
- 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