On modeling genetic algorithms for functions of unitation

We discuss a novel model for analyzing the working of Genetic Algorithms (GAs), when the objective function is a function of unitation. The model is exact (not approximate), and is valid for infinite populations. Functions of unitation depend only on the number of 1's in any string. Hence, we only need to model the variations in the distribution of strings with respect to the number of 1's in the strings. We introduce the notion of a Binomial Distributed Population (BDP) as the building block of our model, and we show that the effect of uniform crossover on BDPs is to generate two other BDPs. We demonstrate that a population with any general distribution may be decomposed into several BDPs. We also show that a general multipoint crossover may be considered as a composition of several uniform crossovers. Based on these results, the effects of mutation and crossover on the distribution of strings have been characterized, and the model has been defined. GASIM-a Genetic Algorithm Simulator for functions of unitation-has been implemented based on the model, and the exactness of the results obtained from GASIM has been verified using actual Genetic Algorithm runs. The time complexity of the GA simulator derived from the model is O(l(3)) (where l is the string length), a significant improvement over previous models with exponential time complexities.

[1]  Lalit M. Patnaik,et al.  Genetic algorithms: a survey , 1994, Computer.

[2]  Kalyanmoy Deb,et al.  Analyzing Deception in Trap Functions , 1992, FOGA.

[3]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[4]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[5]  Darrell Whitley,et al.  Scheduling problems and traveling salesman: the genetic edge recombination , 1989 .

[6]  Kenneth A. De Jong,et al.  Genetic algorithms: A 10 Year Perspective , 1985, ICGA.

[7]  Rajarshi Das,et al.  A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization , 1989, ICGA.

[8]  Kenneth A. De Jong,et al.  On Using Genetic Algorithms to Search Program Spaces , 1987, ICGA.

[9]  Larry J. Eshelman,et al.  Biases in the Crossover Landscape , 1989, ICGA.

[10]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[11]  José Carlos Príncipe,et al.  A Simulated Annealing Like Convergence Theory for the Simple Genetic Algorithm , 1991, ICGA.

[12]  John J. Grefenstette,et al.  Deception Considered Harmful , 1992, FOGA.

[13]  David E. Goldberg,et al.  Finite Markov Chain Analysis of Genetic Algorithms , 1987, ICGA.

[14]  Gunar E. Liepins,et al.  Punctuated Equilibria in Genetic Search , 1991, Complex Syst..

[15]  Lalit M. Patnaik,et al.  On an Exact Populationary Model of Genetic Algorithms , 1997, Inf. Sci..

[16]  David E. Goldberg,et al.  An Analysis of Reproduction and Crossover in a Binary-Coded Genetic Algorithm , 1987, ICGA.

[17]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[18]  D. Ackley.  A connectionist machine for genetic hillclimbing , 1987 .

[19]  L. Darrell Whitley,et al.  An Executable Model of a Simple Genetic Algorithm , 1992, FOGA.