Solving dynamic optimisation problems by combining evolutionary algorithms with KD-tree

In this paper we propose a novel evolutionary algorithm that is able to adaptively separate the explored and unexplored areas to facilitate detecting changes and tracking the moving optima. The algorithm divides the search space into multiple regions, each covers one basin of attraction in the search space and tracks the corresponding moving optimum. A simple mechanism was used to estimate the basin of attraction for each found optimum, and a special data structure named KD-Tree was used to memorise the searched areas to speed up the search process. Experimental results show that the algorithm is competitive, especially against those that consider change detection an important task in dynamic optimisation. Compared to existing multi-population algorithms, the new algorithm also offers less computational complexity in term of identifying the appropriate sub-population/region for each individual.

[1]  Trung Thanh Nguyen,et al.  Continuous dynamic optimisation using evolutionary algorithms , 2011 .

[2]  Hartmut Schmeck,et al.  Designing evolutionary algorithms for dynamic optimization problems , 2003 .

[3]  Xin Yao,et al.  Continuous Dynamic Constrained Optimization—The Challenges , 2012, IEEE Transactions on Evolutionary Computation.

[4]  Hussein A. Abbass,et al.  Tackling Dynamic Problems with Multiobjective Evolutionary Algorithms , 2008, Multiobjective Problem Solving from Nature.

[5]  Jon Louis Bentley,et al.  Data Structures for Range Searching , 1979, CSUR.

[6]  Dumitru Dumitrescu,et al.  Evolutionary swarm cooperative optimization in dynamic environments , 2009, Natural Computing.

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

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

[9]  Xin Yao,et al.  Hybridizing Cultural Algorithms and Local Search , 2006, Ideal.

[10]  Tim Blackwell,et al.  Particle Swarm Optimization in Dynamic Environments , 2007, Evolutionary Computation in Dynamic and Uncertain Environments.

[11]  Mohammad Reza Meybodi,et al.  A New Particle Swarm Optimization Algorithm for Dynamic Environments , 2010, SEMCCO.

[12]  Xin Yao,et al.  An Experimental Study of Hybridizing Cultural Algorithms and Local Search , 2008, Int. J. Neural Syst..

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

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

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

[16]  Mark Wineberg,et al.  The Shifting Balance Genetic Algorithm: improving the GA in a dynamic environment , 1999 .

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

[18]  Mohammad Reza Meybodi,et al.  CellularDE: A Cellular Based Differential Evolution for Dynamic Optimization Problems , 2011, ICANNGA.

[19]  Bin Li,et al.  Multi-strategy ensemble particle swarm optimization for dynamic optimization , 2008, Inf. Sci..

[20]  Andries Petrus Engelbrecht,et al.  Using Competitive Population Evaluation in a differential evolution algorithm for dynamic environments , 2012, Eur. J. Oper. Res..

[21]  Tim Hendtlass,et al.  A simple and efficient multi-component algorithm for solving dynamic function optimisation problems , 2007, 2007 IEEE Congress on Evolutionary Computation.

[22]  Jürgen Branke,et al.  Evolutionary Optimization in Dynamic Environments , 2001, Genetic Algorithms and Evolutionary Computation.

[23]  Chen Shi-ming Path planning of mobile robot based on improved Particle Swarm Optimization in dynamic environment , 2008 .

[24]  Hendrik Richter,et al.  Detecting change in dynamic fitness landscapes , 2009, 2009 IEEE Congress on Evolutionary Computation.

[25]  Changhe Li,et al.  A General Framework of Multipopulation Methods With Clustering in Undetectable Dynamic Environments , 2012, IEEE Transactions on Evolutionary Computation.

[26]  Shengxiang Yang,et al.  Evolutionary dynamic optimization: A survey of the state of the art , 2012, Swarm Evol. Comput..

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