Adaptive Adjustment of Weight Parameters for Diploid Genetic Algorithm with a Network Structure

A new diploid genetic algorithm (DipGA) with network structure which enables autonomous adaptation to dynamic environment is proposed in this paper. The proposed algorithm has the network weights changed adaptively according to the pattern of dynamics in the environment during the evolving loop. The state of the art of the algorithm is that the genotypes of population and network parameters controlling phenotypes are co-evolved by the dynamics of environment. Thus, the algorithm can memorize the dynamics of environment in mutual effects between genes and manifestation networks. In order to evaluate the adaptation, simulation experiments based on typical benchmark functions with dynamics are conducted. The experiment results show that the algorithm improves the performance of following to the change of environment, and adapts to the dynamics.

[1]  Shengxiang Yang,et al.  A hybrid immigrants scheme for genetic algorithms in dynamic environments , 2007, Int. J. Autom. Comput..

[2]  Xin Yao,et al.  Population-Based Incremental Learning With Associative Memory for Dynamic Environments , 2008, IEEE Transactions on Evolutionary Computation.

[3]  Philippe Collard,et al.  An evolutionary approach for time dependant optimization , 1996, Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence.

[4]  Shengxiang Yang,et al.  Genetic Algorithms with Elitism-Based Immigrants for Changing Optimization Problems , 2007, EvoWorkshops.

[5]  Christoph F. Eick,et al.  Supporting Polyploidy in Genetic Algorithms Using Dominance Vectors , 1997, Evolutionary Programming.

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

[7]  Emma Hart,et al.  A Comparison of Dominance Mechanisms and Simple Mutation on Non-stationary Problems , 1998, PPSN.

[8]  A. Sima Etaner-Uyar,et al.  A new population based adaptive domination change mechanism for diploid genetic algorithms in dynamic environments , 2005, Soft Comput..

[9]  David E. Goldberg,et al.  Nonstationary Function Optimization Using Genetic Algorithms with Dominance and Diploidy , 1987, ICGA.

[10]  Shengxiang Yang,et al.  Adaptive Primal–Dual Genetic Algorithms in Dynamic Environments , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[11]  Philippe Collard,et al.  An Evolutionary Approach for Time Dependent Optimization , 1997, Int. J. Artif. Intell. Tools.

[12]  Tomoki Hamagami,et al.  A new genetic algorithm with diploid chromosomes by using probability decoding for non-stationary function optimization , 2007, 2007 IEEE International Conference on Systems, Man and Cybernetics.