机场着陆排序的一种滑动窗优化算法  

Optimizing Slip Window Algorithm for Sequencing of Scheduled Arriving Aircrafts

作　　者：王莉莉[1] 史忠科[1] 张兆宁[2] 

机构地区：[1]西北工业大学空中交通管理系统研究所,西安710072 [2]中国民用航空学院空中交通管理学院,天津300300

出　　处：《中国民航学院学报》2004年第6期18-21,共4页Journal of Civil Aviation University of China

基　　金：中国民航学院科研启动基金(02-gd-16).

摘　　要：对交通拥挤时的终端区进场飞机进行合理的排序,是空中交通流量管理的一个重要研究内容。当降落飞机架次较多时,目前的各种算法因计算量太大而实时性不好。基于飞机进场时位置的调整受一定限制,通过分析窗体的大小与位置限制和步长的关系,对计算量的影响提出了滑动窗的方法,并给出了通过采用滑动窗方法可以减少运算量的理论证明。最后通过仿真对该方法进行了验证。Scheduled arriving aircrafts in an approach air space and a way to form optimizing sequences for their landings are always the main research subjects in regard to air traffic management.When the number of aircrafts approaching to the airport becomes so huge that the current algorithm cannot give an ideal solution in real time because of computational overloading, it is a big challenge.In view of the constraints of the position adjustment for approaching aircrafts, the paper,through analysis of the impact of the relationship between the window dimension, position constraints and the step-length,puts forward a sliding window method,and gives a theoretical manifestation that,with the method,the quantity of calculation can be decreased,which has been proved in an authentic simulation test.

关 键 词：空中交通管理 着陆排序 位置约束 滑动窗 

分 类 号：V249.122[航空宇航科学与技术—飞行器设计]