Multi-Objective Route Planning for Aircraft Taxiing Under Different Traffic Conflict Types

Abstract
Aircraft taxiing in large airports is often delayed by traffic conflicts. The increased fuel consumption and pollutant emission lower the efficiency of airport surface operation and bring potential safety hazards. Previous studies on route planning for surface taxiing seldom involve refined delay analysis under different traffic conflict types and discussions on route planning at airports with various environmental parameters and under diverse aircraft types. In this study, dynamic models of crossing, head-on, and trailing conflicts during aircraft taxiing were constructed, and delays of these three conflict types were determined. The shortest route set of restricted routing was determined by the Yen algorithm according to the topological network, conflict-induced delay, and spatial distributions of taxiing at airports. Considering the three optimization objects, the aircraft route planning was optimized and determined from the shortest route set according to the differences in the environmental parameters and aircraft types. Experiment results show that the proposed method achieves 9.6–12.1% higher route planning precision in all traffic periods compared with previous route planning with considerations to taxiing conflict. This method also provides support to the dynamic decision of airport operation and control departments according to the environment and performance of aircraft.
Funding Information
  • National Natural Science Foundation of China (U1633119, 71271113, and U1233101)