【24h】

A New Strategy for Improving Particle Swarm Optimization

机译:改进粒子群算法的新策略

获取原文

摘要

Particle Swarm Optimization(PSO)has proved its ability in solving complex search and optimization problems. From the earliest presentation of the algorithm, it has been acknowledged that the technique's major weakness is its propensity to converge prematurely on early,possibly suboptimal solutions.In this paper,we propose some new strategies to improve the search performance of standard PSO. In order to balance the global search and local search ability, the new version of PSO adopts nonlinear decay approach to adjust the inertia weight and asynchronous timevarying approach to adapt the learning factors.Meanwhile,"Function Stretch" technology is used to improve the local search performance.Two benchmark functions and a nonlinear constrained optimization problem are used to test the proposed algorithm.Experimental results show that the PSO with proposed modified strategies b effective and efficient.
机译:粒子群优化算法(PSO)已经证明了其解决复杂搜索和优化问题的能力。从算法的最早介绍开始,就已经认识到该技术的主要弱点是它倾向于过早地收敛于早期的,可能不是最优的解决方案。本文提出了一些提高标准PSO搜索性能的新策略。为了平衡全局搜索和局部搜索能力,新版本的PSO采用非线性衰减方法来调整惯性权重,并采用异步时变方法来适应学习因素。同时,采用“函数拉伸”技术来改进局部搜索实验结果表明,提出的改进策略的粒子群优化算法是有效的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号