首页 | 官方网站   微博 | 高级检索  
     

一种改进的粒子群优化算法
引用本文:武妍,徐敏.一种改进的粒子群优化算法[J].计算机工程与应用,2006,42(33):40-42,73.
作者姓名:武妍  徐敏
作者单位:同济大学,计算机科学与工程系,上海,200092
摘    要:作为群体智能的代表性方法之一,粒子群优化算法(PSO)通过粒子间的竞争和协作以实现在复杂搜索空间中寻找全局最优点。提出了一种改进的粒子群优化算法(MPSO),该算法以广泛学习粒子群优化算法(CLPSO)的思想为基础,主要引入了选择墙的概念。同时在参数的设置中结合高斯分布的概念,以提高算法的收敛性。实验结果表明,改进后的粒子群算法防止陷入局部最优的能力有了明显的增强。同时,算法使高维优化问题中全局最优解相对搜索空间位置的鲁棒性得到了明显提高。

关 键 词:粒子群  优化  进化计算
文章编号:1002-8331(2006)33-0040-03
收稿时间:2006-08
修稿时间:2006-08

Modified Particle Swarm Optimization Algorithm
WU Yan,XU Min.Modified Particle Swarm Optimization Algorithm[J].Computer Engineering and Applications,2006,42(33):40-42,73.
Authors:WU Yan  XU Min
Affiliation:Department of Computer Science and Engineering,Tongji University,Shanghai 200092,China
Abstract:As a representative method of swarm intelligence,Particle Swarm Optimization(PSO) is an algorithm for searching the global optimum in the complex space through cooperation and competition among the individuals in a population of particle.A Modified PSO(MPSO) is presented in this paper.This method mainly inducts a new concept called selecting walls on the base of the idea of the CLPSO and combines the Gaussian distribution in controlling the parameters to improve the convergence ability.The experimental result indicates that the modified PSO increases the ability to break away from the local optimum.Simultaneously,the algorithm obtains a robust optimization performance regardless the location of the global optimum in the high dimension problem.
Keywords:particle swarm  optimization  evolutionary computation
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号