Theoretical analysis of steady state genetic algorithms

DOI10.1007/s10492-014-0069-zzbMath1340.68123OpenAlexW2060576390MaRDI QIDQ489236

Alexandru Agapie, Alden H. Wright

Publication date: 27 January 2015

Published in: Applications of Mathematics (Search for Journal in Brave)

Full work available at URL: https://scholarworks.umt.edu/cgi/viewcontent.cgi?article=1027&context=cs_pubs

zbMATH Keywords

Markov chaingenetic algorithmrandom heuristic search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Cites Work

• Evolutionary algorithms for continuous-space optimisation
• Estimation of distribution algorithms on non-separable problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Theoretical analysis of steady state genetic algorithms