Choosing selection pressure for wide-gap problems
From MaRDI portal
Publication:847671
DOI10.1016/J.TCS.2009.12.014zbMATH Open1191.68303OpenAlexW2058518193MaRDI QIDQ847671FDOQ847671
Authors: Tianshi Chen, Jun He, Xin Yao, Guoliang Chen 
Publication date: 19 February 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.12.014
Recommendations
- The role of selective pressure when solving symmetric functions in polynomial time
- Hitting times of local and global optima in genetic algorithms with very high selection pressure
- On the impact of the mutation-selection balance on the runtime of evolutionary algorithms
- On the analysis of a dynamic evolutionary algorithm
- Migration policies, selection pressure, and parallel evolutionary algorithms
Markov chainevolutionary algorithmfirst hitting timeselection pressureevolutionary computation theory
Cites Work
- A study of drift analysis for estimating computation time of evolutionary algorithms
- Drift analysis and average time complexity of evolutionary algorithms
- Towards an analytic framework for analysing the computation time of evolutionary algorithms
- On the analysis of the \((1+1)\) evolutionary algorithm
- A new approach to estimating the expected first hitting time of evolutionary algorithms
- On the convergence rates of genetic algorithms
- Title not available (Why is that?)
Cited In (5)
- The role of selective pressure when solving symmetric functions in polynomial time
- On the equality constraints tolerance of constrained optimization problems
- The impatience mechanism as a diversity maintaining and saddle crossing strategy
- Evolutionary optimization: pitfalls and booby traps
- A large population size can be unhelpful in evolutionary algorithms
This page was built for publication: Choosing selection pressure for wide-gap problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847671)
