A Benchmark Generator for Dynamic Permutation-Encoded Problems

Several general benchmark generators (BGs) are available for the dynamic continuous optimization domain, in which generators use functions with adjustable parameters to simulate shifting landscapes. In the combinatorial domain the work is still on early stages. Many attempts of dynamic BGs are limited to the range of algorithms and combinatorial optimization problems (COPs) they are compatible with, and usually the optimum is not known during the dynamic changes of the environment. In this paper, we propose a BG that can address the aforementioned limitations of existing BGs. The proposed generator allows full control over some important aspects of the dynamics, in which several test environments with different properties can be generated where the optimum is known, without re-optimization.

[1]  William Rand,et al.  Measurements for understanding the behavior of the genetic algorithm in dynamic environments: a case study using the Shaky Ladder Hyperplane-Defined Functions , 2005, GECCO '05.

[2]  Shengxiang Yang,et al.  Memory-Based Immigrants for Ant Colony Optimization in Changing Environments , 2011, EvoApplications.

[3]  Juan Julián Merelo Guervós,et al.  Parallel Problem Solving from Nature — PPSN VII , 2002, Lecture Notes in Computer Science.

[4]  Xin Yao,et al.  A Memetic Algorithm for Periodic Capacitated Arc Routing Problem , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[5]  Paul H. Calamai,et al.  Generalized benchmark generation for dynamic combinatorial problems , 2005, GECCO '05.

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

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

[8]  Xin Yao,et al.  Dynamic Time-Linkage Problems Revisited , 2009, EvoWorkshops.

[9]  Thomas Stützle,et al.  Ant Colony Optimization Theory , 2004 .

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

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

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

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

[14]  Charles E. Taylor.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. Complex Adaptive Systems.John H. Holland , 1994 .

[15]  Karsten Weicker,et al.  Performance Measures for Dynamic Environments , 2002, PPSN.

[16]  Michael Guntsch,et al.  Applying Population Based ACO to Dynamic Optimization Problems , 2002, Ant Algorithms.

[17]  Patrick Prosser,et al.  Dynamic VRPs: A Study of Scenarios , 1998 .

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