基于分支定界法的进场航空器动态排序与调度  

Dynamic Arrival Sequencing & Scheduling Based on Branch & Bound Algorithm

作　　者：张军峰[1] 王菲[1] 葛腾腾[1] 

机构地区：[1]南京航空航天大学民航学院,江苏南京210016

出　　处：《系统仿真学报》2016年第8期1909-1914,共6页Journal of System Simulation

基　　金：国家自然科学基金(71401072);江苏省自然科学基金(BK20130814))

摘　　要：进场航空器优化排序和调度是跑道资源合理分配和充分利用的前提,是提高终端空域运行效率的基础。通过基于时间触发的滑动时间窗实现了进场动态排序。在精确四维航迹预测的基础上,结合管制运行约束,采用分支定界法对时间窗内航班进行优化排序与调度。以上海浦东机场为例进行仿真验证,将优化结果分别同先到先服务算法结果与航班的实际到达时间进行对比。结果表明:该算法可有效地提高跑道容量,缓解航班延误,是实现跑道资源优化配置的有效方法。Optimization of arrival sequencing and scheduling is not only the prerequisite for properly allocating and fully utilizing the runway resource, but also the fundamental element for improving terminal operation efficiency. Dynamic arrival sequencing was obtained by time-triggered sliding time window method. On the basis of accurate 4D trajectory prediction, branch and bound algorithm was adopted to generate an optimal sequence, combined with the actual operation constraints. Taking Shanghai Pudong Airport as an example for simulation, the optimization results were compared with the actual landing time and simulation results based on first come first serve strategy. The results indicate that the proposed algorithm could effectively not only enhance the runway capacity but also alleviate flight delays, and could be an effective method to realize runway resource proper allocation.

关 键 词：交通运输规划 排序与调度 滑动时间窗 分支定界 决策支持 

分 类 号：V355[航空宇航科学与技术—人机与环境工程]