A generic design model for evolutionary algorithms

DOI10.1007/BF02899483MaRDI QIDQ4454470zbMATH OpenFDO

Authors Jun He, Xin Yao

Publication date 8 March 2004

Published in Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

zbMATH Keywords

convergencehitting timeevolutionary algorithmsdrift analysis

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) Nonnumerical algorithms (68W05)

Recommendations

• A study of drift analysis for estimating computation time of evolutionary algorithms
• Drift conditions for estimating the first hitting times of evolutionary algorithms
• Some analyses about the time complexity of evolutionary algorithms
• Some analysis about the time complexity of evolutionary algorithms
• Drift analysis and average time complexity of evolutionary algorithms

Cited in

(4)

• Combining Markov-chain analysis and drift analysis. The \((1+1)\) evolutionary algorithm on linear functions reloaded
• Drift analysis and average time complexity of evolutionary algorithms
• A study of drift analysis for estimating computation time of evolutionary algorithms
• Drift conditions for estimating the first hitting times of evolutionary algorithms

This page was built for publication: A generic design model for evolutionary algorithms

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