Title :
Genetic drift in sharing methods
Author :
Mahfoud, Samir W.
Author_Institution :
Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA
Abstract :
Adding a sharing method to a genetic algorithm promotes the formation and maintenance of stable subpopulations. The paper explores the limits of sharing by deriving closed-form expressions for the expected time to disappearance of a subpopulation. The time to disappearance is shown to be an exponential function of population size, with relative subpopulation fitnesses determining the base of the exponential. However, disappearance time decreases rapidly as the number of subpopulations increases. Both theoretical and experimental illustrations are given of genetic drift in sharing
Keywords :
genetic algorithms; search problems; stochastic processes; GA; closed-form expressions; disappearance time; expected time to disappearance; exponential function; genetic algorithms; genetic drift; population size; relative subpopulation fitnesses; sharing methods; stable subpopulations; subpopulation; Closed-form solution; Combinatorial mathematics; Computer science; Genetic algorithms; Genetic mutations; Shape; Stability; Stochastic processes; Time sharing computer systems;
Conference_Titel :
Evolutionary Computation, 1994. IEEE World Congress on Computational Intelligence., Proceedings of the First IEEE Conference on
Conference_Location :
Orlando, FL
Print_ISBN :
0-7803-1899-4
DOI :
10.1109/ICEC.1994.350040
