基于改进的遗传算法航班进港排序模型研究  

Research on Arrival Flights Landing Sequence Based on Improved Genetic Algorithm

作　　者：焦潇冰 费向东[1] 谢泽辉 

机构地区：[1]四川大学计算机学院视觉合成图形图像技术重点学科实验室,四川成都610064

出　　处：《计算机技术与发展》2014年第2期246-249,共4页Computer Technology and Development

基　　金：国家"863"高技术发展计划项目(2012AA011804;2012AA011801)

摘　　要：根据不同飞机间尾流间隔建立了以航班总延误时间为目标函数的排序模型,提出了基于精英策略下"截断+锦标赛"的复合选择算子、均匀交叉算子等策略的遗传算法,并按自适应的交叉、变异概率计算和十进制直观编码方式对其进行了改进。基于这种改进的遗传算法,仿真模拟得到进港航班总延误时间为157 1 s,比先到先服务方法(FCFS算法)和传统的遗传算法得到的总延误时间分别减少了465 s和187 s。说明该改进方法能明显提高求解性能,减少航班延误时间。Established a sort model based on the wake interval of different aircrafts, the objective function was the total delay of different flights. Put forward the improved genetic algorithm based on compound selection, uniform crossover operator with cut off and championship under elicit tactics, then made a improvement in accordance with adaptive crossover probability and variation probability, with intuitive decimal coding mode. The simulation results with this improved genetic algorithm show that the method could obviously improve problem solving performance ,and the total delay of arrival flight sequencing and scheduling was 157 I s,reduces 465 sand 187 s compared with FCFS algorithm and traditional genetic algorithm.

关 键 词：遗传算法 改进 复合选择算子 均匀交叉算子 进港排序模型 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]