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

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

Journal of Air Transport Management, 2013, vol. 32, issue C, 39-48

Abstract: 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.

Keywords: Aircraft sequencing problem; Sequence-dependent separation times; Greedy algorithms; Metaheuristics; Total weighted tardiness (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0969699713000628
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jaitra:v:32:y:2013:i:c:p:39-48

DOI: 10.1016/j.jairtraman.2013.06.001

Access Statistics for this article

Journal of Air Transport Management is currently edited by Anne Graham

More articles in Journal of Air Transport Management from Elsevier
Bibliographic data for series maintained by Catherine Liu ().