Use of the q-Gaussian mutation in evolutionary algorithms


Autoria(s): TINOS, Renato; YANG, Shengxiang
Contribuinte(s)

UNIVERSIDADE DE SÃO PAULO

Data(s)

19/10/2012

19/10/2012

2011

Resumo

This paper proposes the use of the q-Gaussian mutation with self-adaptation of the shape of the mutation distribution in evolutionary algorithms. The shape of the q-Gaussian mutation distribution is controlled by a real parameter q. In the proposed method, the real parameter q of the q-Gaussian mutation is encoded in the chromosome of individuals and hence is allowed to evolve during the evolutionary process. In order to test the new mutation operator, evolution strategy and evolutionary programming algorithms with self-adapted q-Gaussian mutation generated from anisotropic and isotropic distributions are presented. The theoretical analysis of the q-Gaussian mutation is also provided. In the experimental study, the q-Gaussian mutation is compared to Gaussian and Cauchy mutations in the optimization of a set of test functions. Experimental results show the efficiency of the proposed method of self-adapting the mutation distribution in evolutionary algorithms.

FAPESP

CNPq in Brazil

Engineering and Physical Sciences Research Council (EPSRC) of the UK[EP/E060722/1]

Engineering and Physical Sciences Research Council (EPSRC) of the UK[EP/E060722/2]

Identificador

SOFT COMPUTING, v.15, n.8, Special Issue, p.1523-1549, 2011

1432-7643

http://producao.usp.br/handle/BDPI/20931

10.1007/s00500-010-0686-8

http://dx.doi.org/10.1007/s00500-010-0686-8

Idioma(s)

eng

Publicador

SPRINGER

Relação

Soft Computing

Direitos

restrictedAccess

Copyright SPRINGER

Palavras-Chave #Evolutionary algorithms #q-Gaussian distribution #Self-adaptation #Evolutionary programming #Mutation distribution #CODED GENETIC ALGORITHMS #PROBABILITY #STRATEGIES #OPERATORS #SEARCH #Computer Science, Artificial Intelligence #Computer Science, Interdisciplinary Applications
Tipo

article

original article

publishedVersion