Finding Robust Solutions to Dynamic Optimization Problems

Most research in evolutionary dynamic optimization is based on the assumption that the primary goal in solving Dynamic Optimization Problems (DOPs) is Tracking Moving Optimum (TMO). Yet, TMO is impractical in cases where keeping changing solutions in use is impossible. To solve DOPs more practically, a new formulation of DOPs was proposed recently, which is referred to as Robust Optimization Over Time (ROOT). In ROOT, the aim is to find solutions whose fitnesses are robust to future environmental changes. In this paper, we point out the inappropriateness of existing robustness definitions used in ROOT, and therefore propose two improved versions, namely survival time and average fitness. Two corresponding metrics are also developed, based on which survival time and average fitness are optimized respectively using population-based algorithms. Experimental results on benchmark problems demonstrate the advantages of our metrics over existing ones on robustness definitions survival time and average fitness.

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

[2]  Xin Yao,et al.  A framework for finding robust optimal solutions over time , 2013, Memetic Comput..

[3]  Shengxiang Yang,et al.  Evolutionary dynamic optimization: A survey of the state of the art , 2012, Swarm Evol. Comput..

[4]  Xiaodong Li,et al.  Particle Swarms for Dynamic Optimization Problems , 2008, Swarm Intelligence.

[5]  Bernhard Sendhoff,et al.  Robust Optimization - A Comprehensive Survey , 2007 .

[6]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

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

[8]  Xin Yao,et al.  Characterizing environmental changes in Robust Optimization Over Time , 2012, 2012 IEEE Congress on Evolutionary Computation.

[9]  Changhe Li,et al.  A General Framework of Multipopulation Methods With Clustering in Undetectable Dynamic Environments , 2012, IEEE Transactions on Evolutionary Computation.

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

[11]  Xin Yao,et al.  Dynamic combinatorial optimisation problems: an analysis of the subset sum problem , 2011, Soft Comput..

[12]  Anabela Simões,et al.  Prediction in evolutionary algorithms for dynamic environments using markov chains and nonlinear regression , 2009, GECCO.

[13]  Shengxiang Yang,et al.  Evolutionary Computation in Dynamic and Uncertain Environments , 2007, Studies in Computational Intelligence.

[14]  Jürgen Branke,et al.  Efficient search for robust solutions by means of evolutionary algorithms and fitness approximation , 2006, IEEE Transactions on Evolutionary Computation.