Elitism Levels Traverse Mechanism For The Derivation of Upper Bounds on Unimodal Functions

Details Elitism Levels Traverse Mechanism For The Derivation of Upper Bounds on Unimodal Functions Elitism Levels Traverse Mechanism For The Derivation of Upper Bounds on Unimodal Functions

2012-02-23

arxiv.org/abs/1202.5284v3

Computer Science

Neural and Evolutionary Computing

accepted to Congress on Evolutionary Computation (WCCI/CEC) 2012

Scientific paper

In this article we present an Elitism Levels Traverse Mechanism that we designed to find bounds on population-based Evolutionary algorithms solving unimodal functions. We prove its efficiency theoretically and test it on OneMax function deriving bounds c{\mu}n log n - O({\mu} n). This analysis can be generalized to any similar algorithm using variants of tournament selection and genetic operators that flip or swap only 1 bit in each string.

Affiliated with

Also associated with

No associations

Rating

Elitism Levels Traverse Mechanism For The Derivation of Upper Bounds on Unimodal Functions 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 Elitism Levels Traverse Mechanism For The Derivation of Upper Bounds on Unimodal Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Elitism Levels Traverse Mechanism For The Derivation of Upper Bounds on Unimodal Functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-77469