Dynamic evolutionary algorithm with variable relocation vectors

Many real-world optimization problems have to be performed under the presence of various uncertainties. A significant number of these uncertainty problems fall into the dynamic optimization category. For this class of problems, an evolutionary algorithm is expected to perform well under different levels and frequencies of change in the landscape. In addition, the dynamic evolutionary algorithm should warrant an acceptable performance improvement to justify the additional computational cost. Effective reuse of previous evolutionary information is a must as it facilitates a faster convergence after a change has occurred. This paper introduces a new dynamic evolutionary algorithm that uses variable relocation vectors to adapt already converged or currently evolving individuals to the new environmental condition. The proposed algorithm relocates those individuals based on their change in functional value due to the change in the environment and the average sensitivities of their decision variables to the corresponding change in the objective space. The relocated population is shown to be better fit to the new environment than the original or any other randomly generated population. The algorithm has been tested for several dynamic benchmark problems and has shown better results.

[1]  Adnan Acan,et al.  Ants can play prisoner's dilemma , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[2]  Terence C. Fogarty,et al.  A Genetic Algorithm with Variable Range of Local Search for Tracking Changing Environments , 1996, PPSN.

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

[4]  Hajime Kita,et al.  Adaptation to a Changing Environment by Means of the Thermodynamical Genetic Algorithm , 1999 .

[5]  Peter J. Angeline,et al.  Tracking Extrema in Dynamic Environments , 1997, Evolutionary Programming.

[6]  Shengxiang Yang,et al.  Constructing dynamic test environments for genetic algorithms based on problem difficulty , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

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

[8]  Shengxiang Yang,et al.  Evolutionary Computation in Dynamic and Uncertain Environments , 2007, Studies in Computational Intelligence.

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

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

[11]  Hajime Kita,et al.  Adaptation to a Changing Environment by Means of the Feedback Thermodynamical Genetic Algorithm , 1996, PPSN.

[12]  Kalmanje Krishnakumar,et al.  Micro-Genetic Algorithms For Stationary And Non-Stationary Function Optimization , 1990, Other Conferences.

[13]  Zbigniew Michalewicz,et al.  Searching for optima in non-stationary environments , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[14]  Takahiro Sasaki,et al.  Adaptation under Changing Environments with Various Rates of Inheritance of Acquired Characters: Comparison between Darwinian and Lamarckian Evolution , 1998, SEAL.

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

[16]  John J. Grefenstette,et al.  Evolvability in dynamic fitness landscapes: a genetic algorithm approach , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[17]  S. Tsutsui,et al.  Function optimization in nonstationary environment using steady state genetic algorithms with aging of individuals , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[18]  Karsten Weicker,et al.  Dynamic rotation and partial visibility , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

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

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

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

[22]  Bernhard Sendhoff,et al.  Comparing neural networks and Kriging for fitness approximation in evolutionary optimization , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[23]  T. Back,et al.  On the behavior of evolutionary algorithms in dynamic environments , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[24]  Bernhard Sendhoff,et al.  Neural Networks for Fitness Approximation in Evolutionary Optimization , 2005 .

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