检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国民航大学空中交通管理学院,天津300300
出 处:《航空计算技术》2015年第4期13-17,共5页Aeronautical Computing Technique
基 金:国家自然科学基金项目资助(61039001)
摘 要:空中交通管制扇区划分是应对终端区空域需求增长的重要手段。根据终端空域内交通流特征,提出终端区内扇功能性的概念。对基于计算几何和遗传算法的两阶段划分方法进行了研究,以终端区空域图模型为基础,利用改进的切轮法(Wheel-cut)得到内扇初始边界。综合考虑内外扇区管制员平均工作负荷均衡以及高峰小时交通流分配问题,利用遗传算法对内扇边界进行优化。通过大连终端区进行实例分析证明,方法能够得到理想的内外扇区划分结果,算法耗时6.5 s。Airspace sector partition is proved to be a significant method to address gradually growing demand of airspace, especially in terminal airspace. According to the characteristics of traffic flows in terminal airspace, a concept of functionality of internal sector is proposed. A two- stage method which based on computational geometry and genetic algorithm(GA) is investigated. Based on the terminal airspace graph model which built first, an improved wheel- cut method is proposed for initial partition. Then, to balance controllers'average workload between internal and external sectors and to distribute traffic flows at traffic peak hours, GA is used to optimize the initial boundary of internal sector. Dalian terminal airspace is presented as an example, and the experiment shows a promising partition result. Time cost of the optimization algorithm is 6.5 s.
分 类 号:V355[航空宇航科学与技术—人机与环境工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:13.59.91.46