Theoretical analysis of steady state genetic algorithms
From MaRDI portal
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)
Recommendations
Cites work
- scientific article; zbMATH DE number 1381974 (Why is no real title available?)
- scientific article; zbMATH DE number 1100794 (Why is no real title available?)
- Continuous dynamical system models of steady-state genetic algorithms
- Estimation of distribution algorithms on non-separable problems
- Evolutionary algorithms for continuous-space optimisation
Cited in
(11)- scientific article; zbMATH DE number 876662 (Why is no real title available?)
- 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
- Linear analysis of genetic algorithms
- A formal analysis of the computational dynamics in GIGANTEC
- Mathematical analysis of schema survival for genetic algorithms having dual mutation
- Informational analysis of the genetic search
- scientific article; zbMATH DE number 1664968 (Why is no real title available?)
- The elitist non-homogeneous genetic algorithm: almost sure convergence
- scientific article; zbMATH DE number 5159419 (Why is no real title available?)
- 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)