DeepAI AI Chat

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

08/20/2011

∙

by Aram Ter-Sarkisov, et al.

∙

Massey University

∙

∙

We present a number of bounds on convergence time for two elitist population-based Evolutionary Algorithms using a recombination operator k-Bit-Swap and a mainstream Randomized Local Search algorithm. We study the effect of distribution of elite species and population size.

Aram Ter-Sarkisov
13 publications
Stephen Marsland
13 publications

page 1

page 2

page 3

page 4

∙ 04/23/2015

On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling

Evolutionary algorithms have been frequently used for dynamic optimizati...

0 Frank Neumann, et al. ∙

∙ 08/20/2011

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

We present an analysis of the performance of an elitist Evolutionary alg...

1 Aram Ter-Sarkisov, et al. ∙

∙ 11/22/2015

Evolutionary algorithms

This manuscript contains an outline of lectures course "Evolutionary Alg...

0 Anton V. Eremeev, et al. ∙

∙ 04/26/2020

Analysis of Evolutionary Algorithms on Fitness Function with Time-linkage Property

In real-world applications, many optimization problems have the time-lin...

0 Weijie Zheng, et al. ∙

∙ 11/16/2006

Evolutionary Optimization in an Algorithmic Setting

Evolutionary processes proved very useful for solving optimization probl...

0 Mark Burgin, et al. ∙

∙ 09/09/2011

CIXL2: A Crossover Operator for Evolutionary Algorithms Based on Population Features

In this paper we propose a crossover operator for evolutionary algorithm...

0 N. García-Pedrajas, et al. ∙

∙ 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...

0 Bo Song, et al. ∙