Drift conditions for estimating the first hitting times of evolutionary algorithms

DOI10.1080/00207160903477167zbMath1211.65069OpenAlexW2019245853MaRDI QIDQ5391462

Yu Chen, Xiufen Zou, Jun He

Publication date: 6 April 2011

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160903477167

zbMATH Keywords

performanceglobal optimizationnumerical examplesevolutionary algorithmsfirst hitting times

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Stochastic programming (90C15) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

Average convergence rate of evolutionary algorithms in continuous optimization

Uses Software

• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Evolutionary programming using a mixed mutation strategy
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• Lower bounds for randomized direct search with isotropic sampling
• A study of drift analysis for estimating computation time of evolutionary algorithms
• How to analyse evolutionary algorithms.
• Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
• Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
• How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms
• STACS 2005
• Drift analysis and average time complexity of evolutionary algorithms

This page was built for publication: Drift conditions for estimating the first hitting times of evolutionary algorithms