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

2011/08/19 by Aram Ter-Sarkisov, Ter-Sarkisov, Aram, Stephen Marsland +1
Computer Science · #Advanced Multi-Objective Optimization Algorithms #Evolutionary Algorithms and Applications #Metaheuristic Optimization Algorithms Research #cs.NE

paper · pdf · doi:10.48550/arxiv.1108.4080

accepted for ECTA 2011

arxiv created 2011/08/20 · arxiv updated 2011/08/23

Abstract

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.

Related

• Convergence of a Recombination-Based Elitist Evolutionary Algorithm on the Royal Roads Test Function
• Derivation of Upper Bounds on Optimization Time of Population-Based Evolutionary Algorithm on a Function with Fitness Plateaus Using Elitism Levels Traverse Mechanism
• A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms
• A Lower Bound Analysis of Population-based Evolutionary Algorithms for Pseudo-Boolean Functions
• Runtime Analysis of Fitness-Proportionate Selection on Linear Functions