基于进化稳定策略的遗传算法-citeseer.pdfVIP

1000-9825/2003/14(11)1863 ©2003 Journal of Software 软 件 学 报 Vol.14, No.11 ∗ 基于进化稳定策略的遗传算法 + 苏小红, 杨 博 , 王亚东 (哈尔滨工业大学 计算机科学与技术学院,黑龙江 哈尔滨 150001) A Genetic Algorithm Based on Evolutionarily Stable Strategy + SU Xiao-Hong, YANG Bo , WANG Ya-Dong (School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China) + Corresponding author: Phn: 86-451-6413142, E-mail: boyang621@ Received 2002-06-06; Accepted 2002-11-20 Su XH, Yang B, Wang YD. A genetic algorithm based on evolutionarily stable strategy. Journal of Softwar e, 2003,14(11):1863~1868. /1000-9825/14/1863.htm Abstract: An improved genetic algorithm based on the evolutionarily stable strategy is proposed to avoid the problem of local optimum. The key to this algorithm lies in the construction of a new mutation operator controlled by a stable factor,, which maintains the polymorphism in the colony by setting a stable factor and changing certain best seeds to mutant. Therefore, the operator can keep the number of the best individuals at a stable level when it enlarges the search space. The simulation experiments show that this algorithm can effectively avoid the premature convergence problem caused by the high selective pressure. Moreover, this algorithm improves the ability of searching an optimum solution and increases the convergent speed. This algorithm has extensive application prospects in many practical optimization problems. Key words: evolutionarily stable strategy; genetic algorithm; mutation operator; stable factor; premature convergence 摘 要: 为了解决传统遗传算法易陷入局部最优解的问题,在借鉴生物学中“进化稳定策略” 的基础上,对传统 的遗传算法进行了改进,提出了基于进化稳定策略的遗传算法.该算法的核心在于,稳定参数控制下的突变算子 的构造,通过稳定参数的设定来稳定种群中最优个体的数目,并有目标地对最优