A new approach to estimating the expected first hitting time of evolutionary algorithms

DOI10.1016/J.ARTINT.2008.07.001MaRDI QIDQ2389686zbMATHOpenAlexFDO

Authors Yang Yu, Zhi-Hua Zhou

Publication date 17 July 2009

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2008.07.001

zbMATH Keywords

computational complexityconvergence rateevolutionary algorithmsexpected first hitting time

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Some analyses about the time complexity of evolutionary algorithms
• Some analysis about the time complexity of evolutionary algorithms
• Drift conditions for estimating the first hitting times of evolutionary algorithms
• Towards an analytic framework for analysing the computation time of evolutionary algorithms
• On the convergence rate and expected first fitting time of elitist evolutionary algorithms

Cites work

• scientific article; zbMATH DE number 1337869 (Why is no real title available?)
• scientific article; zbMATH DE number 976350 (Why is no real title available?)
• A study of drift analysis for estimating computation time of evolutionary algorithms
• Drift analysis and average time complexity of evolutionary algorithms
• Hitting-time and occupation-time bounds implied by drift analysis with applications
• How to analyse evolutionary algorithms.
• Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
• Modeling genetic algorithms with Markov chains.
• On the analysis of the \((1+1)\) evolutionary algorithm
• On the convergence rates of genetic algorithms
• Towards an analytic framework for analysing the computation time of evolutionary algorithms

Cited in

(16)

• The analysis of expected fitness and success ratio of two heuristic optimizations on two bimodal MaxSat problems
• First passage times of genetic algorithms
• Variable solution structure can be helpful in evolutionary optimization
• scientific article; zbMATH DE number 1696516 (Why is no real title available?)
• The use of tail inequalities on the probable computational time of randomized search heuristics
• On the approximation ability of evolutionary optimization with application to minimum set cover
• On convergence analysis of particle swarm optimization algorithm
• On the genetic algorithm with adaptive mutation rate and selected statistical applications
• Drift conditions for estimating the first hitting times of evolutionary algorithms
• Towards an analytic framework for analysing the computation time of evolutionary algorithms
• An analysis on recombination in multi-objective evolutionary optimization
• Drift analysis of mutation operations for biogeography-based optimization
• The time complexity analysis of a class of gene expression programming
• Choosing selection pressure for wide-gap problems
• Reprint of: On convergence analysis of particle swarm optimization algorithm
• On the convergence rate and expected first fitting time of elitist evolutionary algorithms

This page was built for publication: A new approach to estimating the expected first hitting time of evolutionary algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2389686)