Using Linear Regression to Predict Changes in Evolutionary Algorithms dealing with Dynamic Environments

Many real-word problems change over time and usually, the moment when next change will happen is unknown. Evolutionary Algorithms have been widely used to deal with changing environments and the algorithm is constantly monitoring for alterations and just after detecting one some action is taken. Nevertheless, some of the studied environments are characterized by the periodicity of the change. In these cases it is possible to predict when the next change will occur and start using some mechanisms before the change take place. In this report we carried out an investigation in cyclic changing environments with periodic changes, using linear regression to predict when next change will occur. Based on the predicted value, the algorithm starts preparing the population for the near change. This idea is tested in a memory-based EA using a population and memory of variable sizes previously studied with considerable success. We assume that the predicted moment can have a small error. Before the change occurs two different actions can be taken in order to avoid the decrease of the algorithm"s performance under the new conditions. The results show that prediction is useful for cyclic environments when the period between changes is small and when more different states can appear in the environment.

[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]  Katja Verbeeck,et al.  A “Futurist” approach to dynamic environments , 2000 .

[3]  B. Bainbridge,et al.  Genetics , 1981, Experientia.

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

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

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

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

[8]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[9]  Shengxiang Yang,et al.  Memory-based immigrants for genetic algorithms in dynamic environments , 2005, GECCO '05.

[10]  Peter A. N. Bosman,et al.  Computationally Intelligent Online Dynamic Vehicle Routing by Explicit Load Prediction in an Evolutionary Algorithm , 2006, PPSN.

[11]  H. J. Arnold.  Introduction to the Practice of Statistics , 1990 .

[12]  Anabela Simões,et al.  Variable-Size Memory Evolutionary Algorithm to Deal with Dynamic Environments , 2009, EvoWorkshops.

[13]  Peter A. N. Bosman,et al.  Learning, anticipation and time-deception in evolutionary online dynamic optimization , 2005, GECCO '05.

[14]  Xin Yao,et al.  Experimental study on population-based incremental learning algorithms for dynamic optimization problems , 2005, Soft Comput..

[15]  Phillip D. Stroud,et al.  Kalman-extended genetic algorithm for search in nonstationary environments with noisy fitness evaluations , 2001, IEEE Trans. Evol. Comput..

[16]  Inman Harvey,et al.  The Microbial Genetic Algorithm , 2009, ECAL.

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

[18]  David W. Pearson,et al.  An Immune System-Based Genetic Algorithm to Deal with Dynamic Environments: Diversity and Memory , 2003, ICANNGA.

[19]  Anabela Simões,et al.  Improving Memory-based Evolutionary Algorithms in Changing Environments , 2007 .

[20]  Peter Secretan.  Learning , 1965, Mental Health.