Mean convergence time of inhomogeneous genetic algorithm with elitism

DOI10.1080/01630563.2016.1182187zbMATH Open1351.60098OpenAlexW2433438458MaRDI QIDQ2829597FDOQ2829597

Authors: 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

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

zbMATH Keywords

simulated annealinggenetic algorithmnon-homogeneous Markov chainmean convergence time

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Random Perturbations of Dynamical Systems
• A Markov chain analysis of genetic algorithms: large deviation principle approach
• Multistage Markov chain modeling of the genetic algorithm and convergence results
• Modeling the genetic algorithm by a nonhomogeneous Markov chain: weak and strong ergodicity
• A new genetic algorithm
• Asymptotic convergence of genetic algorithms
• Simulated annealing methods with general acceptance probabilities
• The elitist non-homogeneous genetic algorithm: almost sure convergence
• Global optimization with exploration/selection algorithms and simulated annealing

Cited In (5)

• Convergence and convergence rate analysis of elitist genetic algorithms based on a martingale approach
• Title not available (Why is that?)
• The elitist non-homogeneous genetic algorithm: almost sure convergence
• Title not available (Why is that?)
• Hitting times of local and global optima in genetic algorithms with very high selection pressure

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)