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

2011/08/19 by Aram Ter-Sarkisov, Ter-Sarkisov, Aram, Stephen Marsland +1
Computer Science · #Advanced Multi-Objective Optimization Algorithms #Evolutionary Algorithms and Applications #FOS: Computer and information sciences #Metaheuristic Optimization Algorithms Research #Neural and Evolutionary Computing (cs.NE) #cs.NE

paper · pdf · doi:10.48550/arxiv.1108.4083

accepted for AI 2011: 24th Australasian Joint Conference on Artificial Intelligence

openalex publication_date 2011/08/19 · arxiv created 2011/08/24 · arxiv updated 2011/08/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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.

Related

• Convergence Properties of Two (μ + λ) Evolutionary Algorithms On OneMax and Royal Roads Test Functions
• K-Bit-Swap: A New Operator For Real-Coded Evolutionary Algorithms
• Derivation of Upper Bounds on Optimization Time of Population-Based Evolutionary Algorithm on a Function with Fitness Plateaus Using Elitism Levels Traverse Mechanism
• Standard Steady State Genetic Algorithms Can Hillclimb Faster than\n Mutation-only Evolutionary Algorithms
• Probabilistic analysis of the (1+1)-evolutionary algorithm