Benchmark Generator for the IEEE WCCI-2014 Competition on Evolutionary Computation for Dynamic Optimization Problems: Dynamic Rotation Peak Benchmark Generator (DRPBG) and Dynamic Composition Benchmark Generator (DCBG)

Many realworld optimization problems are dynamic optimization problems (DOPs), where changes may occur over time regarding the objective function, decision variable, and constraints, etc. DOPs raise big challenges to traditional optimization methods as well as evolutionary algorithms (EAs). The last decade has witnessed increasing research efforts on handling dynamic optimization problems using EAs and other metaheuristics, and a variety of methods have been reported across a broad range of application backgrounds. In order to study the performance of EAs in dynamic environments, one important task is to develop proper dynamic benchmark problems. Over the years, researchers have applied a number of dynamic test problems to compare the performance of EAs in dynamic environments, e.g., the “moving peaks” benchmark (MPB) proposed by Branke [1], the DF1 generator introduced by Morrison and De Jong [7], the singleand multi-objective dynamic test problem generator by dynamically combining different objective functions of exiting stationary multi-objective benchmark problems suggested by Jin and Sendhoff [2], Yang and Yao’s exclusive-or (XOR) operator [11, 12, 13], Kang’s dynamic traveling salesman problem (DTSP) [3] and dynamic multi knapsack problem (DKP), etc. Although a number of DOP generators exist in the literature, there is no unified approach of constructing dynamic problems across the binary space, real space and combinatorial space so far. This report uses the generalized dynamic benchmark generator (GDBG) proposed in [4], which construct dynamic environments for all the three solution spaces. Especially, in the real space, we introduce a rotation method instead of shifting the positions of peaks as in the MPB and DF1 generators. The rotation method can overcome the problem of unequal challenge per change for algorithms of the MPB generator, which happens when the peak positions bounce back from the boundary of the landscape. Based on our previous benchmark generator for the IEEE CEC’12 Competition on Dynamic Optimization [5], this report updates the two benchmark instances where two new features have

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

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

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

[4]  Bernhard Sendhoff,et al.  Evolutionary Computation Benchmarking Repository , 2006 .

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

[6]  Jing J. Liang,et al.  Novel composition test functions for numerical global optimization , 2005, Proceedings 2005 IEEE Swarm Intelligence Symposium, 2005. SIS 2005..

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

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

[9]  Jing J. Liang,et al.  Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization , 2005 .

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

[11]  Changhe Li,et al.  A Generalized Approach to Construct Benchmark Problems for Dynamic Optimization , 2008, SEAL.

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