Dual-population genetic algorithm for nonstationary optimization

In order to solve nonstationary optimization problems efficiently, evolutionary algorithms need sufficient diversity to adapt to environmental changes. The dual-population genetic algorithm (DPGA) is a novel evolutionary algorithm that uses an extra population called the reserve population to provide additional diversity to the main population through crossbreeding. Preliminary experimental results on various periods and degrees of environmental change have shown that the distance between the two populations of DPGA is one of the most important factors that affect its per-formance. However, it is very difficult to determine the best popu-lation distance without prior knowledge about the given problem. This paper proposes a new DPGA that uses two reserve populations (DPGA2). The reserve populations are at different distances from the main population. The information inflow from the reserve populations is controlled by survival selection. Experimental results show that DPGA2 shows a better performance than other evolutionary algorithms for nonstationary optimization problems without relying on prior knowledge about the problem.

[1]  Shigeyoshi Tsutsui,et al.  Forking Genetic Algorithms: GAs with Search Space Division Schemes , 1997, Evolutionary Computation.

[2]  Jürgen Branke,et al.  A Multi-population Approach to Dynamic Optimization Problems , 2000 .

[3]  Jrgen Branke,et al.  Evolutionary approaches to dynamic optimization problems , 2001 .

[4]  Melanie Mitchell,et al.  The royal road for genetic algorithms: Fitness landscapes and GA performance , 1991 .

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

[6]  L. Darrell Whitley,et al.  Fundamental Principles of Deception in Genetic Search , 1990, FOGA.

[7]  Kwang Ryel Ryu,et al.  A dual population genetic algorithm with evolving diversity , 2007, 2007 IEEE Congress on Evolutionary Computation.

[8]  Shengxiang Yang,et al.  Non-stationary problem optimization using the primal-dual genetic algorithm , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

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

[10]  Xin Yao,et al.  Experimental study on population-based incremental learning algorithms for dynamic optimization problems , 2005, Soft Comput..

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

[12]  Kwang Ryel Ryu,et al.  Adjusting Population Distance for the Dual-Population Genetic Algorithm , 2007, Australian Conference on Artificial Intelligence.

[13]  Helen G. Cobb,et al.  An Investigation into the Use of Hypermutation as an Adaptive Operator in Genetic Algorithms Having Continuous, Time-Dependent Nonstationary Environments , 1990 .

[14]  Terence C. Fogarty,et al.  Learning the local search range for genetic optimisation in nonstationary environments , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).