Designing Competent Mutation Operators via Probabilistic Model Building of Neighborhoods

05/18/2004
by   Kumara Sastry, et al.
0

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.5logm) less function evaluations than its selectorecombinative counterpart, confirming theoretical results reported elsewhere (Sastry & Goldberg, 2004).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/18/2004

Efficiency Enhancement of Probabilistic Model Building Genetic Algorithms

This paper presents two different efficiency-enhancement techniques for ...
research
05/18/2004

Let's Get Ready to Rumble: Crossover Versus Mutation Head to Head

This paper analyzes the relative advantages between crossover and mutati...
research
12/11/2002

The structure of evolutionary exploration: On crossover, buildings blocks and Estimation-Of-Distribution Algorithms

The notion of building blocks can be related to the structure of the off...
research
05/12/2017

A natural approach to studying schema processing

The Building Block Hypothesis (BBH) states that adaptive systems combine...
research
03/26/2014

How Crossover Speeds Up Building-Block Assembly in Genetic Algorithms

We re-investigate a fundamental question: how effective is crossover in ...
research
12/11/2018

Optimal Structure Synthesis for Environment Augmenting Robots

Building structures can allow a robot to surmount large obstacles, expan...
research
04/18/2019

Semantic variation operators for multidimensional genetic programming

Multidimensional genetic programming represents candidate solutions as s...

Please sign up or login with your details

Forgot password? Click here to reset