Design and Analysis of Schemes for Adapting Migration Intervals in Parallel Evolutionary Algorithms.
Design and Analysis of Schemes for Adapting Migration Intervals in Parallel Evolutionary Algorithms.
复制标题
并行进化算法中适应迁移间隔的方案的设计和分析。
DOI：
10.1162/evco_a_00153
复制
发表时间：
2015
影响因子：
6.8
通讯作者：
Mambrini A
中科院分区：
文献类型：
--
作者：
Mambrini A
迁移间隔是控制岛屿模型动力学行为的基本参数之一。然而，人们对这个参数如何影响性能以及如何在给定问题的情况下对其进行最佳设置却知之甚少。我们提出了根据适应度是否得到改善来调整迁移间隔的方案，只要没有发现改善，就增加迁移间隔以最大限度地减少通信。一旦最佳适应度提高，迁移间隔就会缩短，以更快地传播新的最佳解决方案。我们提供了一种方法，用于获得上界的预期运行时间和通信的努力，定义为预期数量的移民发送。这种方法的常见的示例功能的示例应用程序表明，我们的自适应计划能够竞争，甚至优于，最佳的固定选择的迁移间隔，在运行时间和通信的努力。
The migration interval is one of the fundamental parameters governing the dynamic behaviour of island models. Yet, there is little understanding on how this parameter affects performance, and how to optimally set it given a problem in hand. We propose schemes for adapting the migration interval according to whether fitness improvements have been found. As long as no improvement is found, the migration interval is increased to minimise communication. Once the best fitness has improved, the migration interval is decreased to spread new best solutions more quickly. We provide a method for obtaining upper bounds on the expected running time and the communication effort, defined as the expected number of migrants sent. Example applications of this method to common example functions show that our adaptive schemes are able to compete with, or even outperform, the optimal fixed choice of the migration interval, with regard to running time and communication effort.