首页 | 本学科首页   官方微博 | 高级检索  
     

一种改进的两代竞争遗传算法
引用本文:陈玮,周激流,程进,陈莉. 一种改进的两代竞争遗传算法[J]. 四川大学学报(自然科学版), 2003, 40(2): 273-277
作者姓名:陈玮  周激流  程进  陈莉
作者单位:1. 四川大学电子信息学院,成都,610064;成都纺织高等专科学校电气系,成都,610023
2. 四川大学电子信息学院,成都,610064
摘    要:两代竞争遗传算法改变了简单遗传算法的选择机制,提高了搜索效率.但是两代竞争遗传算法易出现早熟现象,局部寻优能力并未改善.针对这些问题作者提出了一种改进算法,通过变异概率和交叉、变异范围的自适应调整,改善两代竞争遗传算法的搜索性能.实验表明,改进算法克服早熟现象,且能提高算法的局部寻优能力.

关 键 词:两代竞争遗传算法 交叉 变异 自适应调整 变异概率 搜索性能 局部寻优能力
文章编号:0490-6756(2003)02-0273-05

An Improved Genetic Algorithm with Competitive Selection between Adjacent Two Generations
CHEN Wei ,,ZHOU Ji liu ,CHENG Jin ,CHEN Li. An Improved Genetic Algorithm with Competitive Selection between Adjacent Two Generations[J]. Journal of Sichuan University (Natural Science Edition), 2003, 40(2): 273-277
Authors:CHEN Wei     ZHOU Ji liu   CHENG Jin   CHEN Li
Affiliation:CHEN Wei 1,2,ZHOU Ji liu 1,CHENG Jin 1,CHEN Li 1
Abstract:The genetic algorithm with competitive selection between adjacent two generations changes the selection method of the simple genetic algorithm, and improves search efficiency. But the two generation competitive genetic algorithm is ease to become premature, and partial the best search ability can't be improved. Improvement genetic algorithm has been proposed about these problems, thought the adaptive adjustment of the mutation probability, and the position of crossover and mutation in chromosomes, the proposed method can improve the property of the genetic algorithm with competitive selection between adjacent two generations. It's been identifying in experiment that the improved algorithm can efficiently overcome premature problem and increase the ability of the partial best search.
Keywords:genetic algorithm  crossover  mutation  adaptive adjustment
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号