Robust optimization over time — A new perspective on dynamic optimization problems

Dynamic optimization problems (DOPs) are those whose specifications change over time during the optimization, resulting in continuously moving optima. Most research work on DOPs is based on the assumption that the goal of addressing DOPs is to track the moving optima. In this paper, we first point out the practical limitations on tracking the moving optima. We then propose to find optimal solutions that are robust over time as an alternative goal, which leads to a new concept of robust optimization over time (ROOT) problem. In order to investigate the properties of ROOT in more depth, we study the new characteristics of ROOT and investigate its similarities to and differences from the traditional robust optimization problem, which hereafter is referred to as robust optimization for short. To facilitate future research on ROOT, we suggest a ROOT benchmark problem by modifying the moving peaks test problem. Several performance measures for comparing algorithms for solving ROOT problems are proposed.

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

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

[3]  I. Elishakoff,et al.  Antioptimization of structures with large uncertain-but-non-random parameters via interval analysis , 1998 .

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

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

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

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

[8]  Xin Yao,et al.  The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation , 2009, EvoWorkshops.

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

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

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

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

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

[14]  Shigeyoshi Tsutsui,et al.  A Robust Solution Searching Scheme in Genetic Search , 1996, PPSN.

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

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

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

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

[19]  Ming Yang,et al.  A New Approach to Solving Dynamic Traveling Salesman Problems , 2006, SEAL.

[20]  S. Mcwilliam.  Anti-optimisation of uncertain structures using interval analysis , 2001 .

[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]  Bernhard Sendhoff,et al.  On the Behavior of (μ/μ1, λ)-ES Optimizing Functions Disturbed by Generalized Noise , 2002, FOGA.

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

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

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

[26]  Zbigniew Michalewicz,et al.  Analysis and modeling of control tasks in dynamic systems , 2002, IEEE Trans. Evol. Comput..

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