首页> 中文期刊>南京信息工程大学学报 >基于均分法的小生境遗传算法

基于均分法的小生境遗传算法

     

摘要

In order to avoid the population premature into local minimum,a new averaging method based on a ran-dom initial population was introduced into the genetic algorithm. The initial population is stochastically divided into several sub populations to form niches,with the purpose to maintain the population diversity,make the individuals in a sub population not display prematurity phenomenon,and improve the convergence speed of the algorithm as well. The adaptive technique is employed to control the crossover and mutation probability,therefore the algorithm can find the optimal solution quickly. Simulation results show that,compared with traditional RBF neural network opti-mized by genetic algorithm,the new algorithm is characterized by less iterations,higher precision,and greatly im-proved convergence speed.%为了避免遗传算法种群中个体过早陷入局部最小,在以往随机初始种群的基础上提出一种均分法,使得初始种群随机平均地分为若干个子种群,形成小生境,这样既维持了种群的多样性,也使得种群中的个体不会过早出现早熟现象,更提高了算法的收敛速度。同时采用了自适应技术控制交叉和变异的概率,使得算法能更快速地找到最优解。仿真结果表明,与传统的遗传算法优化 RBF网络相比较,新算法的迭代次数更少,精度更高,大大提高了收敛速度。

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号