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

基于粒子群算法的遗传算法研究
引用本文:王文义,秦广军,王若雨.基于粒子群算法的遗传算法研究[J].计算机科学,2007,34(8):145-147.
作者姓名:王文义  秦广军  王若雨
作者单位:1. 中原工学院计算机系,郑州450007
2. 郑州大学信息工程学院,郑州450052
3. 河南电力职工大学网络信息中心,郑州450051
摘    要:针对传统遗传算法存在的早熟收敛和易陷入局部最优解的问题,提出了一种基于粒子群算法的遗传算法,其原理是用粒子群算法来构造变异算子和进行种群分割.通过对三个典型多峰值函数的优化来评估算法性能.实验结果表明,该算法能很好地保持种群的多样性和克服早熟现象,显著提高遗传算法的收敛速度.

关 键 词:遗传算法  粒子群算法  变异算子  种群多样性  早熟收敛

Research on Genetic Algorithm Based on Particle Swarm Algorithm
WANG Wen-Yi,QIN Guang-Jun,WANG Ruo-Yu.Research on Genetic Algorithm Based on Particle Swarm Algorithm[J].Computer Science,2007,34(8):145-147.
Authors:WANG Wen-Yi  QIN Guang-Jun  WANG Ruo-Yu
Affiliation:1. Deprt. of Computer Sience,Zhongyuan Institute of Technology, Zhengzhou 450007; 2. Information Engineering College of Zhengzhou University, Zhengzhou 450052; 3.Network and Information Center, Henan University of Electric Power and Workers, Zhengzhou 450051
Abstract:Premature convergence and weak local optimization are two key problems existing in the conventional genetic algorithm.To overcome the shortcomings,this paper proposes an improved genetic algorithm based on the particle swarm algorithm.The basic principle is that a new mutation operator is constructed and population is divided into parts.Three typical multimodal values functions are optimized and evaluate the efficiency of the algorithm.The experimental results show,the improved genetic algorithm can not only maintain effectively the polymorphism in the colony and avoid premature,but also greatly improve the convergent speed.
Keywords:Genetic algorithm  Particle swarm algorithm  Mutation operator  Population diversity  Premature convergence
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机科学》浏览原始摘要信息
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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