混合粒子群优化算法研究  

Research on Hybrid Particle Swarm Optimization

作　　者：俞欢军[1] 许宁[1] 张丽平[1] 胡上序[1] 

机构地区：[1]浙江大学智能信息工程研究所,浙江杭州310027

出　　处：《信息与控制》2005年第4期500-504,509,共6页Information and Control

基　　金：国家自然科学基金资助项目(20076041)

摘　　要：提出将Hooke-Jeeves模式搜索方法嵌入粒子群优化算法中,以此构建混合粒子群优化算法.此外,在搜索过程中还加入变异操作来增加种群多样性,以避免早熟收敛.其中,局部搜索增加了算法的开发能力,而变异操作提高了算法的探测能力.探测与开发的折中则通过两个域值变量来完成.大量的测试函数研究表明,混合粒子群优化算法局部搜索能力有显著提高,且搜索到全局最优的概率更高.A hybrid particle swarm optimization （HPSO） is proposed, where the Hooke-Jeeves pattern search is combined with PSO to speed up the local search, also mutation operation is embedded to avoid the common defect of premature convergence. Two thresholds are adopted to balance the exploration and exploitation abilities. The performance of new algorithm is demonstrated through extensive benchmark functions and compared with that of the PSO.The obtained results show that the local search ability is improved, and the probability of finding the global optimal value by HPSO is larger than that by using PSO.

关 键 词：混合 粒子群优化 局部搜索 变异 

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