Aging, double helix and small world property in genetic algorithms
Neural and Evolutionary Computing
2007-05-23 v1 Data Structures and Algorithms
Data Analysis, Statistics and Probability
Abstract
Over a quarter of century after the invention of genetic algorithms and miriads of their modifications, as well as successful implementations, we are still lacking many essential details of thorough analysis of it's inner working. One of such fundamental questions is: how many generations do we need to solve the optimization problem? This paper tries to answer this question, albeit in a fuzzy way, making use of the double helix concept. As a byproduct we gain better understanding of the ways, in which the genetic algorithm may be fine tuned.
Keywords
Cite
@article{arxiv.cs/0205061,
title = {Aging, double helix and small world property in genetic algorithms},
author = {Marek W. Gutowski},
journal= {arXiv preprint arXiv:cs/0205061},
year = {2007}
}
Comments
Submitted to the workshop on evolutionary algorithms, Krakow (Cracow), Poland, Sept. 30, 2002, 6 pages, no figures, LaTeX 2.09 requires kaeog.sty (included)