节点文献
基于分支定界的离场航空器动态排序
Dynamic Departure Sequencing Based on Branch and Bound Algorithm
【摘要】 离场航空器优化排序是加速终端空域内航班流动、提高航班正点率、缓解管制工作负荷的有效手段。采用滚动时域控制(Receding horizon control,RHC)策略构建离场航空器实时动态排序框架,并基于分支定界法获取时间窗内优化的目标起飞时间。在此基础上,利用修正的离场滑行时间确定允许开车时间,从而为管制员提供决策支持。以上海浦东机场离场运行为例进行仿真验证,结果表明文中提出的方法不仅有效地实现了管制决策支持(为管制员提供目标起飞时间与允许开车时间),也能够提升跑道离场容量,降低离场延误水平。
【Abstract】 Departure sequencing is an effective means to expedite terminal air traffic flow,improve departure punctuality and alleviate controllers′workload.The framework for dynamic sequencing is built based on receding horizon control(RHC)strategy.And through the branch and bound algorithm,target takeoff time(TTOT)is optimized within the sequencing window.Furthermore,target start-up approval time(TSAT)is obtained depending on the amendment of taxi-out time so as to provide the decision support for tower controller.Taking ZSPD airport as an example for simulation,the result indicates that the proposed algorithm can realize decision support for controllers(providing TTOT & TSAT),enhance the runway departure capacity,and reduce the departure delay.
【Key words】 transportation planning; departure sequencing; sliding time window; branch and bound algorithm; decision support;
- 【文献出处】 南京航空航天大学学报 ,Journal of Nanjing University of Aeronautics & Astronautics , 编辑部邮箱 ,2015年04期
- 【分类号】V355
- 【被引频次】9
- 【下载频次】267