Designing Competent Mutation Operators via Probabilistic Model Building of Neighborhoods

Details Designing Competent Mutation Operators via Probabilistic Model Building of Neighborhoods Designing Competent Mutation Operators via Probabilistic Model Building of Neighborhoods

2004-05-18

arxiv.org/abs/cs/0405064v1

Computer Science

Neural and Evolutionary Computing

Genetic and Evolutionary Computation Conference (GECCO-2004)

Scientific paper

This paper presents a competent selectomutative genetic algorithm (GA), that adapts linkage and solves hard problems quickly, reliably, and accurately. A probabilistic model building process is used to automatically identify key building blocks (BBs) of the search problem. The mutation operator uses the probabilistic model of linkage groups to find the best among competing building blocks. The competent selectomutative GA successfully solves additively separable problems of bounded difficulty, requiring only subquadratic number of function evaluations. The results show that for additively separable problems the probabilistic model building BB-wise mutation scales as O(2^km^{1.5}), and requires O(k^{0.5}logm) less function evaluations than its selectorecombinative counterpart, confirming theoretical results reported elsewhere (Sastry & Goldberg, 2004).

Affiliated with

Also associated with

No associations

Rating

Designing Competent Mutation Operators via Probabilistic Model Building of Neighborhoods 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 Designing Competent Mutation Operators via Probabilistic Model Building of Neighborhoods, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Designing Competent Mutation Operators via Probabilistic Model Building of Neighborhoods will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-366043