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

面向高维度目标函数的微粒群优化算法
引用本文:赵海,宋纯贺,祁田宇,龚红艳.面向高维度目标函数的微粒群优化算法[J].东北大学学报(自然科学版),2008,29(5):649-652.
作者姓名:赵海  宋纯贺  祁田宇  龚红艳
作者单位:东北大学信息科学与工程学院,辽宁沈阳,110004
摘    要:针对基本微粒群算法在处理高维度目标函数容易出现早熟的问题,提出了一种新的微粒群算法面向高维度目标函数的微粒群算法(HDOF-PSO).分析了基本微粒群算法难以处理高维度目标函数的原因.通过引入信心度和试探策略,算法的收敛速度得到提高;通过引入成功度,搜索过程中的变异概率能够自适应修正.在特定测试函数集上的实验表明,HDOF-PSO在处理高维目标函数时,比基本微粒群算法和一个改进的微粒群算法具有更快的收敛速度和更好的收敛性.

关 键 词:群体智能  微粒群算法  高维度  自适应试探  自适应变异  
文章编号:1005-3026(2008)05-0649-04
修稿时间:2007年6月10日

Study on Higher Dimensional Object Function of PSO
ZHAO Hai,SONG Chun-he,QI Tian-yu,GONG Hong-yan.Study on Higher Dimensional Object Function of PSO[J].Journal of Northeastern University(Natural Science),2008,29(5):649-652.
Authors:ZHAO Hai  SONG Chun-he  QI Tian-yu  GONG Hong-yan
Institution:(1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
Abstract:A higher-dimensional-object-function particle swarm optimizer HDOF-PSO algorithm is proposed for the prematurities which are easy to take place when dealing with the higher-dimensional object function by BPSO(basical particle swarm optimizer) algorithm.The reason why HDOF-PSO is difficult to be deal with hasical PSO algorithm is analyzal.The confidence level and trial-and-error strategy are introduced into the algorithm to accelerate its convergence rate with the probability of success also introduced in to enable the adaptive correction available to the probability of mutation in searching process.The experimental results of a specific set of benchmerk functions showed that the HDOF-PSO algorithm has better convergence and higher dimensional object functions.
Keywords:swarm intelligence  PSO algorithm  higher dimension  adaptive trial-and-error  adaptive-mutation
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《东北大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《东北大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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