一种高效粒子群优化算法  

An efficient particle swarm optimization

作　　者：高卫峰[1] 刘三阳[1] 

机构地区：[1]西安电子科技大学数学科学系,西安710071

出　　处：《控制与决策》2011年第8期1158-1162,共5页Control and Decision

基　　金：国家自然科学基金项目(60974082);中央高校基本科研业务费专项资金项目(K50510700004)

摘　　要：针对标准粒子群算法收敛速度慢和易出现早熟收敛等问题,提出一种高效粒子群优化算法.首先利用局部搜索算法的局部快速收敛性,对整个粒子群目前找到的最优位置进行局部搜索;然后,为了跳出局部最优,保持粒子的多样性,给出一个学习算子.该算法能增强算法的全局探索和局部开发能力.通过对10个标准测试函数的仿真实验并与其他算法相比较,结果表明了所提出的算法具有较快的收敛速度和很强的跳出局部最优的能力,优化性能得到显著提高.To the problems of low searching speed and premature convergence frequently appeared in standard particle swarm optimization（PSO） algorithm, an efficient particle swarm optimization（AEPSO） is proposed in this paper. The method makes full use of the local convergent performance of the local random search algorithm to optimize the global best position of the swarm found so far. Then to go out of the local optimum in PSO and maintain the population diversity in the process of evolution, a learning operator is presented. This algorithm can enhance the exploration and exploitation ability of the algorithm. Through testing the performance of the proposed approach on a suite of 10 benchmark functions and comparing with other rneta-heuristics, the result of simulation shows that the proposed approach has better convergence rate, great capability of preventing premature convergence and superior performance.

关 键 词：粒子群优化 局部搜索 学习算子 差分进化 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]