An algorithm for single- and multiple-runway aircraft landing problem

Salehipour, A

An algorithm for single- and multiple-runway aircraft landing problem

Salehipour, A

Permalink

Publisher:: Elsevier
Publication Type:: Journal Article
Citation:: Mathematics and Computers in Simulation, 2020, 175, pp. 179-191
Issue Date:: 2020-09

Closed Access

	Filename	Description	Size
	1-s2.0-S037847541930309X-main.pdf	Published version	322.12 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Salehipour, A
dc.date.accessioned	2021-01-12T04:08:05Z
dc.date.available	2021-01-12T04:08:05Z
dc.date.issued	2020-09
dc.identifier.citation	Mathematics and Computers in Simulation, 2020, 175, pp. 179-191
dc.identifier.issn	0378-4754
dc.identifier.issn	1872-7166
dc.identifier.uri	http://hdl.handle.net/10453/145328
dc.description.abstract	© 2019 International Association for Mathematics and Computers in Simulation (IMACS) The aircraft landing problem (ALP) is the problem of allocating an airport's runways to arriving aircraft as well as scheduling the landing time of aircraft, with the objective of minimizing the total deviation from the target landing times. We propose a simple heuristic to solve ALP. The distinguishing factor of the proposed algorithm includes decomposing the problem into a chain of smaller and easier-to-solve problems. We show that utilizing this strategy is very effective in solving the problem in a short time. Our work is motivated by the dynamic nature of the problem, i.e., due to the continuous changes in the number of arriving flights and a short window for determining the landing schedule, the air traffic controller needs to solve the problem on a regular basis and update the landing schedule, and fast and effective algorithms are therefore paramount. By solving two sets of 124 benchmark instances we demonstrate that we fulfill this aim and that the proposed algorithm obtains satisfactory solutions in a short amount of time.
dc.language	English
dc.publisher	Elsevier
dc.relation	http://purl.org/au-research/grants/arc/DE170100234
dc.relation.ispartof	Mathematics and Computers in Simulation
dc.relation.isbasedon	10.1016/j.matcom.2019.10.006
dc.rights	info:eu-repo/semantics/restrictedAccess
dc.subject	01 Mathematical Sciences, 02 Physical Sciences, 08 Information and Computing Sciences
dc.subject.classification	Numerical & Computational Mathematics
dc.title	An algorithm for single- and multiple-runway aircraft landing problem
dc.type	Journal Article
utslib.citation.volume	175
utslib.for	01 Mathematical Sciences
utslib.for	02 Physical Sciences
utslib.for	08 Information and Computing Sciences
pubs.organisational-group	/University of Technology Sydney/Faculty of Design, Architecture and Building
pubs.organisational-group	/University of Technology Sydney/Faculty of Design, Architecture and Building/School of Built Environment
pubs.organisational-group	/University of Technology Sydney
utslib.copyright.status	closed_access	*
pubs.consider-herdc	false
dc.date.updated	2021-01-12T04:08:00Z
pubs.publication-status	Published
pubs.volume	175

Abstract:

© 2019 International Association for Mathematics and Computers in Simulation (IMACS) The aircraft landing problem (ALP) is the problem of allocating an airport's runways to arriving aircraft as well as scheduling the landing time of aircraft, with the objective of minimizing the total deviation from the target landing times. We propose a simple heuristic to solve ALP. The distinguishing factor of the proposed algorithm includes decomposing the problem into a chain of smaller and easier-to-solve problems. We show that utilizing this strategy is very effective in solving the problem in a short time. Our work is motivated by the dynamic nature of the problem, i.e., due to the continuous changes in the number of arriving flights and a short window for determining the landing schedule, the air traffic controller needs to solve the problem on a regular basis and update the landing schedule, and fast and effective algorithms are therefore paramount. By solving two sets of 124 benchmark instances we demonstrate that we fulfill this aim and that the proposed algorithm obtains satisfactory solutions in a short amount of time.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/145328