A new real-coded genetic algorithm using the adaptive selection network for detecting multiple optima

The purpose of this paper is to propose a new real-coded genetic algorithm (RCGA) named Networked Genetic Algorithm (NGA) that intends to find multiple optima simultaneously in deceptive globally multimodal landscapes. Most current techniques such as niching for finding multiple optima take into account big valley landscapes or non-deceptive globally multimodal landscapes but not deceptive ones called UV-landscapes. Adaptive Neighboring Search (ANS) is a promising approach for finding multiple optima in UV-landscapes. ANS utilizes a restricted mating scheme with a crossover-like mutation in order to find optima in deceptive globally multimodal landscapes. However, ANS has a fundamental problem that it does not find all the optima simultaneously in many cases. NGA overcomes the problem by an adaptive parent-selection scheme and an improved crossover-like mutation. We show the effectiveness of NGA over ANS in terms of the number of detected optima in a single run on Fletcher and Powell functions as benchmark problems that are known to have UV-landscapes. We also analyze the behavior of NGA to confirm that the adaptive parent-selection scheme contributes the performance of NGA.

[1]  Andrew M. Sutton,et al.  The Impact of Global Structure on Search , 2008, PPSN.

[2]  J. Sakuma,et al.  Optimization of Instance-based Policy Based on Real-coded Genetic Algorithms , 2008, 2008 IEEE Conference on Soft Computing in Industrial Applications.

[3]  Shigenobu Kobayashi,et al.  Adaptive isolation model using data clustering for multimodal function optimization , 2005, GECCO '05.

[4]  S. Kobayashi,et al.  Multi-parental extension of the unimodal normal distribution crossover for real-coded genetic algorithms , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[5]  Masayuki Yamamura,et al.  Theoretical Analysis of Simplex Crossover for Real-Coded Genetic Algorithms , 2000, PPSN.

[6]  M. Yamamura,et al.  A functional specialization hypothesis for designing genetic algorithms , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[7]  Thomas Bäck,et al.  Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .

[8]  S. Kobayashi,et al.  Optimal lens design by real-coded genetic algorithms using UNDX , 2000 .

[9]  Robert H. Leary,et al.  Global Optimization on Funneling Landscapes , 2000, J. Glob. Optim..

[10]  Shigenobu Kobayashi,et al.  Latent variable crossover for k-tablet structures and its application to lens design problems , 2005, GECCO '05.

[11]  Shigenobu Kobayashi,et al.  GA Based on the UV-Structure Hypothesis and Its Application to JSP , 2000, PPSN.

[12]  Ofer M. Shir,et al.  Niche Radius Adaptation with Asymmetric Sharing , 2008, PPSN.

[13]  Kenneth D. Boese,et al.  Cost Versus Distance In the Traveling Salesman Problem , 1995 .

[14]  L. Darrell Whitley,et al.  The dispersion metric and the CMA evolution strategy , 2006, GECCO.

[15]  Shigenobu Kobayashi,et al.  Extrapolation-directed crossover for real-coded GA: overcoming deceptive phenomena by extrapolative search , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[16]  Shigenobu Kobayashi,et al.  An adaptive neighboring search using crossover-like mutation for multi modal function optimization , 2001, 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236).

[17]  Jie Yao,et al.  BMPGA: a bi-objective multi-population genetic algorithm for multi-modal function optimization , 2005, 2005 IEEE Congress on Evolutionary Computation.