Similarities and distinctions in sampling strategies for Genetic Algorithms

摘要

Following on from a recent report, which presented stochastic models for two classes of Genetic Algorithms (GAs), we present two results which have important implications with respect to the theoretical basis of these methods. The first result we present concerns the technique of lumping, and we show how this technique can be used to transform the searching process of a class of GAs. Based on this transformation, our second result concerns the direct comparison of the two main GAs used today, and provides the conditions ander which these two GAs are fandamentally distinct search algorithms. A novel role is played by the convergent populations in the derivation of these conditions.