Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/33231
Appears in Collections:Computing Science and Mathematics Journal Articles
Peer Review Status: Refereed
Title: A chance-constrained programming model for airport ground movement optimisation with taxi time uncertainties
Author(s): Wang, Xinwei
Brownlee, Alexander E I
Weiszer, Michal
Woodward, John R
Mahfouf, Mahdi
Chen, Jun
Contact Email: alexander.brownlee@stir.ac.uk
Keywords: air traffic management
airport ground movement
chance-constrained programming
quickest path search
taxi time uncertainties
Issue Date: Nov-2021
Date Deposited: 6-Sep-2021
Citation: Wang X, Brownlee AEI, Weiszer M, Woodward JR, Mahfouf M & Chen J (2021) A chance-constrained programming model for airport ground movement optimisation with taxi time uncertainties. Transportation Research Part C: Emerging Technologies, 132, Art. No.: 103382. https://doi.org/10.1016/j.trc.2021.103382
Abstract: Airport ground movement remains a major bottleneck for air traffic management. Existing approaches have developed several routing allocation methods to address this problem, in which the taxi time traversing each segment of the taxiways is fixed. However, taxi time is typically difficult to estimate in advance, since its uncertainties are inherent in the airport ground movement optimisation due to various unmodelled and unpredictable factors. To address the optimisation of taxi time under uncertainty, we introduce a chance-constrained programming model with sample approximation, in which a set of scenarios is generated in accordance with taxi time distributions. A modified sequential quickest path searching algorithm with local heuristic is then designed to minimise the entire taxi time. Working with real-world data at an international airport, we compare our proposed method with the state-of-the-art algorithms. Extensive simulations indicate that our proposed method efficiently allocates routes with smaller taxiing time, as well as fewer aircraft stops during the taxiing process.
DOI Link: 10.1016/j.trc.2021.103382
Rights: This is an open access article distributed under the terms of the Creative Commons CC-BY license (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. You are not required to obtain permission to reuse this article.
Licence URL(s): http://creativecommons.org/licenses/by/4.0/

Files in This Item:
File Description SizeFormat 
1-s2.0-S0968090X21003818-main.pdfFulltext - Published Version1.21 MBAdobe PDFView/Open



This item is protected by original copyright



A file in this item is licensed under a Creative Commons License Creative Commons

Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.