Modeling the Genetic Algorithm by a Nonhomogeneous Markov Chain: Weak and Strong Ergodicity

DOI10.1137/S0040585X97985868zbMath1273.90244OpenAlexW2041637536MaRDI QIDQ5298811

J. A. Rojas Cruz, André G. C. Pereira, Viviane S. M. Campos

Publication date: 14 June 2013

Published in: Theory of Probability & Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0040585x97985868

Mathematics Subject Classification ID

Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

On the convergence rate of the elitist genetic algorithm based on mutation probability ⋮ The elitist non-homogeneous genetic algorithm: almost sure convergence ⋮ Mean Convergence Time of Inhomogeneous Genetic Algorithm with Elitism ⋮ On weak and strong ergodicity

This page was built for publication: Modeling the Genetic Algorithm by a Nonhomogeneous Markov Chain: Weak and Strong Ergodicity