Techniques for bounding the convergence rate of genetic algorithms

DOI<111::AID-RSA1>3.0.CO;2-6 10.1002/(SICI)1098-2418(199903)14:2<111::AID-RSA1>3.0.CO;2-6zbMath0922.90115OpenAlexW2017394741MaRDI QIDQ4238438

Avi Wigderson, Yuri Rabinovich

Publication date: 30 March 1999

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199903)14:2<111::aid-rsa1>3.0.co;2-6

zbMATH Keywords

rate of convergencegenetic algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)

Related Items

Global optimization with exploration/selection algorithms and simulated annealing, Unnamed Item, Asymptotic Hitting Time for a Simple Evolutionary Model of Protein Folding, Crossover can provably be useful in evolutionary computation, Sharp asymptotic results for simplified mutation-selection algorithms, Multistage Markov Chain Modeling of the Genetic Algorithm and Convergence Results, A weighted random walk model, with application to a genetic algorithm, Genetic algorithms in random environments: two examples

Cites Work

• A computational view of population genetics