首页> 外文会议>2017 International Electronics Symposium on Knowledge Creation and Intelligent Computing >Multi-group particle swarm optimization with random redistribution
【24h】

Multi-group particle swarm optimization with random redistribution

机译:具有随机重新分布的多组粒子群优化

获取原文
获取原文并翻译 | 示例

摘要

Particle Swarm Optimization (PSO) is fast and popular algorithm to find the optimum value of non-linear and multi-dimensional function. However, it often easily trapped into local optima because the particles move closer to the best particle quickly. This paper purposes a new algorithm called Multi-Group Particle Swarm Optimization with Random Redistribution (MGRR-PSO) that tried to solve the weakness of standard PSO. MGRR-PSO combines two groups of PSO with opposite acceleration coefficients. In addition, some particles are redistributed when they are trapped in local optima. Experimental studies on 5 benchmark functions with 50-dimensions and 100-dimensions show that the MGRR-PSO can solve the problems that can't be solved by original PSO with better performance.
机译:粒子群优化(PSO)是一种快速且流行的算法,用于找到非线性和多维函数的最优值。但是,由于粒子会迅速移近最佳粒子,因此通常容易陷入局部最优状态。本文提出了一种新的算法,即带有随机重新分布的多组粒子群优化算法(MGRR-PSO),该算法试图解决标准PSO的弱点。 MGRR-PSO结合了两组具有相反加速度系数的PSO。此外,某些粒子陷入局部最优状态后会重新分布。对50维和100维的5个基准函数的实验研究表明,MGRR-PSO可以解决性能较高的原始PSO无法解决的问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号