Genetic algorithms: Bridging the convergence gap
From MaRDI portal
Publication:1978366
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
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
- scientific article; zbMATH DE number 709517 (Why is no real title available?)
- An equivalent genetic algorithm based on extended strings and its convergence analysis
- scientific article; zbMATH DE number 4182860 (Why is no real title available?)
- A hybrid genetic algorithm with Boltzmann convergence properties
- A hybrid genetic algorithm for integer programming and its convergence
- The quasispecies regime for the simple genetic algorithm with ranking selection
- Annealing a genetic algorithm for constrained optimization
- scientific article; zbMATH DE number 1553358 (Why is no real title available?)
- 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)
