DeepAI
Log In Sign Up

Derivation of Upper Bounds on Optimization Time of Population-Based Evolutionary Algorithm on a Function with Fitness Plateaus Using Elitism Levels Traverse Mechanism

04/11/2012
by   Aram Ter-Sarkisov, et al.
1

In this article a tool for the analysis of population-based EAs is used to derive asymptotic upper bounds on the optimization time of the algorithm solving Royal Roads problem, a test function with plateaus of fitness. In addition to this, limiting distribution of a certain subset of the population is approximated.

READ FULL TEXT
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 ...
04/08/2022

Improving LSHADE by means of a pre-screening mechanism

Evolutionary algorithms have proven to be highly effective in continuous...
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...
02/14/2022

Stochastic models of Jaya and semi-steady-state Jaya algorithms

We build stochastic models for analyzing Jaya and semi-steady-state Jaya...
04/13/2020

Exponential Upper Bounds for the Runtime of Randomized Search Heuristics

We argue that proven exponential upper bounds on runtimes, an establishe...