Ring Migration Topology Helps Bypassing Local Optima

06/04/2018
by   Clemens Frahnow, et al.
0

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 ≥ 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 Θ̃(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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/27/2022

Run Time Analysis for Random Local Search on Generalized Majority Functions

Run time analysis of evolutionary algorithms recently makes significant ...
research
06/15/2012

General Upper Bounds on the Running Time of Parallel Evolutionary Algorithms

We present a new method for analyzing the running time of parallel evolu...
research
07/21/2023

Run Time Bounds for Integer-Valued OneMax Functions

While most theoretical run time analyses of discrete randomized search h...
research
04/07/2021

Lower Bounds from Fitness Levels Made Easy

One of the first and easy to use techniques for proving run time bounds ...
research
03/30/2014

Unbiased Black-Box Complexities of Jump Functions

We analyze the unbiased black-box complexity of jump functions with smal...
research
09/08/2011

Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization

Evolutionary algorithms are popular heuristics for solving various combi...
research
01/05/2017

Subpopulation Diversity Based Selecting Migration Moment in Distributed Evolutionary Algorithms

In distributed evolutionary algorithms, migration interval is used to de...

Please sign up or login with your details

Forgot password? Click here to reset