Memory enhanced evolutionary algorithms for changing optimization problems

Recently, there has been increased interest in evolutionary computation applied to changing optimization problems. The paper surveys a number of approaches that extend the evolutionary algorithm with implicit or explicit memory, suggests a new benchmark problem and examines under which circumstances a memory may be helpful. From these observations, we derive a new way to explore the benefits of a memory while minimizing its negative side effects.

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

[2]  Conor Ryan,et al.  Polygenic Inheritance - A Haploid Scheme that Can Outperform Diploidy , 1998, PPSN.

[3]  Jing Xiao,et al.  Adding memory to the Evolutionary Planner/Navigator , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

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

[5]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

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

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

[8]  D. Dasgupta.  Incorporating Redundancy and Gene Activation Mechanisms i n Genetic search for adapting to Non-Stationary Environments , 1995 .

[9]  Narayan Raman,et al.  The job shop tardiness problem: A decomposition approach , 1993 .

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

[11]  Christoph F. Eick,et al.  Supporting Polyploidy in Genetic Algorithms Using Dominance Vectors , 1997, Evolutionary Programming.

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

[13]  Sushil J. Louis,et al.  Solving Similar Problems Using Genetic Algorithms and Case-Based Memory , 1997, ICGA.

[14]  David E. Goldberg,et al.  Nonstationary Function Optimization Using Genetic Algorithms with Dominance and Diploidy , 1987, ICGA.

[15]  Dipankar Dasgupta,et al.  Nonstationary Function Optimization using the Structured Genetic Algorithm , 1992, PPSN.

[16]  Hajime Kita,et al.  Adaptation to Changing Environments by Means of the Memory Based Thermodynamical Genetic Algorithm , 1997, ICGA.

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

[18]  S. Louis,et al.  Genetic Algorithms for Open Shop Scheduling and Re-scheduling , 1996 .

[19]  John J. Grefenstette,et al.  Case-Based Initialization of Genetic Algorithms , 1993, ICGA.

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