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

基于群体列突变遗传算法的遍历性
引用本文:孟祥武,张玉洁. 基于群体列突变遗传算法的遍历性[J]. 北京邮电大学学报, 2002, 25(1): 27-29. DOI: 10.3969/j.issn.1007-5321.2002.01.004
作者姓名:孟祥武  张玉洁
作者单位:北京邮电大学计算机科学与技术学院,北京,100876
摘    要:通过分析遗传算法过早收敛的原因,提出了一种基于群体列突变的遗传算法,分析了这种遗传算法交换和突变操作的特性,证明该遗传算法能够进行遍历搜索.该算法克服了遗传算法的局限性,通过群体列突变能够避免过早收敛,并找到最优解.

关 键 词:并行算法  遗传算法  突变操作  过早收敛
文章编号:1007-5321(2002)01-0027-03
修稿时间:2001-04-25

The Traversing of Genetic Algorithms Based on Mutation of Column in Population
MENG Xiang wu,ZHANG Yu jie. The Traversing of Genetic Algorithms Based on Mutation of Column in Population[J]. Journal of Beijing University of Posts and Telecommunications, 2002, 25(1): 27-29. DOI: 10.3969/j.issn.1007-5321.2002.01.004
Authors:MENG Xiang wu  ZHANG Yu jie
Abstract:The reason for premature convergence of genetic algorithms is analyzed, and then an genetic algorithms based on mutation of column in population is presented, the properties of crossover and mutation in this genetic algorithms are analyzed, the traversing property of this genetic algorithms is proved. The new algorithm copes with the limitations of genetic algorithms, can avoid premature convergence by mutation of column in population, and find optimal solutions.
Keywords:parallel algorithms  genetic algorithms  mutation  premature conver gence
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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