Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/153282
Title: Data-driven runway occupancy time prediction using decision trees
Authors: Chow, Hong Wei
Lim, Zhi Jun
Alam, Sameer
Keywords: Engineering::Aeronautical engineering::Aviation
Engineering::Computer science and engineering::Computing methodologies::Artificial intelligence
Issue Date: 2021
Source: Chow, H. W., Lim, Z. J. & Alam, S. (2021). Data-driven runway occupancy time prediction using decision trees. 2021 AIAA/IEEE 40th Digital Avionics Systems Conference (DASC). https://dx.doi.org/10.1109/DASC52595.2021.9594365
Abstract: With an increasing amount of flights, the demand for runways at airports increases as well. Innovative mechanisms are required to maximise the use of a runway such that the demand can be met. Such mechanisms include the prediction of Runway Occupancy Time (ROT), so that the Air Traffic Controllers (ATCs) are able to gauge how much time a particular flight needs on the runway. This allows them to prepare the next flight for the runway and effectively reduce the buffer times between flights, thus increasing the overall efficiency of the runway. The objective of this paper is to develop an explainable machine learning model to predict Runway Occupancy Time. The Decision Tree Regressor was chosen for this study and its performance was compared to other more complicated machine learning models. The Decision Tree Regressor, unlike the other machine learning algorithms, provides explicit rules on how the predictions of the ROT is derived. An example of a generated rule for runway 02L of Singapore Changi Airport is that if an aircraft is a medium aircraft from airline XXX, arriving between 2100 and 2159 hours UTC, with an approach speed of more than 83.344 m/s at the final approach fix, and with the trailing aircraft traveling slower, the predicted ROT will be 42.6 seconds. Results show that the Decision Tree Regressor has the least runtime out of all the models at 0.28 minutes during training and its prediction capabilities are also on par with the rest of the machine learning models. The Root Mean Square Error for the Decision Tree Regressor is 5.96 seconds, which is only 0.20 seconds away from the best performing machine learning model. This, coupled with the rules that the Decision Tree Regressor can provide, makes it easier for end-users to to accept the prediction results without compromising on the accuracy. Permutation importance was also applied to the decision tree, providing an insight into what affects the ROT the most.
URI: https://hdl.handle.net/10356/153282
ISBN: 978-1-6654-3420-1
ISSN: 2155-7209
DOI: 10.1109/DASC52595.2021.9594365
Rights: © 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: https://doi.org/10.1109/DASC52595.2021.9594365.
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:ATMRI Conference Papers
MAE Conference Papers

Files in This Item:
File Description SizeFormat 
DASC_2021 (1).pdf730.15 kBAdobe PDFThumbnail
View/Open

Page view(s)

60
Updated on May 21, 2022

Download(s) 50

36
Updated on May 21, 2022

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.