The effect of multiple optima on the simple GA run-time complexity
From MaRDI portal
Publication:857359
DOI10.1016/J.EJOR.2005.11.033zbMATH Open1110.90082OpenAlexW2027060250MaRDI QIDQ857359FDOQ857359
Authors: Haldun Aytug, Gary J. Koehler 
Publication date: 14 December 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.11.033
Recommendations
Cites Work
- Rough large deviation estimates for simulated annealing: Application to exponential schedules
- Modeling genetic algorithms with Markov chains.
- Theory of genetic algorithms
- Theory of genetic algorithms. II: Models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling
- On the analysis of the \((1+1)\) evolutionary algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets
- On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
- New stopping criterion for genetic algorithms
- Convergence Criteria for Genetic Algorithms
- Stopping Criteria for Finite Length Genetic Algorithms
- Linear analysis of genetic algorithms
Cited In (3)
This page was built for publication: The effect of multiple optima on the simple GA run-time complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857359)
