基于亲缘选择的遗传算法  

Genetic Algorithm Based on Kin Selection

作　　者：杨世达[1] 单志勇[2] 李庆华[3] 

机构地区：[1]武汉理工大学计算机科学与技术学院,武汉430072 [2]东华大学信息科学与技术学院,上海200051 [3]华中科技大学计算机科学与技术学院,武汉430074

出　　处：《计算机工程》2009年第15期10-12,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(60273075);武汉理工大学科研启动基金资助项目(09-2112)

摘　　要：针对传统遗传算法容易陷入局部最优解的缺陷,借鉴生物中亲缘选择的思想,提出基于亲缘选择的遗传算法。该算法构造新选择算子,通过按亲缘关系放弃一个解而获得另一个解来保证算法在最优解的领域内的有效搜索,提高遗传算法对全局最优解的搜索能力和收敛速度。仿真结果表明,该算法正确有效,性能优于现有的传统算法。An improved Genetic Algorithm（GA） based on the kin selection in biology is proposed to avoid the problem of local optimum. The key to this algorithm lies in the construction of a new selection operator, which offers a solution by sacrificing a solution for its kin. By doing so, it ensures an efficiently guided, through search in the neighbourhood of the best solution. This algorithm improves the ability of searching an optimum solution and increases the convergence speed. It has extensive applications for many practical optimization problems. Simulation result proves its effectiveness and better performance.

关 键 词：亲缘选择 遗传算法 早熟收敛 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]