Convergence of a Recombination-Based Elitist Evolutionary Algorithm on the Royal Roads Test Function

08/20/2011
by   Aram Ter-Sarkisov, et al.
1

We present an analysis of the performance of an elitist Evolutionary algorithm using a recombination operator known as 1-Bit-Swap on the Royal Roads test function based on a population. We derive complete, approximate and asymptotic convergence rates for the algorithm. The complete model shows the benefit of the size of the population and re- combination pool.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/20/2011

Convergence Properties of Two (μ + λ) Evolutionary Algorithms On OneMax and Royal Roads Test Functions

We present a number of bounds on convergence time for two elitist popula...
research
08/31/2022

Accelerating differential evolution algorithm with Gaussian sampling based on estimating the convergence points

In this paper, we propose a simple strategy for estimating the convergen...
research
02/23/2012

Elitism Levels Traverse Mechanism For The Derivation of Upper Bounds on Unimodal Functions

In this article we present an Elitism Levels Traverse Mechanism that we ...
research
09/26/2015

A Revisit of Infinite Population Models for Evolutionary Algorithms on Continuous Optimization Problems

Infinite population models are important tools for studying population d...
research
04/09/2014

Noisy Optimization: Convergence with a Fixed Number of Resamplings

It is known that evolution strategies in continuous domains might not co...
research
03/16/2022

GPU-Accelerated Parallel Gene-pool Optimal Mixing in a Gray-Box Optimization Setting

In a Gray-Box Optimization (GBO) setting that allows for partial evaluat...

Please sign up or login with your details

Forgot password? Click here to reset