Mean Convergence Time of Inhomogeneous Genetic Algorithm with Elitism

DOI10.1080/01630563.2016.1182187zbMath1351.60098OpenAlexW2433438458MaRDI QIDQ2829597

Juan Alberto Rojas Cruz, Iesus C. Diniz

Publication date: 8 November 2016

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2016.1182187

zbMATH Keywords

simulated annealinggenetic algorithmnon-homogeneous Markov chainmean convergence time

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Discrete-time Markov processes on general state spaces (60J05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40)

Cites Work

• Unnamed Item
• Global optimization with exploration/selection algorithms and simulated annealing
• The elitist non-homogeneous genetic algorithm: almost sure convergence
• A new genetic algorithm
• A Markov Chain Analysis of Genetic Algorithms: Large Deviation Principle Approach
• Random Perturbations of Dynamical Systems
• Multistage Markov Chain Modeling of the Genetic Algorithm and Convergence Results
• Simulated annealing methods with general acceptance probabilities
• Asymptotic convergence of genetic algorithms
• Modeling the Genetic Algorithm by a Nonhomogeneous Markov Chain: Weak and Strong Ergodicity

This page was built for publication: Mean Convergence Time of Inhomogeneous Genetic Algorithm with Elitism