The effect of multiple optima on the simple GA run-time complexity

DOI10.1016/j.ejor.2005.11.033zbMath1110.90082OpenAlexW2027060250MaRDI QIDQ857359

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

zbMATH Keywords

Markov chainsgenetic algorithmsWorst-case analysis

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Rough large deviation estimates for simulated annealing: Application to exponential schedules
• Linear analysis of genetic algorithms
• A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets
• Modeling genetic algorithms with Markov chains.
• On the analysis of the \((1+1)\) evolutionary algorithm
• 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
• Convergence Criteria for Genetic Algorithms
• On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
• Stopping Criteria for Finite Length Genetic Algorithms
• New stopping criterion for genetic algorithms
• Theory of genetic algorithms

This page was built for publication: The effect of multiple optima on the simple GA run-time complexity