The elitist non-homogeneous genetic algorithm: almost sure convergence

DOI10.1016/j.spl.2013.05.025zbMath1295.60085OpenAlexW2013280223MaRDI QIDQ2435733

J. A. Rojas Cruz, André G. C. Pereira

Publication date: 19 February 2014

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2013.05.025

zbMATH Keywords

Markov chainsstrong ergodicityweak ergodicitynon-homogeneous genetic algorithms

Mathematics Subject Classification ID

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)

Related Items (6)

Unnamed Item ⋮ I-robust and D-robust designs on a finite design space ⋮ On the genetic algorithm with adaptive mutation rate and selected statistical applications ⋮ Statistical and computational tradeoff in genetic algorithm-based estimation ⋮ Multistage non homogeneous Markov chain modeling of the non homogeneous genetic algorithm and convergence results ⋮ Mean Convergence Time of Inhomogeneous Genetic Algorithm with Elitism

Uses Software

• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global optimization and stochastic differential equations
• A new genetic algorithm
• Asymptotic convergence of genetic algorithms
• Modeling the Genetic Algorithm by a Nonhomogeneous Markov Chain: Weak and Strong Ergodicity

This page was built for publication: The elitist non-homogeneous genetic algorithm: almost sure convergence