Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/26966
Appears in Collections:Computing Science and Mathematics Conference Papers and Proceedings
Peer Review Status: Refereed
Authors: Brownlee, Alexander
Woodward, John R
Weiszer, Michal
Chen, Jun
Contact Email: alexander.brownlee@stir.ac.uk
Title: A Rolling Window with Genetic Algorithm Approach to Sorting Aircraft for Automated Taxi Routing (Forthcoming)
Citation: Brownlee A, Woodward JR, Weiszer M & Chen J (2018) A Rolling Window with Genetic Algorithm Approach to Sorting Aircraft for Automated Taxi Routing (Forthcoming) In: Proceedings of the Genetic and Evolutionary Computation Conference 2018, New York: ACM. GECCO 2018: The 2018 conference on Genetic and Evolutionary Computation, 15.7.2018 - 19.7.2018.
Issue Date: Jul-2018
Conference Name: GECCO 2018: The 2018 conference on Genetic and Evolutionary Computation
Conference Dates: 2018-07-15T00:00:00Z
Abstract: With increasing demand for air travel and overloaded airport facilities, inefficient airport taxiing operations are a significant contributor to unnecessary fuel burn and a substantial source of pollution. Although taxiing is only a small part of a flight, aircraft engines are not optimised for taxiing speed and so contribute disproportionately to the overall fuel burn. Delays in taxiing also waste scarce airport resources and frustrate passengers. Consequently, reducing the time spent taxiing is an important investment. An exact algorithm for finding shortest paths based on A* allocates routes to aircraft that maintains aircraft at a safe distance apart, has been shown to yield efficient taxi routes. However, this approach depends on the order in which aircraft are chosen for allocating routes. Finding the right order in which to allocate routes to the aircraft is a combinatorial optimization problem in itself. We apply a rolling window approach incorporating a genetic algorithm for permutations to this problem, for real-world scenarios at three busy airports. This is compared to an exhaustive approach over small rolling windows, and the conventional first-come-first-served ordering. We show that the GA is able to reduce overall taxi time with respect to the other approaches.
Status: Book Chapter: author post-print (pre-copy editing)
Rights: This item has been embargoed for a period. During the embargo please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study. Publisher policy allows this work to be made available in this repository. Published in Proceedings of the Genetic and Evolutionary Computation Conference 2018 by ACM. The original publication is available at:

Files in This Item:
File Description SizeFormat 
rolling-window-ga-forrepository.pdf1.03 MBAdobe PDFUnder Embargo until 1/1/2019     Request a copy

Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.



This item is protected by original copyright



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

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.