Mean Convergence Time of Inhomogeneous Genetic Algorithm with Elitism
- 19 May 2016
- journal article
- research article
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 37 (8) , 966-974
Abstract
The theoretical study of a genetic algorithm (GA) has focused mainly on establishing its convergence in probability and almost always to the global optimum. In this article, we establishsufficient conditions for the finiteness of convergence mean time of the genetic algorithm with elitism. We obtain bounds for the probability of convergence to the global optimum in the first n iterations as a by-product.Keywords
This publication has 11 references indexed in Scilit:
- The elitist non-homogeneous genetic algorithm: Almost sure convergenceStatistics & Probability Letters, 2013
- Modeling the Genetic Algorithm by a Nonhomogeneous Markov Chain: Weak and Strong ErgodicityTheory of Probability & Its Applications, 2013
- Random Perturbations of Dynamical Systems2012
- Multistage Markov Chain Modeling of the Genetic Algorithm and Convergence ResultsNumerical Functional Analysis and Optimization, 2010
- Global Optimization with Exploration/Selection Algorithms and Simulated AnnealingThe Annals of Applied Probability, 2002
- Asymptotic convergence of genetic algorithmsAdvances in Applied Probability, 1998
- A new genetic algorithmThe Annals of Applied Probability, 1996
- Convergence analysis of canonical genetic algorithmsIEEE Transactions on Neural Networks, 1994
- Simulated annealing methods with general acceptance probabilitiesJournal of Applied Probability, 1987
- Generalized Simulated Annealing for Function OptimizationTechnometrics, 1986