Nonstationary function optimization using genetic algorithm with dominance and diploidy
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
Swarm intelligence
Evolutionary Optimization in Dynamic Environments
Evolutionary Optimization in Dynamic Environments
Case-Based Initialization of Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
An Empirical Study on GAs "Without Parameters"
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Applying Self-Organised Criticality to Evolutionary Algorithms
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Tracking Extrema in Dynamic Environments
EP '97 Proceedings of the 6th International Conference on Evolutionary Programming VI
Optimization with extremal dynamics
Complexity - Complex Adaptive systems: Part I
Memory-based immigrants for genetic algorithms in dynamic environments
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Completely Derandomized Self-Adaptation in Evolution Strategies
Evolutionary Computation
An Adaptive Multimeme Algorithm for Designing HIV Multidrug Therapies
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Extending particle swarm optimisers with self-organized criticality
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
A self-organizing random immigrants genetic algorithm for dynamic optimization problems
Genetic Programming and Evolvable Machines
Scalability problems of simple genetic algorithms
Evolutionary Computation
A self-organized criticality mutation operator for dynamic optimization problems
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Dual-population genetic algorithm for nonstationary optimization
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Tracking Extrema in Dynamic Fitness Functions with Dissortative Mating Genetic Algorithms
HIS '08 Proceedings of the 2008 8th International Conference on Hybrid Intelligent Systems
Genetic algorithms with memory-and elitism-based immigrants in dynamic environments
Evolutionary Computation
Genetic Algorithms with Elitism-Based Immigrants for Changing Optimization Problems
Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
A dual-population genetic algorithm for adaptive diversity control
IEEE Transactions on Evolutionary Computation
A study on the mutation rates of a genetic algorithm interacting with a sandpile
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part I
Information Sciences: an International Journal
The sandpile mutation operator for genetic algorithms
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Parameter control in evolutionary algorithms
IEEE Transactions on Evolutionary Computation
Self-adaptive mutations may lead to premature convergence
IEEE Transactions on Evolutionary Computation
A Fast Adaptive Memetic Algorithm for Online and Offline Control Design of PMSM Drives
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
Hi-index | 0.00 |
This paper reports the investigation on the sandpile mutation, an unconventional mutation control scheme for binary Genetic Algorithms (GA) inspired by the Self-Organized Criticality (SOC) theory. The operator, which is based on a SOC system known as sandpile, is able to generate mutation rates that, unlike those given by other methods of parameter control, oscillate between low values and very intense mutations events. The distribution of the mutation rates suggests that the algorithm can be an efficient and yet simple and context-independent approach for the optimization of non-stationary fitness functions. This paper studies the mutation scheme of the algorithm and proposes a new strategy that optimizes is performance. The results also demonstrate the advantages of using the fitness distribution of the population for controlling the mutation. An extensive experimental setup compares the sandpile mutation GA (GGASM) with two state-of-the-art evolutionary approaches to non-stationary optimization and with the Hypermutation GA, a classical approach to dynamic problems. The results demonstrate that GGASM is able to improve the other algorithms in several dynamic environments. Furthermore, the proposed method does not increase the parameter set of traditional GAs. A study of the distribution of the mutation rates shows that the distribution depends on the type of problem and dynamics, meaning that the algorithm is able to self-regulate the mutation. The effects of the operator on the diversity of the population during the run are also investigated. Finally, a study on the effects of the topology of the sandpile mutation on its performance demonstrates that an alternative topology has minor effects on the performance.