Genetic algorithms: Bridging the convergence gap

DOI10.1016/S0304-3975(99)00090-0zbMATH Open0938.68080WikidataQ62637482 ScholiaQ62637482MaRDI QIDQ1978366FDOQ1978366

Yanyan Li

Publication date: 4 June 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

simulated annealingconvergencegenetic algorithmsinhomogeneous Markov chainreduction operator

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05)

Cited In (4)

• Theory of genetic algorithms. II: Models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling
• The quasispecies regime for the simple genetic algorithm with ranking selection
• Title not available (Why is that?)
• Multistage non homogeneous Markov chain modeling of the non homogeneous genetic algorithm and convergence results

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Techniques for bounding the convergence rate of genetic algorithms 👍 👎
• Convergence Criteria for Genetic Algorithms 👍 👎
• On the convergence rates of genetic algorithms 👍 👎
• On the convergence of genetic algorithms 👍 👎
• Mapping the convergence of genetic algorithms 👍 👎
• A convergence theorem for genetic algorithms 👍 👎

This page was built for publication: Genetic algorithms: Bridging the convergence gap

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978366)