Ensemble Differential Evolution with dynamic subpopulations and adaptive clearing for solving dynamic optimization problems

Many real-life optimization problems are dynamic in time, demanding optimization algorithms to perform search for the best solutions in a time-varying problem space. Among population-based Evolutionary Algorithms (EAs), Differential Evolution (DE) is a simple but highly effective method that has been successfully applied to a wide variety of problems. We propose a technique to solve dynamic optimization problems (DOPs) using a multi-population version of DE that incorporates an ensemble of adaptive mutation strategies with a greedy tournament global search method, as well as keeps track of past good solutions in an archive with adaptive clearing to enhance population diversity.

[1]  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).

[2]  Ponnuthurai N. Suganthan,et al.  An Adaptive Differential Evolution Algorithm With Novel Mutation and Crossover Strategies for Global Numerical Optimization , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[3]  Mehmet Fatih Tasgetiren,et al.  Differential evolution algorithm with ensemble of parameters and mutation strategies , 2011, Appl. Soft Comput..

[4]  Jürgen Branke,et al.  Multiswarms, exclusion, and anti-convergence in dynamic environments , 2006, IEEE Transactions on Evolutionary Computation.

[5]  R.W. Morrison,et al.  A test problem generator for non-stationary environments , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[6]  Ponnuthurai N. Suganthan,et al.  Differential Evolution Algorithm with Ensemble of Parameters and Mutation and Crossover Strategies , 2010, SEMCCO.

[7]  Shengxiang Yang,et al.  Particle Swarm Optimization With Composite Particles in Dynamic Environments , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[8]  P. N. Suganthan,et al.  Differential Evolution: A Survey of the State-of-the-Art , 2011, IEEE Transactions on Evolutionary Computation.

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

[10]  Andries Petrus Engelbrecht,et al.  Improved differential evolution for dynamic optimization problems , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[11]  Ponnuthurai N. Suganthan,et al.  Evolutionary programming with ensemble of explicit memories for dynamic optimization , 2009, 2009 IEEE Congress on Evolutionary Computation.

[12]  Xiaodong Li,et al.  This article has been accepted for inclusion in a future issue. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 1 Locating and Tracking Multiple Dynamic Optima by a Particle Swarm Model Using Speciation , 2022 .

[13]  Arvind S. Mohais,et al.  DynDE: a differential evolution for dynamic optimization problems , 2005, 2005 IEEE Congress on Evolutionary Computation.

[14]  Changhe Li,et al.  A Clustering Particle Swarm Optimizer for Locating and Tracking Multiple Optima in Dynamic Environments , 2010, IEEE Transactions on Evolutionary Computation.

[15]  Zbigniew Michalewicz,et al.  Parameter control in evolutionary algorithms , 1999, IEEE Trans. Evol. Comput..

[16]  P. N. Suganthan,et al.  Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization , 2009, IEEE Transactions on Evolutionary Computation.

[17]  Janez Brest,et al.  Dynamic optimization using Self-Adaptive Differential Evolution , 2009, 2009 IEEE Congress on Evolutionary Computation.

[18]  Xin Yao,et al.  Benchmark Generator for CEC'2009 Competition on Dynamic Optimization , 2008 .