Population-Based Incremental Learning with Immigrants Schemes in Changing Environments

The population-based incremental learning (PBIL) algorithm is a combination of evolutionary optimization and competitive learning. PBIL has been successfully applied to dynamic optimization problems (DOPs). It is well known that maintaining the population diversity is important for PBIL to adapt well to dynamic changes. However, PBIL faces a serious challenge when applied to DOPs because at early stages of the optimization process the population diversity is decreased significantly. It has been shown that random immigrants can increase the diversity level maintained by PBIL algorithms and enhance their performance on some DOPs. In this paper, we integrate elitism-based and hybrid immigrants into PBIL to address slightly and severely changing DOPs. Based on a series of dynamic test problems, experiments are conducted to investigate the effect of immigrants schemes on the performance of PBIL. The experimental results show that the integration of elitism-based and hybrid immigrants with PBIL always improves the performance when compared with a standard PBIL on different DOPs. Finally, the proposed PBILs are compared with other peer evolutionary algorithms and show competitive performance.

[1]  Shengxiang Yang,et al.  Genetic Algorithms with Memory- and Elitism-Based Immigrants in Dynamic Environments , 2008, Evolutionary Computation.

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

[3]  Shengxiang Yang,et al.  A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems , 2009, Soft Comput..

[4]  Shumeet Baluja,et al.  A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .

[5]  Shengxiang Yang,et al.  Associative Memory Scheme for Genetic Algorithms in Dynamic Environments , 2006, EvoWorkshops.

[6]  Xin Yao,et al.  Empirical analysis of evolutionary algorithms with immigrants schemes for dynamic optimization , 2009, Memetic Comput..

[7]  Anabela Simões,et al.  CHC-Based Algorithms for the Dynamic Traveling Salesman Problem , 2011, EvoApplications.

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

[9]  Jürgen Branke,et al.  Memory enhanced evolutionary algorithms for changing optimization problems , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[10]  Shengxiang Yang,et al.  Ant Colony Optimization with Immigrants Schemes in Dynamic Environments , 2010, PPSN.

[11]  Shengxiang Yang,et al.  Interactive and non-interactive hybrid immigrants schemes for ant algorithms in dynamic environments , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[12]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

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

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

[15]  Shengxiang Yang,et al.  Hyper-learning for population-based incremental learning in dynamic environments , 2009, 2009 IEEE Congress on Evolutionary Computation.

[16]  S. Baluja.  An Empirical Comparison of Seven Iterative and Evolutionary Function Optimization Heuristics , 1995 .

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

[18]  Shengxiang Yang,et al.  Population-based incremental learning with memory scheme for changing environments , 2005, GECCO '05.

[19]  Shengxiang Yang,et al.  Genetic algorithms with adaptive immigrants for dynamic environments , 2013, 2013 IEEE Congress on Evolutionary Computation.

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

[21]  Jürgen Branke,et al.  Evolutionary optimization in uncertain environments-a survey , 2005, IEEE Transactions on Evolutionary Computation.

[22]  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 .

[23]  Rasmus K. Ursem,et al.  Multinational GAs: Multimodal Optimization Techniques in Dynamic Environments , 2000, GECCO.