Please use this identifier to cite or link to this item:
Title: Adaptive group mutation for tackling deception in genetic search
Authors: Yang, S
Keywords: Genetic algorithm;Adaptive group mutation;Bit mutation;Deceptive functions;Building blocks
Issue Date: 2004
Publisher: World Scientific and Engineering Academy and Society
Citation: WSEAS Transactions on Systems, 3(1): 107 - 112, Jan 2004
Abstract: In order to study the efficacy of genetic algorithms (GAs), a number of fitness landscapes have been designed and used as test functions. Among these functions a family of deceptive functions have been developed as difficult test functions for comparing different implementations of GAs. In this paper an adaptive group mutation (AGM), which can be combined with traditional bit mutation in GAs, is proposed to tackle the deception problem in genetic searching. Within the AGM, those genes that have converged to certain threshold degree are adaptively grouped together and subject to mutation together with a given probability. To test the performance of the AGM, experiments were carried out to compare GAs that combine the AGM and GAs that use only traditional bit mutation with a number of suggested “standard” fixed mutation rates over a set of deceptive functions as well as non-deceptive functions. The results demonstrate that GAs with the AGM perform better than GAs with only traditional bit mutation over deceptive functions and as well as GAs with only traditional bit mutation over non-deceptive functions. The results show that the AGM is a good choice for GAs since most problems may involve some degree of deception and deceptive functions are difficult for GAs.
Description: Copyright @ 2004 WSEAS
ISSN: 1109-2777
Appears in Collections:Publications
Computer Science
Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf71.31 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.