Genetic algorithms: Bridging the convergence gap

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

Authors: Yanyan Li 

Publication date: 4 June 2000

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

Recommendations

• On the convergence of genetic algorithms
• On the convergence rates of genetic algorithms
• Mapping the convergence of genetic algorithms
• scientific article; zbMATH DE number 1547722
• Techniques for bounding the convergence rate of genetic algorithms
• Convergence Criteria for Genetic Algorithms
• A convergence theorem for genetic algorithms
• A fast genetic algorithm and its convergence

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 (11)

• 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
• Title not available (Why is that?)
• An equivalent genetic algorithm based on extended strings and its convergence analysis
• Title not available (Why is that?)
• A hybrid genetic algorithm for integer programming and its convergence
• A hybrid genetic algorithm with Boltzmann convergence properties
• The quasispecies regime for the simple genetic algorithm with ranking selection
• Annealing a genetic algorithm for constrained optimization
• Title not available (Why is that?)
• A hybrid genetic algorithm with the Baldwin effect
• Multistage non homogeneous Markov chain modeling of the non homogeneous genetic algorithm and convergence results

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)