摘要
利用遗传算法进行寻优有时候遗传操作会陷入局部寻优,造成早熟,使遗传操作收敛不到最优解.针对这一问题,提出一种基于分组排挤机制的遗传算法,将种群个体进行分组,引入基于海明距离的排挤机制,不仅可以防止早熟,而且可以加快收敛速度.最后用普通遗传算法与之进行比较,证明其可行性和有效性.
Sometimes the genetic algorithm would be in a local search and cause the premature convergence problem when using it to solve the function optimization,and the genetic algorithm converges on less than optimal solution.In order to handle the problem,an improved genetic algorithm based on the grouping and exclusion mechanism is put forward,each generation of individuals is grouped,and the introduction of the exclusion mechanism based on Hamming distance,it can not only prevent premature,but also speed up the convergence.the algorithm feasibility and effectiveness are proved by comparing the algorithm with general genetic algorithm.
出处
《北华大学学报(自然科学版)》
CAS
2010年第5期471-473,共3页
Journal of Beihua University(Natural Science)
基金
山西省高校科技开发项目(20091151)
运城学院2009年度院级基础研究项目(JC-2009017)
关键词
分组
排挤机制
遗传算法
group
exclusion mechanism
genetic algorithm