By Topic

Maintaining genetic diversity in fine-grained parallel genetic algorithms by combining cellular automata, Cambrian explosions and massive extinctions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Giovanni Cantor ; Department of Computer Engineering, National University of Colombia, Artificial Life Research Group [A-Life] ; Jonatan Gómez

This paper describes an evolutionary algorithm (EA) which combines cellular automata, Cambrian explosions and massive extinctions ideas in order to maintain diversity and automatically determine the population's size of the EA. Individuals are organized in a two-dimensional grid (2-dimensional cellular automaton surface) and are considered active or inactive according to the cellular automaton state. The individual state is updated according to the cellular automaton state rules at each step (iteration) of the evolutionary process. Only active individuals are subject to evolution by applying one of the genetic operators and considering just their active neighbors (when multiple parents are required). Depending on the total number of active individuals, a Cambrian explosion or a massive extinction operation is applied, in a random fashion to control the size of the population. We presented a novel genetic diversity analysis using a hierarchical clustering to examine individuals genotype and identify natural population taxonomies. Our experiments show that the proposed scheme is able to maintain diversity and find near optimal solutions in an appropriated number of fitness evaluations.

Published in:

IEEE Congress on Evolutionary Computation

Date of Conference:

18-23 July 2010