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

通过缓冲高适应度个体改进遗传算法实现的收敛特性
引用本文:王东,吴湘滨. 通过缓冲高适应度个体改进遗传算法实现的收敛特性[J]. 信息技术与信息化, 2006, 0(4): 73-76
作者姓名:王东  吴湘滨
作者单位:1. 中南大学地学与环境工程学院,湖南,长沙,410083;佛山科学技术学院计算机科学与技术系,广东,佛山,528000
2. 中南大学地学与环境工程学院,湖南,长沙,410083
摘    要:文中概要阐述了遗传算法的算法实现产生过早收敛的原因,提出了在常规遗传算法中增加对最优个体缓冲的改进算法,延长具有高适应度个体的生存期,进而维持较高的种群多样性,以获得更好的收敛速度和优化解,并对建立缓冲区的一些规则进行了讨论。文中以求解旅行商问题为例,对改进前后的遗传算法的运行情况进行对比分析,结论为改进算法能获得更好的收敛性能。

关 键 词:遗传算法  算法编程  缓冲  收敛特性  最优解
修稿时间:2006-03-17

Improving Convergence Property of Genetic Algorithms Implement by Buffering Indviduals with High Fitness
WANG Dong,WU Xiang-bin. Improving Convergence Property of Genetic Algorithms Implement by Buffering Indviduals with High Fitness[J]. Information Technology & Informatization, 2006, 0(4): 73-76
Authors:WANG Dong  WU Xiang-bin
Affiliation:WANG Dong WU Xiang-bin
Abstract:This paper narrates the premature convergence reason of genetic algorithms implement in brief. The reason is that potent genes are lost due to absorption property of algorithms. In the final analysis, the property disrupts prematurely diversity of population. Adding buffer of individuals with better or best fitness to canonical genetic algorithms can prolong lifecycle of these individuals and preserve diversity of population for more long time. Therefore, convergence speed and property of genetic algorithms can be improved. Some regulations used to establish the buffer are discussed also in this paper. Finally, we take an example of traveling salesman problem (TSP) to validate above-mentioned idea.
Keywords:Genetic Algorithms Genetic Programming Buffering Convergence Properties Optimum Solution  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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