2005/12/05 by Marek W. Gutowski, Gutowski, Marek W.
Computer Science · #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #G.1.6 #G.4 #I.1.2 #Neural and Evolutionary Computing (cs.NE) #Software Engineering (cs.SE) #cs.DM #cs.NE #cs.SE
paper · pdf · doi:10.48550/arxiv.cs/0512019
7 pages, presented on VII KAEiOG (VII Domestic Conference on Evolutionary Algorithms and Global Optimization), May 24-26, 2004, Kazimierz Dolny, Poland
arxiv created 2005/12/05 · arxiv updated 2009/12/01
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.