ABSTRACT
Automatically configuring and dynamically controlling an Evolutionary Algorithm's (EA's) parameters is a complex task, yet doing so allows EAs to become more powerful and require less problem specific tuning to become effective. Supportive Coevolution is a new form of Evolutionary Algorithm (EA) that uses multiple populations to overcome the limitations of other automatic configuration techniques like self-adaptation, giving it the potential to concurrently evolve all of the parameters and operators in an EA. As a proof of concept experimentation comparing self-adaptation of n uncorrelated mutation step sizes with Supportive Coevolution for mutation step sizes was performed on the Rastrigin and Shifted Rastrigin benchmark functions. Statistical analysis showed Supportive Coevolution outperforming self-adaptation on all but one of the problem instances tested. Furthermore, analysis of instantaneous mutation success rate showed that this new technique is better able to adapt to the changes in the population fitness. Further study using multiple evolving parameters is needed to fully test Supportive Coevolution, but the results presented here show a promising outlook.
- W. de Landgraaf, A. Eiben, and V. Nannen. Parameter Calibration Using Meta-Algorithms. Evolutionary Computation, 2007. CEC 2007. IEEE Congress on, pages 71--78, 2007.Google ScholarCross Ref
- B. W. Goldman and D. R. Tauritz. Meta-Evolved Empirical Evidence of the Effectiveness of Dynamic Parameters. Genetic and Evol. Comp. Conf.(GECCO-2011), pages 155--156, 2011. Google ScholarDigital Library
- B. W. Goldman and D. R. Tauritz. Self-Configuring Crossover. Genetic and Evol. Comp. Conf.(GECCO-2011), pages 575--582, 2011. Google ScholarDigital Library
- J. Gomez. Self Adaptation of Operator Rates in Evolutionary Algorithms. In Proceedings of GECCO 2010, pages 162--173. Springer Berlin, Heidelberg, 2004.Google ScholarCross Ref
- L. M. Guntly and D. R. Tauritz. Learning Individual Mating Preferences. Genetic and Evol. Comp. Conf.(GECCO-2011), pages 1069--1076, 2011. Google ScholarDigital Library
- N. Hansen and A. Ostermeier. Completely Derandomized Self-Adaptation in Evolution Strategies. 9(2):159--195, 2001. Google ScholarDigital Library
- W. D. Hillis. Co-evolving Parasites Improve Simulated Evolution as an Optimization Procedure. Physica D 42, pages 228--234, 1990.Google ScholarDigital Library
- P. Husbands and F. Mill. Simulated Co-evolution as the Mechanism for Emergent Planning and Scheduling. Fourth International Conference on Genetic Algorithms, pages 264--270, 1991.Google Scholar
- J. Y. Kim, Y. Kim, and Y. K. Kim. An Endosymbiotic Evolutionary Algorithm for Optimization. Applied Intelligence, 15(2):117--130, 2001. Google ScholarDigital Library
- H. Mühlenbein, D. Schomisch, and J. Born. The Parallel Genetic Algorithm as Function Optimizer. Parallel Computing, pages 619--632, 1991.Google Scholar
- G. Papa. Parameter-less Evolutionary Search. pages 1133--1134. Atlanta, GA, USA, 2008. Google ScholarDigital Library
- P. Posik. Real parameter optimization using mutation step co-evolution. In IEEE Congress on Evolutionary Computation, pages 872--880, 2005.Google Scholar
- I. Rechenberg. Evolutionstrategie: Optimierung Technisher Systeme nach Prinzipien des Biolischen Evolution. Fromman-Hozlboog Verlag, Stuttgart, 1973.Google Scholar
- E. Smorodkina and D. Tauritz. Toward Automating EA configuration: the Parent Selection Stage. In IEEE Congress on Evolutionary Computation, pages 63--70, 2007.Google Scholar
- F. Vafaee, W. Xiao, P. Nelson, and C. Zhou. Adaptively Evolving Probabilities of Genetic Operators. Machine Learning and Applications, pages 292--299, 2008. Google ScholarDigital Library
Index Terms
- Supportive coevolution
Recommendations
Using supportive coevolution to evolve self-configuring crossover
GECCO '13 Companion: Proceedings of the 15th annual conference companion on Genetic and evolutionary computationCreating an Evolutionary Algorithm (EA) which is capable of automatically configuring itself and dynamically controlling its parameters is a challenging problem. However, solving this problem can reduce the amount of manual configuration required to ...
Influence of crossover on the behavior of Differential Evolution Algorithms
In Differential Evolution Algorithms the crossover operator allows the construction of a new trial element starting from the current and mutant elements. Thus it controls which and how many components are mutated in each element of the current ...
A novel multi-population coevolution immune optimization algorithm
A novel multi-population coevolution immune optimization algorithm (MCIA) is proposed to solve numerical and engineering optimization problem in real world. MCIA is inspired by the mechanism that how neuroendocrine system affects T cells and B cells in ...
Comments