Genetic Algorithms, Clustering, and the Breaking of Symmetry

This paper introduces clustering as a tool to improve the effects of recombination and incorporate niching in evolutionary algorithms. Instead of processing the entire set of parent solutions, the set is first clustered and the solutions in each of the clusters are processed separately. This alleviates the problem of symmetry which is often a major difficulty of many evolutionary algorithms in combinatorial optimization. Furthermore, it incorporates niching into genetic algorithms and, for the first time, the probabilistic model-building genetic algorithms. The dynamics and performance of the proposed method are illustrated on example problems.

[1]  K. Deb.  Binary and floating-point function optimization using messy genetic algorithms , 1991 .

[2]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

[4]  Jan Naudts,et al.  The Effect of Spin-Flip Symmetry on the Performance of the Simple GA , 1998, PPSN.

[5]  Jiri Ocenasek,et al.  EXPERIMENTAL STUDY: HYPERGRAPH PARTITIONING BASED ON THE SIMPLE AND ADVANCED GENETIC ALGORITHM BMDA AND BOA , 2002 .

[6]  Georges R. Harik,et al.  Finding Multimodal Solutions Using Restricted Tournament Selection , 1995, ICGA.

[7]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[8]  M. Pelikán,et al.  The Bivariate Marginal Distribution Algorithm , 1999 .

[9]  Craig A. Knoblock.  Hierarchical Problem Solving , 1993 .

[10]  James C. Bezdek,et al.  Genetic algorithm guided clustering , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[11]  Hans-Paul Schwefel,et al.  Parallel Problem Solving from Nature — PPSN IV , 1996, Lecture Notes in Computer Science.

[12]  Arthur C. Sanderson,et al.  Evolutionary Speciation Using Minimal Representation Size Clustering , 1995, Evolutionary Programming.

[13]  Chris Melhuish,et al.  Applying a Restricted Mating Policy to Determine State Space Niches Using Immediate and Delayed Reinforcement , 1994, Evolutionary Computing, AISB Workshop.

[14]  David E. Goldberg,et al.  A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..

[15]  David E. Goldberg,et al.  Linkage Problem, Distribution Estimation, and Bayesian Networks , 2000, Evolutionary Computation.

[16]  D. Goldberg,et al.  Adaptive Niching via coevolutionary Sharing , 1997 .