Characterizing environmental changes in Robust Optimization Over Time

Evolutionary dynamic optimization has been drawing more and more research attention, and yet most work in this area is focused on Tracking Moving Optimum (TMO), which is to optimize the current fitness function at any time point. Recently, we proposed a more practical way to solve dynamic optimization problems, which is referred to as Robust Optimization Over Time (ROOT). In ROOT, we are trying to find solutions whose performances are acceptable over more than one environmental state, i.e., fitness functions. Before any development of benchmarks or algorithms for ROOT, it is necessary to have some understanding of what aspects of an environment can change and more importantly how these changes influence the solving of ROOT problems. In this paper, we develop a number of measures which can be used to characterize and analyse the underlying changing environment in the framework of ROOT. We test these measures on several benchmark problem instances, and it is shown that these measures are able to differentiate different dynamics effectively and provide useful information about what kind of algorithms might or might not suit certain dynamic environments.

[1]  Xiaodong Li,et al.  This article has been accepted for inclusion in a future issue. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 1 Locating and Tracking Multiple Dynamic Optima by a Particle Swarm Model Using Speciation , 2022 .

[2]  A. Sima Etaner-Uyar,et al.  Towards an analysis of dynamic environments , 2005, GECCO '05.

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

[4]  Xin Yao,et al.  Fitness-Probability Cloud and a Measure of Problem Hardness for Evolutionary Algorithms , 2011, EvoCOP.

[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]  Jürgen Branke,et al.  Evolutionary Optimization in Dynamic Environments , 2001, Genetic Algorithms and Evolutionary Computation.

[7]  Xin Yao,et al.  Empirical analysis of evolutionary algorithms with immigrants schemes for dynamic optimization , 2009, Memetic Comput..

[8]  Karsten Weicker,et al.  An Analysis of Dynamic Severity and Population Size , 2000, PPSN.

[9]  J. Rowe,et al.  Cyclic attractors and quasispecies adaptability , 2001 .

[10]  Kenneth A. De Jong,et al.  Evolving in a Changing World , 1999, ISMIS.

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

[12]  Xin Yao,et al.  Benchmarking and solving dynamic constrained problems , 2009, 2009 IEEE Congress on Evolutionary Computation.

[13]  Xin Yao,et al.  Robust optimization over time — A new perspective on dynamic optimization problems , 2010, IEEE Congress on Evolutionary Computation.

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