Show simple item record

AuthorHancerliogullari, Gulsah
AuthorRabadi, Ghaith
AuthorAl-Salem, Ameer H.
AuthorKharbeche, Mohamed
Available date2024-03-12T06:59:12Z
Publication Date2013
Publication NameJournal of Air Transport Management
ResourceScopus
ISSN9696997
URIhttp://dx.doi.org/10.1016/j.jairtraman.2013.06.001
URIhttp://hdl.handle.net/10576/52931
AbstractThis 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.
SponsorThis research has been supported by Qatar National Research Fund under Grant Number NPRP09-253-2-103 .
Languageen
PublisherElsevier
SubjectAircraft sequencing problem
Greedy algorithms
Metaheuristics
Sequence-dependent separation times
Total weighted tardiness
TitleGreedy algorithms and metaheuristics for a multiple runway combined arrival-departure aircraft sequencing problem
TypeArticle
Pagination39-48
Volume Number32
dc.accessType Abstract Only


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record