Amazing geometry of genetic space or are genetic algorithms convergent?
Neural and Evolutionary Computing
2007-05-23 v1 Discrete Mathematics
Software Engineering
Abstract
There is no proof yet of convergence of Genetic Algorithms. We do not supply it too. Instead, we present some thoughts and arguments to convince the Reader, that Genetic Algorithms are essentially bound for success. For this purpose, we consider only the crossover operators, single- or multiple-point, together with selection procedure. We also give a proof that the soft selection is superior to other selection schemes.
Cite
@article{arxiv.cs/0512019,
title = {Amazing geometry of genetic space or are genetic algorithms convergent?},
author = {Marek W. Gutowski},
journal= {arXiv preprint arXiv:cs/0512019},
year = {2007}
}
Comments
7 pages, presented on VII KAEiOG (VII Domestic Conference on Evolutionary Algorithms and Global Optimization), May 24-26, 2004, Kazimierz Dolny, Poland