基于GA的飞行员模拟机排班问题求解  

Solution of Pilot Simulator Timetable Problem Based on Genetic Algorithm

作　　者：刘文斌[1] 张守志[1] 施伯乐[1] 

机构地区：[1]复旦大学计算机科学技术学院,上海200433

出　　处：《计算机工程》2011年第15期140-142,共3页Computer Engineering

基　　金：上海市卢湾区博士后创新实践基金资助项目

摘　　要：飞行员模拟机复训问题是一个多目标、多资源约束的排班问题,具有较高的复杂度,传统遗传算法无法有效求解该问题。为此,提出一种新的遗传算法,利用基因适应度对交叉、选择操作进行改进,以提高种群的多样性和进化性能。在仿真数据和真实数据上的实验结果表明,该算法有效提高了解的精度,加快了种群的收敛速度。The pilot simulator scheduling problem is a multi-objective and multi-constrained timetable problem. High complexity of the problem makes it impossible to solve it by using traditional Genetic Algorithm（GA）. This paper proposes an improved GA. The new crossover and reproduction operator, which are redesigned by gene fitness, effectively increases the diversity and the evolution performance of the population. Experimental results based on simulation data and real data show that the improved algorithm can increase the precision of solutions and convergence speed of the population.

关 键 词：飞行员模拟机排班问题 遗传算法 交叉操作 选择操作 基因适应度 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]