首页> 外文期刊>Journal of intelligent & fuzzy systems: Applications in Engineering and Technology >A parallel improved IWO algorithm on GPU for solving large scale global optimization problems
【24h】

A parallel improved IWO algorithm on GPU for solving large scale global optimization problems

机译:GPU上并行改进的IWO算法,用于解决大规模全局优化问题

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

摘要

Considering the problems of slow convergence and easily getting into local optimum of invasive weed optimization (IWO) algorithm in finding the optimal solution to large scale global optimization (LSGO) problems, we have proposed an improved IWO (IIWO) algorithm on the basis of the basic IWO algorithm. Concrete adjustments include setting the newborn weed seeds per plant to a fixed number of parameters, changing the initial step and final step to adaptive step, and re-initializing the solution which exceeds the limit value. Meanwhile, through applying the IIWO algorithm to the GPU platform, a parallel IIWO (PIIWO) based on GPU is obtained. The algorithm not only improves the convergence rate, but also strikes a balance between the global and local search capabilities. The simulation results of solving on the LSGO problems (CEC' 2010 high-dimensional functions), have shown that, compared with other algorithms, our designed IIWO can yield better performance, faster convergence speed and higher accuracy; whilst the PIIWO has fewer iterations, higher computing accuracy and significant speedup than the serial algorithm IIWO.
机译:考虑到入侵性杂草优化(IWO)算法收敛速度慢,容易陷入局部最优的问题,在寻找大规模全局优化(LSGO)问题的最优解时,我们在此基础上提出了一种改进的IWO(IIWO)算法。基本的IWO算法。具体的调整包括将每株植物的新生杂草种子设置为固定数量的参数,将初始步骤和最终步骤更改为适应性步骤,并重新初始化超出极限值的溶液。同时,通过将IIWO算法应用于GPU平台,获得了基于GPU的并行IIWO(PIIWO)。该算法不仅提高了收敛速度,而且在全局和局部搜索能力之间取得了平衡。对LSGO问题(CEC'2010高维函数)求解的仿真结果表明,与其他算法相比,我们设计的IIWO具有更好的性能,更快的收敛速度和更高的精度;与串行算法IIWO相比,PIIWO具有更少的迭代,更高的计算精度和显着的加速。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号