Adaptive Niching via coevolutionary Sharing

An adaptive niching scheme called coevolutionary shared niching (CSN) is proposed, implemented, analyzed and tested. The scheme overcomes the limitations of xed sharing schemes by permitting the locations and radii of niches to adapt to complex landscapes, thereby permitting a better distribution of solutions in problems with many badly spaced optima. The scheme takes its inspiration from the model of monopolistic competition in economics and utilizes two populations, a population of businessmen and a population of customers, where the locations of the businessmen correspond to niche locations and the locations of customers correspond to solutions. Initial results on straightforward test functions validate the distributional e ectiveness of the basic scheme, although tests on a massively multimodal function do not nd the best niches in the allotted time. This result spurs the design of an imprint mechanism that turns the best customers into businessmen, thereby making better use of the search power of the large population of customers. Although additional testing is needed, coevolutionary sharing appears to be a powerful means of controlling the number, location, extent and distribution of solutions in complex landscapes.

[1]  D. J. Cavicchio,et al.  Adaptive search using simulated evolution , 1970 .

[2]  Gordon Tullock,et al.  Toward A Mathematics Of Politics , 1972 .

[3]  David E. Goldberg,et al.  Genetic Algorithms with Sharing for Multimodalfunction Optimization , 1987, ICGA.

[4]  Kalyanmoy Deb,et al.  An Investigation of Niche and Species Formation in Genetic Function Optimization , 1989, ICGA.

[5]  David E. Goldberg,et al.  A Genetic Algorithm for Parallel Simulated Annealing , 1992, PPSN.

[6]  Kalyanmoy Deb,et al.  Massive Multimodality, Deception, and Genetic Algorithms , 1992, PPSN.

[7]  Michael Lewchuk.  Genetic Invariance: A New Approach to Genetic Algorithm , 1992 .

[8]  Xiaodong Yin,et al.  Improving Genetic Algorithms with Sharing through Cluster Analysis , 1993, ICGA.

[9]  Kalyanmoy Deb,et al.  Multimodal Deceptive Functions , 1993, Complex Syst..

[10]  C. Fonseca,et al.  GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION , 1993 .

[11]  Joseph C. Culberson.  Crossover versus Mutation: Fueling the Debate: TGA versus GIGA , 1993, ICGA.

[12]  Kalyanmoy Deb,et al.  RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms , 1993, ICGA.

[13]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[14]  Dirk Thierens,et al.  Elitist recombination: an integrated selection recombination GA , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

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

[16]  Hillol Kargupta,et al.  The Gene Expression Messy Genetic Algorithm , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[17]  Michael J. Shaw,et al.  Genetic algorithms with dynamic niche sharing for multimodal function optimization , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[18]  Schloss Birlinghoven,et al.  How Genetic Algorithms Really Work I.mutation and Hillclimbing , 2022 .