Towards an analytic framework for analysing the computation time of evolutionary algorithms

DOI10.1016/S0004-3702(02)00381-8zbMath1082.68802MaRDI QIDQ814443

Jun He, Xin Yao

Publication date: 7 February 2006

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

Markov chain; Evolutionary algorithms; Time complexity; First hitting time

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68T05: Learning and adaptive systems in artificial intelligence

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

A new approach to estimating the expected first hitting time of evolutionary algorithms, Backward-chaining evolutionary algorithms, Recent advances in evolutionary computation, Population size versus runtime of a simple evolutionary algorithm

Uses Software

• Genocop

Cites Work

• Markov chains and stochastic stability
• Inertia characteristics of self-adjoint matrix polynomials
• Modeling genetic algorithms with Markov chains.
• Evolutionary algorithms. The role of mutation and recombination
• On the analysis of the \((1+1)\) evolutionary algorithm
• Erratum to: ``Drift analysis and average time complexity of evolutionary algorithms
• Theory of evolutionary algorithms: A bird's eye view
• On the convergence rates of genetic algorithms
• Drift analysis and average time complexity of evolutionary algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item