终端区进场流的路径选择研究

A Study on Path Selection of Arrival Flow at Airport Landing Areas

在实际运行中,通常依据管制员的经验对进场航班流的路径进行管理,缺乏科学性。针对终端区进场流的路径选择与进场排序的流量管理问题,以进场航班的总完成时间最短为目标,建立基于时间窗与位置约束的路径选择与排序的数学模型。采用先选择路径再排序的循环寻优的方法进行求解,将禁忌搜索(TS)与排序算法相结合,设计了TS-FCFS与TS-DP两种算法,着重建立了基于关键路径的邻域结构,并加入有效的重置(RESTAR)策略,使算法快速有效的收敛至最优解。最后借助SIMMOD仿真平台验证算法的可行性。以北京首都机场21架航班为例,仿真结果显示,TS-FCFS与TS-DP两种方法较原计划的进场路径总完成时间分别节约了149s与175s。该路径选择算法降低了进场时间,提高了终端区进场效率。通过合理优化进场航班流的路径选择与进场排序,平衡了跑道负荷,减少了航空器间潜在的冲突,同时为管制员调配进场航班流提供了合理有效的路径选择建议。

It is subjective to manage path selection of arrival flights on basis of the controllcrs/ experiences. In terms of path selection and scheduling of arrival flights in the landing areas, a mathematical model apletion time is thus developed based on time window and position constraints. This model uses a loop optimization, i.c.,select a path then schedule a flight. By combining Tabu search （TS） algorithm and a scheduling algorithm,two new algo-rithms are proposed as T-abu Search-First Come First Service （TS-FCFS） and Tabu Search-Dynamic Programming （TS- DP）. Neighborhood structure based on critical paths is created,and an effective REST＇AR strategy is included to acceler-ate the convergence towards the optimal solution. A simulation platform （SIMMOD.） ithese algorithms. For a case study of 21 flights in Beijing Capital International Airport,simulation pared with the path planning based on controllcrs/ experiences, the TS-FCFS and TS-DP algorithms can reduce the totaltime for path selection by 14 9 s and 175 s respectively. Thcse algorithms provide efficient path selection with reduced arrival time for arrival flights in the landing areas. Optimizations of path selection and scheduling can not only balance the runway load, but also reduce the potential conflicts of the arrival flights. Thcse algorithms should provide the controllers with reasonable and effective recommendations for path selection.