Noisy Local Optimization with Evolution Strategies
Noisy Local Optimization with Evolution Strategies
Genetic algorithms, selection schemes, and the varying effects of noise
Evolutionary Computation
Theoretical analysis of genetic algorithms in noisy environments based on a Markov Model
Proceedings of the 10th annual conference on Genetic and evolutionary computation
On the robustness of population-based versus point-basedoptimization in the presence of noise
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
We examine the convergence properties of genetic algorithms (GAs) in a wide variety of noisy environments where fitness perturbation can occur in any form for example, fitness functions can be concurrently perturbed by additive and multiplicative noise. We reveal the convergence properties of such GAs by constructing and analyzing a Markov chain that explicitly models the evolution of the algorithms. We compute the one-step transition probabilities of the chain and show that the chain has only one positive recurrent communication class. Based on this property, we establish a condition that is necessary and sufficient for GAs to eventually find a globally optimal solution with probability 1. We also identify a condition that is necessary and sufficient for GAs to eventually with probability 1 fail to find any globally optimal solution. Our analysis also shows that in all the noisy environments, the chain converges to stationarity: It has a unique stationary distribution that is also its steady-state distribution. We describe how this property and the one-step transition probabilities of the chain can be used to compute the exact probability that a GA is guaranteed to select a globally optimal solution upon completion of each iteration.