Directional distributions and their application to evolutionary algorithms

Authors:
Przemysław Prętki;Andrzej Obuchowicz
Affiliations:
Institute of Control and Computation Engineering, University of Zielona Góra, Zielona Góra, Poland;Institute of Control and Computation Engineering, University of Zielona Góra, Zielona Góra, Poland
Venue:
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Year:
2006

Citing 2
Cited 0

Evolutionary algorithms and gradient search: similarities anddifferences

IEEE Transactions on Evolutionary Computation
Evolutionary programming using mutations based on the Levy probability distribution

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a concept of directional mutations for phenotypic evolutionary algorithms is presented. The proposed approach allows, in a very convenient way, to adapt the probability measure underlying the mutation operator during evolutionary process. Moreover, the paper provides some guidance, along with suitable theorems, which makes it possible to get a deeper understanding of the ineffectiveness of isotropic mutations for large-scale problems.