Theoretical analysis of steady state genetic algorithms
DOI10.1007/S10492-014-0069-ZzbMATH Open1340.68123OpenAlexW2060576390MaRDI QIDQ489236FDOQ489236
Authors: 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
Recommendations
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) Approximation methods and heuristics in mathematical programming (90C59) Randomized algorithms (68W20)
Cites Work
Cited In (11)
- Title not available (Why is that?)
- Continuous dynamical system models of steady-state genetic algorithms
- Steady state analysis of a multi-recombinative meta-ES on a conically constrained problem with comparison to \(\sigma\)SA and CSA
- A formal analysis of the computational dynamics in GIGANTEC
- Linear analysis of genetic algorithms
- Informational analysis of the genetic search
- Mathematical analysis of schema survival for genetic algorithms having dual mutation
- Title not available (Why is that?)
- The elitist non-homogeneous genetic algorithm: almost sure convergence
- Title not available (Why is that?)
- On the theoretical analysis of the plant propagation algorithms
This page was built for publication: Theoretical analysis of steady state genetic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489236)