Meta-heuristics for aircraft arrival and departure scheduling on multiple runways

Ghaith Rabadi, Gulsah Hancerliogullari, Mohamed Kharbeche, Ameer Al-Salem

Araştırma sonucu: ???type-name???Yazıbilirkişi

2 Atıf (Scopus)

Özet

The problem of scheduling aircrafts on multiple runways can be modeled as an identical parallel machine scheduling with release times, target times and deadlines. To schedule arriving and departing aircrafts as close as possible to their target times, the total weighted tardiness is minimized. Furthermore, sequence-dependent separation times on each runway must be considered to avoid wake-vortex effects. These separation times make the problem significantly more difficult especially that they do not necessarily follow the triangular inequality. In this research, we present a priority rule and a Simulated Annealing algorithm to find good schedules in reasonable computational times. The performance of the algorithms is evaluated by solving small and medium problems and comparing them to optimal solutions.

Orijinal dilİngilizce
Sayfalar1235-1242
Sayfa sayısı8
Yayın durumuYayınlandı - 2012
Harici olarak yayınlandıEvet
Etkinlik62nd IIE Annual Conference and Expo 2012 - Orlando, FL, United States
Süre: 19 May 201223 May 2012

???event.eventtypes.event.conference???

???event.eventtypes.event.conference???62nd IIE Annual Conference and Expo 2012
Ülke/BölgeUnited States
ŞehirOrlando, FL
Periyot19/05/1223/05/12

Parmak izi

Meta-heuristics for aircraft arrival and departure scheduling on multiple runways' araştırma başlıklarına git. Birlikte benzersiz bir parmak izi oluştururlar.

Alıntı Yap