A Rolling Window with Genetic Algorithm Approach to Sorting Aircraft for Automated Taxi Routing

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-firstserved ordering. We show that the GA is able to reduce overall taxi time with respect to the other approaches

A Rolling Window with Genetic Algorithm Approach to Sorting Aircraft for Automated Taxi Routing

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

Proceedings of the 19th Sound and Music Computing Conference

Proceedings of the 19th Sound and Music Computing Conference - June 5-12, 2022 - Saint-Étienne (France). https://smc22.grame.f