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

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 Non-deterministic Polynomial-time (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 central processing unit (CPU) time.

Record URL:
Record URL:
Availability:
- Find a library where document is available. Order URL: http://worldcat.org/oclc/31005945
Supplemental Notes:
- Abstract reprinted with permission from Elsevier.
Authors:
- Hancerliogullari, Gulsah
- Rabadi, Ghaith
- Al-Salem, Ameer H
- Kharbeche, Mohamed
Publication Date: 2013-9

Language

English

Media Info

Media Type: Digital/other
Features: Figures; References; Tables;
Pagination: pp 39-48
Serial:
- Journal of Air Transport Management
- Volume: 32
- Issue Number: 0
- Publisher: Elsevier
- ISSN: 0969-6997
- Serial URL: http://www.sciencedirect.com/science/journal/09696997

Subject/Index Terms

TRT Terms: Airport runways; Algorithms; Arrivals and departures; Scheduling; Sequencing
Subject Areas: Aviation; Planning and Forecasting; I72: Traffic and Transport Planning;

Filing Info

Accession Number: 01496144
Record Type: Publication
Files: TRIS
Created Date: Sep 26 2013 9:58AM