Mean convergence time of inhomogeneous genetic algorithm with elitism
From MaRDI portal
Publication:2829597
Recommendations
- On the convergence rates of genetic algorithms
- Convergence Criteria for Genetic Algorithms
- Finite-time performance analysis for genetic algorithms
- The elitist non-homogeneous genetic algorithm: almost sure convergence
- Convergence and convergence rate analysis of elitist genetic algorithms based on a martingale approach
Cites work
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- A Markov chain analysis of genetic algorithms: large deviation principle approach
- A new genetic algorithm
- Asymptotic convergence of genetic algorithms
- Global optimization with exploration/selection algorithms and simulated annealing
- Modeling the genetic algorithm by a nonhomogeneous Markov chain: weak and strong ergodicity
- Multistage Markov chain modeling of the genetic algorithm and convergence results
- Random Perturbations of Dynamical Systems
- Simulated annealing methods with general acceptance probabilities
- The elitist non-homogeneous genetic algorithm: almost sure convergence
Cited in
(5)- Convergence and convergence rate analysis of elitist genetic algorithms based on a martingale approach
- Hitting times of local and global optima in genetic algorithms with very high selection pressure
- The elitist non-homogeneous genetic algorithm: almost sure convergence
- scientific article; zbMATH DE number 7149438 (Why is no real title available?)
- scientific article; zbMATH DE number 1471372 (Why is no real title available?)
This page was built for publication: Mean convergence time of inhomogeneous genetic algorithm with elitism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829597)