基于单机排序问题的降落飞机分组排序方法  

A Method of Grouped Arrival Aircrafts Scheduling Based on Single Machine Scheduling Problem

作　　者：杨秋辉[1] 游志胜[1] 洪玫[1] 

机构地区：[1]四川大学计算机学院,四川成都610065

出　　处：《四川大学学报（工程科学版）》2004年第6期106-110,共5页Journal of Sichuan University (Engineering Science Edition)

基　　金：国家自然科学基金资助项目(69732010)

摘　　要：为使单跑道降落飞机排序结果在实际操作时可行、简单,首先限制同一航路段上的飞机按照先来先服务的原则排序,在最终的排序中,其拓扑次序不变;其次提出了将飞机分组排序的思想,对同一航路段上刚好满足最小安全间隔的飞机做为一个飞机组参与排序。使用1|chains|∑wjcj做为排序模型,通过求解各飞机链的ρ因子可以快速得到排序结果。将本方法用于对双流国际机场和其它几个机场的实际航迹数据进行计算,得到的排序序列完全符合实际管制需要,具有很高的推广应用价值。In order to make sure that the scheduling of arrival aircrafts landing on single runway is operable and simple,two limits are exerted to aircrafts.First, aircrafts on the same route segment obey the rule of First Come First Served. In the final sequence, their topological order is kept; Second, aircrafts satisfied the minimal safety space are grouped as a whole. We apply 1|chains|∑w_jc_j as scheduling model, by using the factor ρ we can get the final schedule quickly. We apply this method to the real track data from Shuangliu International Airport and other airports. The schedule can satisfy the need completely.

关 键 词：空中交通流量管理 飞机排序 单机排序问题 加权总完工时间 

分 类 号：TP273.1[自动化与计算机技术—检测技术与自动化装置]