复杂终端区进场交通流优化排序方法研究

为提高终端区时空资源利用率，增强空中交通 运行效率，研究了复杂终端区进场交通流优化排序问题。通过深入剖析终端区进场定位点、 航路航线、多跑道系统等资源运行特性，综合考虑尾流间隔、移交间隔、多跑道运行间隔等 各类约束限制，以及最小化航班延误时间、最大化跑道运行容量、最小化终端区飞行时间等 优化目标，建立了复杂终端区进场交通流优化排序模型，并采用带精英策略的非支配排序遗 传算法对所建模型进行求解。选取上海多机场组成的复杂终端区进行实例验证，仿真实验表 明提出的优化方法相比先到先服务方法(First come first serve,FCFS)，航班总延误时间 减少20.7%，终端区等待时间减少60.7%，终端区进场交通流运行效率得到显著提升。

Optimized Sequencing and Scheduling Approach for Arrival Traffic Flow at Complex Terminal Area

In order to improve the spatio tem poral resource availability and the operational efficiency of air traffic at ter minal area, the sequencing and scheduling problem of arriva l traffic flow at complex terminal area is studied. By deeply analyzing the oper ational characteristics of arrival fix, route and runway system, constraints such as the wake turbulence separation, the control handoff separation and the multi runway operating separation are considered synthetically. Then an optimized model for arrival sequencing and scheduling problem is established to balance the different targets such as minimizing the total delay of all arrival flights, maximizing theoperational capacity of runway system and minimizing the flying time of all arrival flights at terminal area. Based on the theory of the elitist non dominated sorting genetic algorithm, Pareto optimal solutions are searched in the solution space. Selecting the terminal area of Shanghai multi-airport system as an simulation example, the results show that the proposed method has a 20.7% reduction in flight delays, and a 60.7% reduction in flight waiting time at terminal area compared with the method of first come first serve(FCFS), which can significantly improve the efficiency of arrivals at complex terminal area.