How Crossover Speeds Up Building-Block Assembly in Genetic Algorithms

03/26/2014
by   Dirk Sudholt, et al.
0

We re-investigate a fundamental question: how effective is crossover in Genetic Algorithms in combining building blocks of good solutions? Although this has been discussed controversially for decades, we are still lacking a rigorous and intuitive answer. We provide such answers for royal road functions and OneMax, where every bit is a building block. For the latter we show that using crossover makes every (μ+λ) Genetic Algorithm at least twice as fast as the fastest evolutionary algorithm using only standard bit mutation, up to small-order terms and for moderate μ and λ. Crossover is beneficial because it effectively turns fitness-neutral mutations into improvements by combining the right building blocks at a later stage. Compared to mutation-based evolutionary algorithms, this makes multi-bit mutations more useful. Introducing crossover changes the optimal mutation rate on OneMax from 1/n to (1+√(5))/2 · 1/n ≈ 1.618/n. This holds both for uniform crossover and k-point crossover. Experiments and statistical tests confirm that our findings apply to a broad class of building-block functions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/18/2020

The (1+(λ,λ)) Genetic Algorithm for Permutations

The (1+(λ,λ)) genetic algorithm is a bright example of an evolutionary a...
research
03/09/2017

Fast Genetic Algorithms

For genetic algorithms using a bit-string representation of length n, th...
research
08/02/2018

Systematic Testing of Genetic Algorithms: A Metamorphic Testing based Approach

Genetic Algorithms are a popular set of optimization algorithms often us...
research
04/06/2001

Potholes on the Royal Road

It is still unclear how an evolutionary algorithm (EA) searches a fitnes...
research
12/11/2002

The structure of evolutionary exploration: On crossover, buildings blocks and Estimation-Of-Distribution Algorithms

The notion of building blocks can be related to the structure of the off...
research
05/18/2004

Designing Competent Mutation Operators via Probabilistic Model Building of Neighborhoods

This paper presents a competent selectomutative genetic algorithm (GA), ...
research
05/18/2004

Efficiency Enhancement of Probabilistic Model Building Genetic Algorithms

This paper presents two different efficiency-enhancement techniques for ...

Please sign up or login with your details

Forgot password? Click here to reset