Related Experiment Video
Updated: Apr 10, 2026

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
Published on: December 9, 2012
Design and Analysis of Schemes for Adapting Migration Intervals in Parallel Evolutionary Algorithms
Andrea Mambrini1, Dirk Sudholt1
1Department of Computer Science, University of Sheffield, Sheffield S1 4DP, UK.
Abstract:
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.
Related Concept Videos
Mutation, Gene Flow, and Genetic Drift
Migration
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Genetics of Speciation
Gene Flow
Gene Evolution - Fast or Slow?
In contrast, regions which code...

