Derivation of Upper Bounds on Optimization Time of Population-Based Evolutionary Algorithm on a Function with Fitness Plateaus Using Elitism Levels Traverse Mechanism
Neural and Evolutionary Computing
2013-09-03 v6 Artificial Intelligence
Abstract
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.
Keywords
Cite
@article{arxiv.1204.2321,
title = {Derivation of Upper Bounds on Optimization Time of Population-Based Evolutionary Algorithm on a Function with Fitness Plateaus Using Elitism Levels Traverse Mechanism},
author = {Aram Ter-Sarkisov and Stephen Marsland},
journal= {arXiv preprint arXiv:1204.2321},
year = {2013}
}
Comments
This paper will be replaced by a new version with a different title