论文信息 - A new genetic algorithm with diploid chromosomes by using probability decoding for non-stationary function optimization

A new genetic algorithm with diploid chromosomes by using probability decoding for non-stationary function optimization

This paper proposes a new diploid operation technique with probability for non-tationary function optimization. The advantage of the technique over previous diploid genetic algorithms, diploid GAs, is that one genotype is transformed into many phenotvpes with probability. The technique allows genes probabilistic representation of dominance, and can keep a diversity of individuals. The experiment results show that the technique can adapt to severe environmental changes where previous diploid GAs cannot adapt. It is shown that the technique is able to find optimum solutions with high probability! genotype and make trade-off between the diversity and convergency.

Tomoki Hamagami | Manabu Kominami | T. Hamagami | M. Kominami

[1] John J. Grefenstette,et al. Genetic Algorithms for Changing Environments , 1992, PPSN.

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

[3] John J. Grefenstette,et al. Genetic Algorithms for Tracking Changing Environments , 1993, ICGA.

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

[5] John Yen,et al. A hybrid approach to modeling metabolic systems using a genetic algorithm and simplex method , 1998, IEEE Trans. Syst. Man Cybern. Part B.

[6] Kok Cheong Wong,et al. A New Diploid Scheme and Dominance Change Mechanism for Non-Stationary Function Optimization , 1995, ICGA.

[7] Melanie Mitchell,et al. Genetic Algorithms and Artificial Life , 1994, Artificial Life.

[8] John Yen,et al. A hybrid approach to modeling metabolic systems using genetic algorithm and simplex method , 1995, Proceedings the 11th Conference on Artificial Intelligence for Applications.