pith. sign in

arxiv: cs/0512019 · v1 · submitted 2005-12-05 · 💻 cs.NE · cs.DM· cs.SE

Amazing geometry of genetic space or are genetic algorithms convergent?

classification 💻 cs.NE cs.DMcs.SE
keywords geneticalgorithmsselectionproofamazingargumentsboundconsider
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.