Designing Competent Mutation Operators via Probabilistic Model Building of Neighborhoods

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Neural and Evolutionary Computing, G.1.6; G.3; I.2.6; I.2.8

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/32142

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0405064
 http://arxiv.org/abs/cs/0405064

Collections

arXiv