求解高维函数优化的动态粒子群算法  

Dynamic particle swarm optimization for solving high dimensional function

作　　者：孙兰兰[1] 王晓超[2] 

机构地区：[1]浙江工业职业技术学院,浙江绍兴321000 [2]漯河医学高等专科学校,河南漯河462002

出　　处：《计算机工程与应用》2011年第27期36-37,51,共3页Computer Engineering and Applications

基　　金：国家自然科学基金(No.70701013)~~

摘　　要：针对基本粒子群优化算法对高维函数优化时搜索精度不高的缺陷,提出了一种动态粒子群优化算法。该算法采用了通过调节阈值对粒子运动轨迹进行动态改变的策略,使得粒子对周围环境的适应能力不受进化代数的影响,从而保证了算法在迭代后期仍具有较强的搜索能力。实验结果表明,与文献算法相比,该算法在处理高维函数优化时具有更强的寻优能力和更高的搜索精度。To improve the search quality of the standard PSO algorithm for solving high-dimensional function,a dynamic particle swarm optimization algorithm is proposed.The strategy that particle trajectory is changed dynamically by adjusting the threshold value is used to make particles adaptability for the surrounding environment without the influence of evolutionary algebra,and the strong search capability of algorithm in iterative later is ensured.Simulations show that proposed algorithm has more powerful optimizing ability and higher optimizing precision in high-dimensional function optimization than literature algorithms.

关 键 词：粒子群优化算法 动态粒子群优化算法 高维函数优化 

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