John Nicholson
ABSTRACT
The selection event algorithm introduced an interesting method of creating offspring from parents in a multi-generational manner with a period of fitness neutrality followed by an intense selection event. This algorithm did not have a focus on maintaining diversity in the population, so it had all of the same pitfalls as other algorithms lacking such a focus. However, due to the novel multi-generational growth structure a natural family tree is created in the population, allowing for an equally natural diversity maintenance to be implemented which does not require any artificial diversity constraints to be placed on the fitness function. Instead, diversity is maintained (and encouraged) in the population through the growth dynamics of each family.
- K. Deb and D. E. Goldberg. An investigation of niche and species formation in genetic function optimization. In Proc. of the Third Int. Conf. on Genetic Algorithms, pages 42--50, San Mateo, CA, 1989. Morgan Kaufmann. Google Scholar
Digital Library
- K. A. DeJong. An Analysis of the Behavior of a Class of Genetic Adaptive Systems. PhD thesis, University of Michigan, Ann Arbor, MI, 1975. Dissertation Abstracts International 36(10), 5140B, University Microfilms Number 76-9381. Google ScholarDigital Library
- D. E. Goldberg and K. Deb. A comparative analysis of selection schemes used in genetic algorithms. In Foundations of Genetic Algorithms, pages 69--93, San Mateo, 1991. Morgan Kaufmann.Google Scholar
- J. Grefenstette. Parallel adaptive algorithms for function optimization. Technical Report CS-81-19, Vanderbilt University, Nashville, TN, 1981.Google Scholar
- R. W. Morrison and K. A. D. Jong. Measurement of population diversity. Lecture Notes in Computer Science, 2310, 2002. Google ScholarDigital Library
- J. Nicholson and M. White. Benefits of a periodic selection event in evolutionary strategy algorithms. In Proceedings of the 2006 IEEE Congress on Evolutionary Computation, pages 128--133, Vancouver, BC, Canada, 16--21 July 2006. IEEE Press.Google ScholarCross Ref
- O. M. Shir and T. Bäck. Niching in Evolution Strategies. In 2005 Genetic and Evolutionary Computation Conference (GECCO '2005), volume 1, pages 915--916, New York, USA, June 2005. ACM Press. Google ScholarDigital Library
- F. Streichert, G. Stein, H. Ulmer, and A. Zell. A Clustering Based Niching EA for Multimodal Search Spaces. In Artificial Evolution, 6th International Conference, Evolution Artificielle, EA 2003, Revised Selected Papers, pages 293--304, Marseille, France, Oct. 2004. Springer-Verlag. Lecture Notes in Computer Science Vol. 2936.Google Scholar
- S. Wright. The roles of mutation, inbreeding, crossbreeding and selection in evolution. In Proceedings of the Sixth International Congress of Genetics, volume 1, pages 356--366, 1932.Google Scholar
- D. Whitley, K. Mathias, S. Rana, and J. Dzubera. Building Better Test Functions. In Proceedings of the Sixth International Conference on Genetic Algorithms, pages 239--246, San Francisco, CA, 1995. Morgan Kaufmann. Google ScholarDigital Library
Index Terms
- Maintaining population diversity by maintaining family structures
Recommendations
Population diversity index: a new measure for population diversity
GECCO '11: Proceedings of the 13th annual conference companion on Genetic and evolutionary computationA number of diversity measures used in evolutionary computing suffer from 'mis-measuring' the diversity of populations. In this paper, we identify and demonstrate this problem using a carefully engineered test suite of six differently arranged ...
Maintaining Healthy Population Diversity Using Adaptive Crossover, Mutation, and Selection
This paper presents ACROMUSE, a novel genetic algorithm (GA) which adapts crossover, mutation, and selection parameters. ACROMUSEs objective is to create and maintain a diverse population of highly-fit (healthy) individuals, capable of adapting quickly ...
Measuring and Maintaining Population Diversity in Search-Based Unit Test Generation
Search-Based Software EngineeringAbstractGenetic algorithms (GAs) have been demonstrated to be effective at generating unit tests. However, GAs often suffer from a loss of population diversity, which causes the search to prematurely converge, thus negatively affecting the resulting code ...
Comments