Scatter search and bionomic algorithms for the aircraft landing problem

  • Authors:

  • J. E. Beasley

  • Affiliations:

  • Mathematical Sciences, Brunel University, Uxbridge, United Kingdom

  • Venue:
  • AMCOS'05 Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem of deciding how to land aircraft approaching an airport involves assigning each aircraft to an appropriate runway, computing a landing sequence for each runway and scheduling the landing time for each aircraft. The objective is to achieve effective runway use. The multiple runway case of the static Aircraft Landing Problem is considered. Two heuristic techniques are presented: Scatter Search and the Bionomic Algorithm, population heuristic approaches that have not been applied to this problem before. Computational results are presented for test problems involving up to 500 aircraft and 5 runways.