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

DOI10.1016/j.artint.2008.07.001zbMath1184.68479OpenAlexW2152325608MaRDI QIDQ2389686

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

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

Related Items (11)

Variable solution structure can be helpful in evolutionary optimization ⋮ Reprint of: On convergence analysis of particle swarm optimization algorithm ⋮ Choosing selection pressure for wide-gap problems ⋮ The analysis of expected fitness and success ratio of two heuristic optimizations on two bimodal MaxSat problems ⋮ On the approximation ability of evolutionary optimization with application to minimum set cover ⋮ The use of tail inequalities on the probable computational time of randomized search heuristics ⋮ An analysis on recombination in multi-objective evolutionary optimization ⋮ On convergence analysis of particle swarm optimization algorithm ⋮ Drift analysis of mutation operations for biogeography-based optimization ⋮ The time complexity analysis of a class of gene expression programming ⋮ On the genetic algorithm with adaptive mutation rate and selected statistical applications

Cites Work

• Unnamed Item
• Unnamed Item
• Towards an analytic framework for analysing the computation time of evolutionary algorithms
• Modeling genetic algorithms with Markov chains.
• On the analysis of the \((1+1)\) evolutionary algorithm
• A study of drift analysis for estimating computation time of evolutionary algorithms
• How to analyse evolutionary algorithms.
• On the convergence rates of genetic algorithms
• Hitting-time and occupation-time bounds implied by drift analysis with applications
• Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
• Drift analysis and average time complexity of evolutionary algorithms

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