Jaya优化算法的高效多核实现
An Efficient Multi-core Implementation of the Jaya Optimisation Algorithm
摘要:
在这项工作中,我们提出了一个混合并行Jaya优化算法的多核环境,其目的是解决大规模的全球优化问题。该算法被称为HHCP Jaya,并结合了超人口的方法与层次合作搜索机制。HHCPJaya算法将种群划分为许多小的子种群,每个子种群专注于原始种群维度的不同块。在超种群方法中,我们通过为每个核心分配一个以上的子种群来增加小的子种群,每个子种群独立进化,以增强种群的探索性和剥削性。我们结合这种超人口的方法与两级分层合作搜索计划,从所有子群体找到全局解决方案。此外,我们将一个额外的更新阶段的基础上的各个子群体的整体解决方案,进一步提高收敛速度和解决方案的质量的目的。在不同的设置应用所提出的并行算法的几个实验证明,它表现出足够的承诺,在解决方案的质量和收敛速度。此外,一个相对较小的计算工作需要解决复杂和大规模的优化问题。
英文摘要:
In this work, we propose a hybrid parallel Jaya optimisation algorithm for a multi-core environment with the aim of solving large-scale global optimisation problems. The proposed algorithm is called HHCPJaya, and combines the hyper-population approach with the hierarchical cooperation search mechanism. The HHCPJaya algorithm divides the population into many small subpopulations, each of which focuses on a distinct block of the original population dimensions. In the hyper-population approach, we increase the small subpopulations by assigning more than one subpopulation to each core, and each subpopulation evolves independently to enhance the explorative and exploitative nature of the population. We combine this hyper-population approach with the two-level hierarchical cooperative search scheme to find global solutions from all subpopulations. Furthermore, we incorporate an additional updating phase on the respective subpopulations based on global solutions, with the aim of further improving the convergence rate and the quality of solutions. Several experiments applying the proposed parallel algorithm in different settings prove that it demonstrates sufficient promise in terms of the quality of solutions and the convergence rate. Furthermore, a relatively small computational effort is required to solve complex and large-scale optimisation problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。