The Memory Indexing Evolutionary Algorithm for Dynamic Environments

There is a growing interest in applying evolutionary algorithms to dynamic environments. Different types of changes in the environment benefit from different types of mechanisms to handle the change. In this study, the mechanisms used in literature are categorized into four groups. A new EA approach (MIA) which benefits from the EDA-like approach it employs for re-initializing populations after a change as well as using different change handling mechanisms together is proposed. Experiments are conducted using the 0/1 single knapsack problem to compare MIA with other algorithms and to explore its performance. Promising results are obtained which promote further study. Current research is being done to extend MIA to other problem domains.

[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]  C. Ryan,et al.  The Degree of Oneness , 2007 .

[3]  Von der Fakult.  Evolutionary Algorithms and Dynamic Optimization Problems , 2003 .

[4]  Pat Langley,et al.  Editorial: On Machine Learning , 1986, Machine Learning.

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

[6]  J. A. Lozano,et al.  Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing) , 2006 .

[7]  Terence C. Fogarty,et al.  Performance of a Genetic Algorithm with Variable Local Search Range Relative to Frequency of the Environmental Changes , 1998 .

[8]  A. Sima Etaner-Uyar,et al.  A NOVEL CHANGE SEVERITY DETECTION MECHANISM FOR THE DYNAMIC 0 / 1 KNAPSACK PROBLEM , 2004 .

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

[10]  Rich Caruana,et al.  Removing the Genetics from the Standard Genetic Algorithm , 1995, ICML.

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

[12]  Jens Gottlieb,et al.  Evolutionary algorithms for constrained optimization problems , 2000, Berichte aus der Informatik.

[13]  Karsten Weicker,et al.  Evolutionary algorithms and dynamic optimization problems , 2003 .

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

[15]  Ronald W. Morrison,et al.  Designing Evolutionary Algorithms for Dynamic Environments , 2004, Natural Computing Series.

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

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

[18]  I. C. Parmee.  Adaptive Computing in Design and Manufacture , 1998 .

[19]  Dan Boneh,et al.  On genetic algorithms , 1995, COLT '95.

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

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

[22]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

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

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