DocumentCode
2327672
Title
An explorative and exploitative mutation scheme
Author
Vafaee, Fatemeh ; Nelson, Peter C.
Author_Institution
Dept. of Comput. Sci., Univ. of Illinois at Chicago, Chicago, IL, USA
fYear
2010
fDate
18-23 July 2010
Firstpage
1
Lastpage
8
Abstract
Exploration and exploitation are the two cornerstones which characterize Evolutionary Algorithms (EAs) capabilities. Maintaining the reciprocal balance of the explorative and exploitative power is the key to the success of EA applications. Accordingly, in this work the canonical Genetic Algorithm is augmented by a new mutation scheme that is capable of exploring the unseen regions of the search space, and simultaneously exploiting the already-found promising elements. The proposed mutation operator specifies different mutation rates for different sites (loci) of the individuals. These site-specific rates are wisely derived based on the fitness and structure of the population individuals. In order to retain the balance of the required exploration and exploitation, the mutation rates are adapted during the evolution. To demonstrate the efficacy of the proposed algorithm, the method is evaluated using a set of benchmark problems and the outcome is compared with a series of well-known relevant algorithms. The results demonstrate that the newly suggested method significantly outperforms its rivals.
Keywords
genetic algorithms; canonical genetic algorithm; evolutionary algorithms; exploitative mutation scheme; explorative mutation scheme; mutation rates; site-specific rates; Aerospace electronics; Algorithm design and analysis; Benchmark testing; Evolutionary computation; Genetics; Partitioning algorithms; Probabilistic logic;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation (CEC), 2010 IEEE Congress on
Conference_Location
Barcelona
Print_ISBN
978-1-4244-6909-3
Type
conf
DOI
10.1109/CEC.2010.5586142
Filename
5586142
Link To Document