Greedy algorithms and metaheuristics for a multiple runway combined arrival-departure aircraft sequencing problem
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 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.
39-48
Hancerliogullari, Gulsah
5aaaae7e-ca5a-493d-b725-7949b5d3689b
Rabadi, Ghaith
1f2bc3da-2245-42b4-9edb-9e87ca2966bd
Al-Salem, Ameer
8798ebad-14fd-4d6a-8138-f5e753a2917f
Kharbeche, Mohamed
a569c6c1-8e02-435e-b9bb-c8a5bb7b499d
September 2013
Hancerliogullari, Gulsah
5aaaae7e-ca5a-493d-b725-7949b5d3689b
Rabadi, Ghaith
1f2bc3da-2245-42b4-9edb-9e87ca2966bd
Al-Salem, Ameer
8798ebad-14fd-4d6a-8138-f5e753a2917f
Kharbeche, Mohamed
a569c6c1-8e02-435e-b9bb-c8a5bb7b499d
Hancerliogullari, Gulsah, Rabadi, Ghaith, Al-Salem, Ameer and Kharbeche, Mohamed
(2013)
Greedy algorithms and metaheuristics for a multiple runway combined arrival-departure aircraft sequencing problem.
Journal of Air Transport Management, 32, .
(doi:10.1016/j.jairtraman.2013.06.001).
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.
Text
__soton.ac.uk_ude_personalfiles_users_gh1e13_mydesktop_Kuzuma_2013 (done)_Greedy algorithms and metaheuristics for a multiple runway.pdf
- Version of Record
Restricted to Repository staff only
More information
Published date: September 2013
Organisations:
Centre of Excellence for International Banking, Finance & Accounting
Identifiers
Local EPrints ID: 359847
URI: http://eprints.soton.ac.uk/id/eprint/359847
ISSN: 0969-6997
PURE UUID: 4dd28398-37b7-4e81-9562-a9f99bd634b1
Catalogue record
Date deposited: 14 Nov 2013 13:42
Last modified: 14 Mar 2024 15:29
Export record
Altmetrics
Contributors
Author:
Gulsah Hancerliogullari
Author:
Ghaith Rabadi
Author:
Ameer Al-Salem
Author:
Mohamed Kharbeche
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics