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

基于粒子空间扩展的协同微粒群优化算法
引用本文:劳玲英,胡小兵.基于粒子空间扩展的协同微粒群优化算法[J].计算机工程与应用,2007,43(30):59-61.
作者姓名:劳玲英  胡小兵
作者单位:重庆大学数理学院,重庆400044
基金项目:重庆市自然科学基金 , 重庆大学校科研和校改项目 , 重庆大学校科研和校改项目
摘    要:针对协同微粒群优化存在的停滞现象,提出了一种新的基于粒子空间扩展的协同微粒群优化算法。该算法通过引入粒子半径来确定粒子间是否发生相互碰撞,如果两个粒子一旦发生碰撞,则按预先设定的位置更新公式跳出原来的位置,从而避免陷入停滞状态。对三个典型函数的测试结果表明,新算法不仅能够有效地克服了停滞现象,而且显著提高了搜索更优解的能力和鲁棒性。

关 键 词:协同  空间扩展  停滞  粒子群优化
文章编号:1002-8331(2007)30-0059-03
修稿时间:2007-02

Cooperative particle swarm optimization algorithm based on particle's spatial extension
LAO Ling-ying,HU Xiao-bing.Cooperative particle swarm optimization algorithm based on particle''''s spatial extension[J].Computer Engineering and Applications,2007,43(30):59-61.
Authors:LAO Ling-ying  HU Xiao-bing
Affiliation:School of Mathematics & Science,Chongqing University,Chongqing 400044,China
Abstract:Aiming at the stagnation exists in the cooperative particle swarm optimization,presents a new kind of the cooperative particle swarm optimization algorithm based on particle's spatial extension.This algorithm can decide whether or not collision happens between particles by introducing the radius of particle.Once two particles collide,they can jump out of their original location according to location update formula given in advance,which can avoid trapping in stagnation.The test of the new algorithm on three typical functions shows that new algorithm not only can conquer the stagnation effectively,but can effectively improve the ability of searching better solutions and robustness.
Keywords:cooperation  spatial extension  stagnation  particle swarm optimization
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号