Empirical analysis of evolutionary algorithms with immigrants schemes for dynamic optimization

In recent years, there has been a growing interest in studying evolutionary algorithms (EAs) for dynamic optimization problems (DOPs). Among approaches developed for EAs to deal with DOPs, immigrants schemes have been proven to be beneficial. Immigrants schemes for EAs on DOPs aim at maintaining the diversity of the population throughout the run via introducing new individuals into the current population. In this paper, we carefully examine the mechanism of generating immigrants, which is the most important issue among immigrants schemes for EAs in dynamic environments. We divide existing immigrants schemes into two types, namely the direct immigrants scheme and the indirect immigrants scheme, according to the way in which immigrants are generated. Then experiments are conducted to understand the difference in the behaviors of different types of immigrants schemes and to compare their performance in dynamic environments. Furthermore, a new immigrants scheme is proposed to combine the merits of two types of immigrants schemes. The experimental results show that the interactions between the two types of schemes reveal positive effect in improving the performance of EAs in dynamic environments.

[1]  Gary J. Balas,et al.  Robustness and performance tradeoffs in control design for flexible structures , 1990, 29th IEEE Conference on Decision and Control.

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

[3]  Melanie Mitchell,et al.  The royal road for genetic algorithms: Fitness landscapes and GA performance , 1991 .

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

[5]  Xin Yao,et al.  Materialized view selection as constrained evolutionary optimization , 2003, IEEE Trans. Syst. Man Cybern. Part C.

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

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

[8]  Erica Jen,et al.  Stable or robust? What's the difference? , 2003, Complex..

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

[10]  T. Krink,et al.  Dynamic memory model for non-stationary optimization , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[11]  L. Darrell Whitley,et al.  Fundamental Principles of Deception in Genetic Search , 1990, FOGA.

[12]  Kevin Kok Wai Wong,et al.  Classification of adaptive memetic algorithms: a comparative study , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[13]  Shengxiang Yang,et al.  Genetic Algorithms with Elitism-Based Immigrants for Changing Optimization Problems , 2007, EvoWorkshops.

[14]  Thomas Jansen,et al.  Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Evolutionary Algorithms-How to Cope With Plateaus of Constant Fitness and When to Reject Strings of the Same Fitness , 2001 .

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

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

[17]  Anabela Simões,et al.  Improving memory’s usage in evolutionary algorithms for changing environments , 2007, 2007 IEEE Congress on Evolutionary Computation.

[18]  Septimiu E. Salcudean,et al.  Analysis and evaluation of stability and performance robustness for teleoperation control architectures , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

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

[20]  Terence C. Fogarty,et al.  A Genetic Algorithm with Variable Range of Local Search for Tracking Changing Environments , 1996, 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]  Xin Yao,et al.  An immigrants scheme based on environmental information for genetic algorithms in changing environments , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[23]  W. Cedeno,et al.  On the use of niching for dynamic landscapes , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[24]  G. Stein,et al.  Performance and robustness analysis for structured uncertainty , 1982, 1982 21st IEEE Conference on Decision and Control.

[25]  Jürgen Branke,et al.  Proceedings of the Workshop on Evolutionary Algorithms for Dynamic Optimization Problems (EvoDOP-2003) held in conjunction with the Genetic and Evolutionary Computation Conference (GECCO-2003), 12 July 2003, Chicago, USA [online] , 2003 .

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

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

[28]  Anabela Simões,et al.  An Immune System-Based Genetic Algorithm to Deal with Dynamic Environments: Diversity and Memory , 2003, ICANNGA.

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

[30]  Rasmus K. Ursem,et al.  Multinational GAs: Multimodal Optimization Techniques in Dynamic Environments , 2000, GECCO.

[31]  Marc Schoenauer,et al.  Rigorous Hitting Times for Binary Mutations , 1999, Evolutionary Computation.

[32]  Jürgen Branke,et al.  Waiting Strategies for Dynamic Vehicle Routing , 2005, Transp. Sci..

[33]  Shengxiang Yang,et al.  Genetic algorithms with self-organized criticality for dynamic optimization problems , 2005, 2005 IEEE Congress on Evolutionary Computation.

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

[35]  William Rand,et al.  Measurements for understanding the behavior of the genetic algorithm in dynamic environments: a case study using the Shaky Ladder Hyperplane-Defined Functions , 2005, GECCO '05.

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

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

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

[39]  Shengxiang Yang,et al.  Non-stationary problem optimization using the primal-dual genetic algorithm , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[40]  Juan Julián Merelo Guervós,et al.  Parallel Problem Solving from Nature — PPSN VII , 2002, Lecture Notes in Computer Science.

[41]  Mark Wineberg,et al.  Enhancing the GA's Ability to Cope with Dynamic Environments , 2000, GECCO.

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

[43]  Xin Yao,et al.  A Memetic Algorithm for VLSI Floorplanning , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

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

[45]  Karsten Weicker,et al.  Performance Measures for Dynamic Environments , 2002, PPSN.

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

[47]  S. Adivikolanu,et al.  Extensions and performance/robustness tradeoffs of the EWMA run-to-run controller by using the internal model control structure , 2000 .

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

[49]  Zhang Ren,et al.  A new controller architecture for high performance, robust, and fault-tolerant control , 2001, IEEE Trans. Autom. Control..

[50]  Xin Yao,et al.  Population-Based Incremental Learning With Associative Memory for Dynamic Environments , 2008, IEEE Transactions on Evolutionary Computation.

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

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

[53]  Johnathan Haas A brief consideration of cultural evolution: stages, agents, and tinkering , 1998 .

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

[55]  Shengxiang Yang,et al.  A hybrid immigrants scheme for genetic algorithms in dynamic environments , 2007, Int. J. Autom. Comput..