求解航班时间表问题的混合遗传算法

A Hybrid Genetic Algorithm to Solve FSP

针对基于模拟退火的混合遗传算法求解航班时间表问题的特征,利用矩阵编码形成个体,使用模拟退火算法快速形成优良初始解,并构建优良基因库以改良解精度。仿真实验表明,该算法和传统模拟退火算法及遗传算法相比,所得结果的方差降低了20.6%-24.6%,进化代数降为标准遗传算法的16.58%,运行时间缩短6.3%-14.0%,且算法直观,易于实现。

This paper rithm （HGA） based makes use of matrix tries to solve the flight schedule problem （FSP） by a hybrid genetic on the simulating algorithm （SA）. In respect to the FSP characterist to create individuals, generate an improved population quickly by sim algo ics. it annealing （SA）, and construct an eminent gene pool to improve the solution. The result of emulating experiment indicates that, compared with the traditional simple GA and SA, the proposed method can reduce the error by 20. 6%-24. 6%, the evolution generation is 16. 58% of the standard genetic algorithm and the time needed is reduced by 6. 3%-14. 0%. Besides, the algorithm is simple and easy to program.