Amazing geometry of genetic space or are genetic algorithms convergent?

Simple item page
dc.creatorGutowski, Marek W.
dc.date2005-12-05
dc.date.accessioned2026-07-07T06:53:47Z
dc.date.available2026-07-07T06:53:47Z
dc.descriptionThere 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.
dc.description7 pages, presented on VII KAEiOG (VII Domestic Conference on Evolutionary Algorithms and Global Optimization), May 24-26, 2004, Kazimierz Dolny, Poland
dc.identifierhttps://arxiv.org/abs/cs/0512019
dc.identifierhttp://arxiv.org/abs/cs/0512019
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/105714
dc.subjectNeural and Evolutionary Computing
dc.subjectDiscrete Mathematics
dc.subjectSoftware Engineering
dc.subjectF.2.2; G.1.6; G.4; I.1.2
dc.titleAmazing geometry of genetic space or are genetic algorithms convergent?
dc.typetext

Files

Collections

arXiv