Computer Science – Neural and Evolutionary Computing
Scientific paper
2011-09-07
Computer Science
Neural and Evolutionary Computing
A preliminary version with parts of the results appeared at PPSN 2010. The results therein were restricted to mutation rate 1/
Scientific paper
We present a new method for proving lower bounds on the expected running time of evolutionary algorithms. It is based on fitness-level partitions and an additional condition on transition probabilities between fitness levels. The method is versatile, intuitive, elegant, and very powerful. It yields exact or near-exact lower bounds for LO, OneMax, long k-paths, and all functions with a unique optimum. Most lower bounds are very general: they hold for all evolutionary algorithms that only use bit-flip mutation as variation operator---i.e. for all selection operators and population models. The lower bounds are stated with their dependence on the mutation rate. These results have very strong implications. They allow to determine the optimal mutation-based algorithm for LO and OneMax, i.e., which algorithm minimizes the expected number of fitness evaluations. This includes the choice of the optimal mutation rate.
No associations
LandOfFree
A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms 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 A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-306620