arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1806.01128cs.NE
收藏

环形迁移拓扑有助于优化本地

Ring Migration Topology Helps Bypassing Local Optima

Clemens Frahnow, Timo Kötzing

摘要:

并行运行几个进化算法,偶尔交换好的解决方案被称为岛屿模型。这个想法是不同岛屿的独立性导致多样性,从而可能更好地探索搜索空间。到目前为止,许多理论分析已经发现了一个完整的(或足够快地扩展)拓扑结构作为底层迁移图最有效的优化,即使个人的快速传播导致多样性的损失。我们提出了一个简单的适应度函数FORK与两个局部最优参数化的$r \geq 2$和复合适应度函数的计划。我们发现,虽然(1+1)EA陷入了一个坏的局部最优,并招致运行时间的$Θ(n^{2r})$健身评估的FORK,岛屿模型具有完整的拓扑结构,可以实现运行时间的$Θ(n^{1.5r})$,利用罕见的迁移,以更有效地探索搜索空间。最后,环形拓扑结构,利用罕见的迁移和大直径,可以实现$\tildeΘ(n^r)$的运行时间,黑盒复杂度的FORK。这表明,环形拓扑结构可以优于完整拓扑结构,以保持多样性。

英文摘要:

Running several evolutionary algorithms in parallel and occasionally exchanging good solutions is referred to as island models. The idea is that the independence of the different islands leads to diversity, thus possibly exploring the search space better. Many theoretical analyses so far have found a complete (or sufficiently quickly expanding) topology as underlying migration graph most efficient for optimization, even though a quick dissemination of individuals leads to a loss of diversity. We suggest a simple fitness function FORK with two local optima parametrized by $r \geq 2$ and a scheme for composite fitness functions. We show that, while the (1+1) EA gets stuck in a bad local optimum and incurs a run time of $Θ(n^{2r})$ fitness evaluations on FORK, island models with a complete topology can achieve a run time of $Θ(n^{1.5r})$ by making use of rare migrations in order to explore the search space more effectively. Finally, the ring topology, making use of rare migrations and a large diameter, can achieve a run time of $\tildeΘ(n^r)$, the black box complexity of FORK. This shows that the ring topology can be preferable over the complete topology in order to maintain diversity.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑