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

一种改进的粒子群优化算法
引用本文:武燕,张冰.一种改进的粒子群优化算法[J].价值工程,2011,30(7):161-162.
作者姓名:武燕  张冰
作者单位:江苏科技大学电子信息学院,镇江,212003
摘    要:介绍基本粒子群优化算法的原理、特点,并在此基础上提出了一种改进的粒子群算法。通过在粒子初始化时引入相对基的原理使粒子获得更好的初始解,以及在迭代过程中引入变异模型,部分粒子生成相对应的扩张及收缩粒子,比较其适应度,保留最佳粒子进行后期迭代,使算法易跳出局部最优。通过经典函数的测试结果表明,新算法的全局搜索能力有了显著提高,并且能够有效避免早熟问题。

关 键 词:粒子群优化算法  相对基  变异模型

An Improved Particle Swarm optimization Algorithm
Wu Yan,Zhang Bing.An Improved Particle Swarm optimization Algorithm[J].Value Engineering,2011,30(7):161-162.
Authors:Wu Yan  Zhang Bing
Institution:Wu Yan;Zhang Bing(School of Electronics and Information,Jiangsu University of Science and Technology,Zhenjiang 212003,China)
Abstract:This paper introduces the principles and characteristics of Particle Swarm Optimization algorithm, and puts forward an improved particle swarm optimization algorithm. It adopted Opposition-Based Learning in initialization to get a better solution and adopted variation model which make some particles generate two corresponding shrink and expand particles and keep the best fitness particle iterate in later iteration to avoid getting into local minumum. The experimental results of classical function show this algorithm improves the global convergence ability and efficiently prevents the algorithm from the local optimization and early maturation.
Keywords:Particle Swarm Optimization(PSO)  Opposition-Based Learning  variation model
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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