基于小波变异的粒子群算法  

Particle swarm optimization based on wavelet mutation

作　　者：石永生[1,2] 高浩[3] 陈家琪[2] 

机构地区：[1]江苏信息职业技术学院计算机工程系,江苏无锡214101 [2]上海理工大学计算机工程学院,上海200093 [3]清华大学自动化系,北京100084

出　　处：《计算机工程与设计》2011年第2期693-695,699,共4页Computer Engineering and Design

基　　金：中国博士后科学基金项目(20090460323)

摘　　要：PSO算法对复杂函数有较强的寻优能力和收敛速度快等特点,但是它依然无法保证在搜索空间中找到全局最优点。针对粒子群算法易于陷入局部最小的弱点,提出了一种基于小波变换的粒子群算法。该算法使用全局变异因子使粒子具有了良好的全局搜索能力,同时使用了局部变异因子,使算法在搜索过程中具有较高的收敛速度。典型函数优化的仿真结果表明,该算法具有寻优能力强、搜索精度高、稳定性好等优点,适合于工程应用中的函数优化问题。in spite of PSO has comparable or even superior search perforrnance for many hard optimization problems with faster and more stable convergence rates, but it can＇ t guarantee to find the global optima in the search space. To conquer the shortcoming of particle swarm optimization, a novel particle swarm optimization based wavelet function （WPSO） is introduced. The algorithm first uses a global mutation operator which makes the particle have excellent ability of search in a global scope. Furthermore, for improving the searching ability in local area, the algorithm uses the local mutation operator which makes the algorithm behaves well in local searching. Experimental simulations shows that the proposed algorithm has powerful optimizing ability, good stability and higher optimizing precision, so it can be applied in optimization problems.

关 键 词：粒子群 小波 变异 全局搜索 收敛速度 

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