【24h】

Re-diversification Based Particle Swarm Algorithm with Cauchy Mutation

机译:基于重分散的柯西变异粒子群算法

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

摘要

Particle Swarm Optimization (PSO) has shown its fast search speed in many complicated optimization and search problems. However, PSO could often easily fall into local optima. This paper presents a hybrid PSO algorithm called RPSO by applying a new re-diversification mechanism and a dynamic Cauchy mutation operator to accelerate the convergence of PSO and avoid premature convergence. Experimental results on many well-known benchmark optimization problems have shown that the RPSO could successfully deal with those difficult multimodal functions while maintaining fast search speed on those simple unimodal functions in the function optimization.
机译:粒子群优化(PSO)在许多复杂的优化和搜索问题中显示了其快速的搜索速度。但是,PSO通常很容易陷入局部最优状态。通过应用新的再分散机制和动态柯西突变算子,提出了一种称为RPSO的混合PSO算法,以加速PSO的收敛并避免过早的收敛。对许多众所周知的基准优化问题的实验结果表明,RPSO可以成功处理那些困难的多峰函数,同时在函数优化中保持对那些简单单峰函数的快速搜索速度。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号