By Topic

Self-adaptation of mutation distribution in evolutionary algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tinós, R. ; Univ. of Sao Paulo, Ribeirao ; Shengxiang Yang

This paper proposes a self-adaptation method to control not only the mutation strength parameter, but also the mutation distribution for evolutionary algorithms. For this purpose, the isotropic g-Gaussian distribution is employed in the mutation operator. The g-Gaussian distribution allows to control the shape of the distribution by setting a real parameter g and can reproduce either finite second moment distributions or infinite second moment distributions. In the proposed method, the real parameter q of the g-Gaussian distribution is encoded in the chromosome of an individual and is allowed to evolve. An evolutionary programming algorithm with the proposed idea is presented. Experiments were carried out to study the performance of the proposed algorithm.

Published in:

Evolutionary Computation, 2007. CEC 2007. IEEE Congress on

Date of Conference:

25-28 Sept. 2007