作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

›› 2004, Vol. 30 ›› Issue (15): 28-.

• 论文 • 上一篇    下一篇

基于网格和Hamming距离的伪并行遗传算法

陈海英,郭巧,徐力   

  1. 北京理工大学机器人研究中心,北京理工大学机器人研究中心,北京理工大学机器人研究中心 北京 100081
  • 发布日期:2004-08-15

Pseudo-parallel Genetic Algorithms Based on Grid and Hamming-distance

CHEN Haiying, GUO Qiao, XU Li   

  • Published:2004-08-15

摘要: 为了克服简单遗传算法“早熟”现象及慢速收敛性,提出基于网格和Hamming距离的伪并行遗传算法,即用随机选取的决策变量把整个搜索空间网格划分,在每个网格内用基于Hamming距离的随机化方法初始化子种群,同时引入多遗传算子和无约束移民策略和替换策略。该算法在一定程度上克服了引发算法早熟的“超级个体”和“封闭竞争”问题。测试实例说明,相比其他遗传算法,该算法更有效地抑制了“早熟”现象,其运行速度和精度也得到了相应的提高。

关键词: 伪并行遗传算法, 早熟, 网格, Hamming距离, 函数优化

Abstract: For overcoming the premature and low convergence of simple genetic algorithms (SGA), this paper puts forward pseudo-papallel genetic algorithm based on grid and Hamming-distance (PPGAGH), that is partition the whole search space using grid, and generates initial subpopulation in each grid using random based on Hamming-distance. Multi-genetic operators and unrestricted migration strategy and substitution strategy arc also introduced. This algorithm overcomes "super-individual" and "close competition" problems which lead premature of SGA in a way. Test results show that PPGAGH can not only restrain the premature more efficiently but also improve convergence speed and accuracy compared with other GA.

中图分类号: