Computer Science – Neural and Evolutionary Computing
Scientific paper
2012-04-11
Computer Science
Neural and Evolutionary Computing
Scientific paper
In this article we derive upper bounds on optimization time of the recombination algorithm solving a unimodal problem with plateaus of fitness using a tool we called Elitism Levels Traverse Mechanism. Our findings are asymptotically tight for different parameters of the algorithm and the problem, and we are able to recover some well-known bounds for test problems such as OneMax and Royal Roads. We also present find- ings on the limiting distribution of super-elite species in the population, something no-one seems to have done before in the EA community.
Marsland Stephen
Ter-Sarkisov Aram
No associations
LandOfFree
Derivation of Upper Bounds on Optimization Time of Population-Based Evolutionary Algorithm on a Function with Fitness Plateaus Using Elitism Levels Traverse Mechanism does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Derivation of Upper Bounds on Optimization Time of Population-Based Evolutionary Algorithm on a Function with Fitness Plateaus Using Elitism Levels Traverse Mechanism, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Derivation of Upper Bounds on Optimization Time of Population-Based Evolutionary Algorithm on a Function with Fitness Plateaus Using Elitism Levels Traverse Mechanism will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-716801