Non-Elitist Genetic Algorithm as a Local Search Method
classification
💻 cs.NE
keywords
algorithmlocalconditionsgeneticnon-elitistappropriateaveragebounded
read the original abstract
Sufficient conditions are found under which the iterated non-elitist genetic algorithm with tournament selection first visits a local optimum in polynomially bounded time on average. It is shown that these conditions are satisfied on a class of problems with guaranteed local optima (GLO) if appropriate parameters of the algorithm are chosen.
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.