A framework for finding robust optimal solutions over time

Dynamic optimization problems (DOPs) are those whose specifications change over time, resulting in changing optima. Most research on DOPs has so far concentrated on tracking the moving optima (TMO) as closely as possible. In practice, however, it will be very costly, if not impossible to keep changing the design when the environment changes. To address DOPs more practically, we recently introduced a conceptually new problem formulation, which is referred to as robust optimization over time (ROOT). Based on ROOT, an optimization algorithm aims to find an acceptable (optimal or sub-optimal) solution that changes slowly over time, rather than the moving global optimum. In this paper, we propose a generic framework for solving DOPs using the ROOT concept, which searches for optimal solutions that are robust over time by means of local fitness approximation and prediction. Empirical investigations comparing a few representative TMO approaches with an instantiation of the proposed framework are conducted on a number of test problems to demonstrate the advantage of the proposed framework in the ROOT context.

[1]  Jürgen Branke,et al.  Creating Robust Solutions by Means of Evolutionary Algorithms , 1998, PPSN.

[2]  X. Yao.  Evolutionary Search of Approximated N-dimensional Landscapes , 2000 .

[3]  Alain Pétrowski,et al.  A clearing procedure as a niching method for genetic algorithms , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

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

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

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

[7]  H. Greiner.  Robust optical coating design with evolutionary strategies. , 1996, Applied optics.

[8]  Bernhard Sendhoff,et al.  A systems approach to evolutionary multiobjective structural optimization and beyond , 2009, IEEE Computational Intelligence Magazine.

[9]  William H. Press,et al.  Numerical Recipes in C The Art of Scientific Computing , 1995 .

[10]  Kenny Q. Ye,et al.  Algorithmic construction of optimal symmetric Latin hypercube designs , 2000 .

[11]  Bernhard Sendhoff,et al.  Trade-Off between Performance and Robustness: An Evolutionary Multiobjective Approach , 2003, EMO.

[12]  Ponnuthurai N. Suganthan,et al.  Evolutionary programming with ensemble of explicit memories for dynamic optimization , 2009, 2009 IEEE Congress on Evolutionary Computation.

[13]  Kalyanmoy Deb,et al.  Reliability-Based Optimization Using Evolutionary Algorithms , 2009, IEEE Transactions on Evolutionary Computation.

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

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

[16]  Chng Eng Siong,et al.  Gradient radial basis function networks for nonlinear and nonstationary time series prediction , 1996, IEEE Trans. Neural Networks.

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

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

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

[20]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

[21]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[22]  Kai-Yew Lum,et al.  Max-min surrogate-assisted evolutionary algorithm for robust design , 2006, IEEE Transactions on Evolutionary Computation.

[23]  Gwilym M. Jenkins,et al.  Time series analysis, forecasting and control , 1971 .

[24]  Yew-Soon Ong,et al.  Memetic Computation—Past, Present & Future [Research Frontier] , 2010, IEEE Computational Intelligence Magazine.

[25]  Changhe Li,et al.  A Clustering Particle Swarm Optimizer for Locating and Tracking Multiple Optima in Dynamic Environments , 2010, IEEE Transactions on Evolutionary Computation.

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

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

[28]  Bu-Sung Lee,et al.  Inverse multi-objective robust evolutionary design optimization in the presence of uncertainty , 2005, GECCO '05.

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

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

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

[32]  Gwilym M. Jenkins,et al.  Time series analysis, forecasting and control , 1972 .

[33]  R. Salomon.  Re-evaluating genetic algorithm performance under coordinate rotation of benchmark functions. A survey of some theoretical and practical aspects of genetic algorithms. , 1996, Bio Systems.

[34]  Thomas Weise,et al.  Global Optimization Algorithms -- Theory and Application , 2009 .

[35]  Janez Brest,et al.  Dynamic optimization using Self-Adaptive Differential Evolution , 2009, 2009 IEEE Congress on Evolutionary Computation.

[36]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[37]  Thomas Bäck,et al.  Robust design of multilayer optical coatings by means of evolutionary algorithms , 1998, IEEE Trans. Evol. Comput..

[38]  Bernhard Sendhoff,et al.  Constructing Dynamic Optimization Test Problems Using the Multi-objective Optimization Concept , 2004, EvoWorkshops.

[39]  Xiaodong Li,et al.  Enhancing the robustness of a speciation-based PSO , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[40]  Tapabrata Ray,et al.  Performance of infeasibility driven evolutionary algorithm (IDEA) on constrained dynamic single objective optimization problems , 2009, 2009 IEEE Congress on Evolutionary Computation.

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

[42]  Hisashi Handa,et al.  Fitness function for finding out robust solutions on time-varying functions , 2006, GECCO '06.

[43]  Hendrik Richter,et al.  Detecting change in dynamic fitness landscapes , 2009, 2009 IEEE Congress on Evolutionary Computation.

[44]  Shang-Liang Chen,et al.  Orthogonal least squares learning algorithm for radial basis function networks , 1991, IEEE Trans. Neural Networks.

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

[46]  Yaochu Jin,et al.  Surrogate-assisted evolutionary computation: Recent advances and future challenges , 2011, Swarm Evol. Comput..

[47]  Xin Yao,et al.  Benchmark Generator for CEC'2009 Competition on Dynamic Optimization , 2008 .

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

[49]  Bu-Sung Lee,et al.  Inverse multi-objective robust evolutionary design , 2006, Genetic Programming and Evolvable Machines.

[50]  Bernhard Sendhoff,et al.  Evolution by Adapting Surrogates , 2013, Evolutionary Computation.

[51]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.

[52]  Bernhard Sendhoff,et al.  Fitness Approximation In Evolutionary Computation - a Survey , 2002, GECCO.

[53]  Bernhard Sendhoff,et al.  A Unified Framework for Symbiosis of Evolutionary Mechanisms with Application to Water Clusters Potential Model Design , 2012, IEEE Computational Intelligence Magazine.

[54]  Ravi Sankar,et al.  Time Series Prediction Using Support Vector Machines: A Survey , 2009, IEEE Computational Intelligence Magazine.

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

[56]  J. Branke.  Reducing the sampling variance when searching for robust solutions , 2001 .

[57]  Timothy M. Mauery,et al.  COMPARISON OF RESPONSE SURFACE AND KRIGING MODELS FOR MULTIDISCIPLINARY DESIGN OPTIMIZATION , 1998 .

[58]  Rolf Drechsler,et al.  Applications of Evolutionary Computing, EvoWorkshops 2008: EvoCOMNET, EvoFIN, EvoHOT, EvoIASP, EvoMUSART, EvoNUM, EvoSTOC, and EvoTransLog, Naples, Italy, March 26-28, 2008. Proceedings , 2008, EvoWorkshops.

[59]  Christoph F. Eick,et al.  Supporting Polyploidy in Genetic Algorithms Using Dominance Vectors , 1997, Evolutionary Programming.

[60]  Christine A. Shoemaker,et al.  Local function approximation in evolutionary algorithms for the optimization of costly functions , 2004, IEEE Transactions on Evolutionary Computation.

[61]  S. Ranji Ranjithan,et al.  Chance-constrained genetic algorithms , 1999 .

[62]  Xiaodong Li,et al.  Using regression to improve local convergence , 2007, 2007 IEEE Congress on Evolutionary Computation.

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

[64]  Kay Chen Tan,et al.  A Multi-Facet Survey on Memetic Computation , 2011, IEEE Transactions on Evolutionary Computation.

[65]  Yaochu Jin,et al.  A comprehensive survey of fitness approximation in evolutionary computation , 2005, Soft Comput..

[66]  Russell C. Eberhart,et al.  Adaptive particle swarm optimization: detection and response to dynamic systems , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[67]  Bernhard Sendhoff,et al.  Lamarckian memetic algorithms: local optimum and connectivity structure analysis , 2009, Memetic Comput..

[68]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[69]  Gene H. Golub,et al.  Matrix computations , 1983 .

[70]  Shengxiang Yang,et al.  Explicit Memory Schemes for Evolutionary Algorithms in Dynamic Environments , 2007, Evolutionary Computation in Dynamic and Uncertain Environments.