Convergence of a Recombination-Based Elitist Evolutionary Algorithm on the Royal Roads Test Function
Aram Ter-Sarkisov, Stephen Marsland

TL;DR
This paper analyzes the convergence behavior of an elitist evolutionary algorithm with a 1-Bit-Swap recombination operator on the Royal Roads test function, providing detailed convergence rates and insights into population effects.
Contribution
It introduces a comprehensive analysis of the algorithm's convergence, including complete, approximate, and asymptotic rates, highlighting the impact of population size and recombination pool.
Findings
Convergence rates are derived for the algorithm.
Population size influences convergence speed.
Recombination pool size affects performance.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMetaheuristic Optimization Algorithms Research · Advanced Multi-Objective Optimization Algorithms · Evolutionary Algorithms and Applications
