Greedy algorithm for the scheduling aircrafts landings

EMRAH Ş., Alsalihe T. A. I.

2011 5th International Conference on Application of Information and Communication Technologies, AICT 2011, Baku, Azerbaycan, 12 - 14 Ekim 2011, (Tam Metin Bildiri) identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Doi Numarası: 10.1109/icaict.2011.6111028
  • Basıldığı Şehir: Baku
  • Basıldığı Ülke: Azerbaycan
  • Anahtar Kelimeler: aircraft landing scheduling problem, greedy algorithm, NP-hard problems
  • Ankara Üniversitesi Adresli: Evet

Özet

In this study, we consider the aircraft landing scheduling problem (ALS). It is well-known NP-hard problem. This is an indicator that the optimal solution cannot be found at real time. We recommend a greedy algorithm for the solution of problem in this paper. For simplicity, this algorithm that is told for static ALS problem may also be generalized for dynamic ALS problems. It has been shown on a simple example that the Greedy algorithm may not provide the optimal solution. Despite of it, if we don't aim to find the best solution but better solution, then it is found that the Greedy algorithm is faster than other approximate solution algorithms. © 2011 IEEE.