Learning in Abstract Memory Schemes for Dynamic Optimization

We investigate an abstraction based memory scheme for evolutionary algorithms in dynamic environments. In this scheme, the abstraction of good solutions (i.e., their approximate location in the search space) is stored in the memory instead of good solutions themselves and is employed to improve future problem solving. In particular, this paper shows how learning takes place in the abstract memory scheme and how the performance in problem solving changes over time for different kinds of dynamics in the fitness landscape. The experiments show that the abstract memory enables learning processes and efficiently improves the performance of evolutionary algorithms in dynamic environments.

[1]  Robert Fitch,et al.  Structural Abstraction Experiments in Reinforcement Learning , 2005, Australian Conference on Artificial Intelligence.

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

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

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

[5]  Thomas Bäck,et al.  Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .

[6]  Shengxiang Yang,et al.  A self-organizing random immigrants genetic algorithm for dynamic optimization problems , 2007, Genetic Programming and Evolvable Machines.

[7]  Hendrik Richter,et al.  A study of dynamic severity in chaotic fitness landscapes , 2005, 2005 IEEE Congress on Evolutionary Computation.

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

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

[10]  R.W. Morrison,et al.  Triggered hypermutation revisited , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[11]  Thomas Bäck,et al.  Parallel Problem Solving from Nature — PPSN V , 1998, Lecture Notes in Computer Science.

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

[13]  Peter A. N. Bosman.  Learning and Anticipation in Online Dynamic Optimization , 2007, Evolutionary Computation in Dynamic and Uncertain Environments.