Greedy algorithms and metaheuristics for a multiple runway combined arrival-departure aircraft sequencing problem

Gulsah Hancerliogullari*, Ghaith Rabadi, Ameer H. Al-Salem, Mohamed Kharbeche

*Bu çalışma için yazışmadan sorumlu yazar

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

90 Atıf (Scopus)

Özet

This paper examines the Aircraft Sequencing Problem (ASP) over multiple runways, under mixed mode operations with the objective of minimizing the total weighted tardiness of aircraft landings and departures simultaneously. The ASP can be modeled as a parallel machine scheduling problem with unequal ready-times, target times and deadlines. Furthermore, sequence-dependent separation times on each runway are considered to prevent the dangers associated with wake-vortex effects. Due to the problem being NP-hard, greedy heuristics and metaheuristics are applied in this paper to obtain solutions in reasonable computation times. The algorithms' solutions are compared to optimal solutions and their performances are evaluated in terms of solution quality and CPU time.

Orijinal dilİngilizce
Sayfa (başlangıç-bitiş)39-48
Sayfa sayısı10
DergiJournal of Air Transport Management
Hacim32
DOI'lar
Yayın durumuYayınlandı - Eyl 2013
Harici olarak yayınlandıEvet

Finansman

This research has been supported by Qatar National Research Fund under Grant Number NPRP09-253-2-103 .

FinansörlerFinansör numarası
Qatar National Research FundNPRP09-253-2-103

    Parmak izi

    Greedy algorithms and metaheuristics for a multiple runway combined arrival-departure aircraft sequencing problem' araştırma başlıklarına git. Birlikte benzersiz bir parmak izi oluştururlar.

    Alıntı Yap