Optimization of terminal area arrival flight sorting based on an improved sparrow search algorithm

Abstract

At present, airspace congestion and flight delays have become widespread concerns. This study aims to optimize the sequencing of arrival flights in the terminal area of multirunway airports. Considering the constraints of multiple runways, slant intervals and moving flight positions, this article establishes an optimization model for arrival flight sequencing in a multirunway airport terminal area. Accordingly, an improved sparrow search algorithm (ISSA) is proposed based on Chebyshev chaotic mapping, the golden sine strategy, and the variable neighborhood strategy. Through six basic test functions, the ISSA is compared with particle swarm optimization, the whale optimization algorithm, the genetic algorithm, and other algorithms to verify its superiority. Finally, two sets of instance data from Kunming Changshui Airport were used for experiments. The results show that the total delay times (TDTs) of small-scale flights (number of aircraft: 29) and large-scale flights (number of aircraft: 147) are 55.3% and 20.5% lower, respectively, than those of the first-come-first-served algorithm. The superiority of the ISSA designed in this article is verified, and it can significantly reduce the TDTs of arrival flights. It is suitable for optimizing arrival flights during peak hours at most airports. This approach provides theoretical support for optimizing the sorting of flights in terminal areas.