Title
The sandpile mutation operator for genetic algorithms
Abstract
This paper describes an alternative mutation control scheme for Genetic Algorithms (GAs) inspired by the Self-Organized Criticality (SOC) theory. The strategy, which mimics a SOC system known as sandpile, is able to generate mutation rates that, unlike those given by other methods of adaptive parameter control, oscillate between very low values and cataclysmic mutations. In order to attain the desired behaviour, the sandpile is not just attached to a GA; it is also modified in an attempt to link its rates to the stage of the search, i.e., the fitness distribution of the population. Due to its characteristics, the sandpile mutation arises as a promising candidate for efficient and yet simple and context-independent approach to dynamic optimization. An experimental study confirms this assumption: a GA with sandpile mutation outperforms a recently proposed SOC-based GA for dynamic optimization. Furthermore, the proposed method does not increase traditional GAs' parameter set.
Year
DOI
Venue
2011
10.1007/978-3-642-25566-3_43
LION
Keywords
Field
DocType
soc-based ga,mutation rate,cataclysmic mutation,genetic algorithm,alternative mutation control scheme,sandpile mutation,soc system,adaptive parameter control,sandpile mutation operator,dynamic optimization,parameter set
Population,Mutation rate,Computer science,Algorithm,Criticality,Parameter control,Genetic algorithm,Mutation operator
Conference
Citations 
PageRank 
References 
4
0.44
9
Authors
5
Name
Order
Citations
PageRank
C. M. Fernandes160.83
J. L. Laredo2695.89
A. M. Mora39910.00
A. C. Rosa4152.37
J. J. Merelo536333.51