Foundations of Directed Mutation

Authors:
Stefan Berlik;Bernd Reusch
Affiliations:
Dortmund University, Dep. of Computer Science, 44221 Dortmund, Germany;Dortmund University, Dep. of Computer Science, 44221 Dortmund, Germany
Venue:
Proceedings of the 2006 conference on Integrated Intelligent Systems for Engineering Design
Year:
2006

Citing 5
Cited 0

Evolution and Optimum Seeking: The Sixth Generation

Evolution and Optimum Seeking: The Sixth Generation
Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES)

Evolutionary Computation
An overview of evolutionary algorithms for parameter optimization

Evolutionary Computation
Local convergence rates of simple evolutionary algorithms withCauchy mutations

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Directed mutation abandons the so-called random mutation hypothesis postulating mutations to occur at random, regardless of fitness consequences to the resulting offspring. By introducing skewness into the mutation operators, bigger portions of offspring can be created in the area of higher fitness with respect to the elder and thus promising directions of the evolution path can be favored. The aim of this work is to present the foundations of directed mutation as well as different operators in one single place. Their characteristics will be presented and their advantages and disadvantages are discussed. Furthermore, an application scenario will be presented that shows how evolutionary algorithm and directed mutation can be applied in engineering design. In addition, some experimental results solving a real world optimization task in this scenario are provided. Finally some first, preliminary results of a multivariate skew distribution as mutation operator in a covariance matrix adaptation algorithm will be presented.