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

Niche genetic algorithm research based on average method

作　　者：赵远东[1] 汪怡[2] 

机构地区：[1]南京信息工程大学 电子与信息工程学院,南京210044 [2]南京信息工程大学 信息与控制学院,南京210044

出　　处：《南京信息工程大学学报（自然科学版）》2013年第6期553-556,共4页Journal of Nanjing University of Information Science & Technology（Natural Science Edition）

基　　金：公益性行业(气象)科研专项(GY-HY201206070)

摘　　要：为了避免遗传算法种群中个体过早陷入局部最小,在以往随机初始种群的基础上提出一种均分法,使得初始种群随机平均地分为若干个子种群,形成小生境,这样既维持了种群的多样性,也使得种群中的个体不会过早出现早熟现象,更提高了算法的收敛速度.同时采用了自适应技术控制交叉和变异的概率,使得算法能更快速地找到最优解.仿真结果表明,与传统的遗传算法优化RBF网络相比较,新算法的迭代次数更少,精度更高,大大提高了收敛速度.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.

关 键 词：小生境技术 快速遗传算法 自适应技术 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]