Performance evaluation of sensor-based detection schemes on dynamic optimization problems

Most of the real world optimization problems in different domains demonstrate dynamic behavior, which can be in the form of changes in the objective function, problem parameters and/or constraints for different time periods. Detecting the points in time where a change occurs in the landscape is a critical issue for a large number of evolutionary dynamic optimization techniques in the literature. In this paper, we present an empirical study whose focus is the performance evaluation of various sensor-based detection schemes by using two well known dynamic optimization problems, which are moving peaks benchmark (MPB) and dynamic knapsack problem (DKP). Our experimental evaluation by using two dynamic optimization problem validates the sensor-based detection schemes considered, where the effectiveness of each scheme is measured with the average rate of correctly identified changes and the average number of sensors invoked to detect a change.

[1]  Raphael T. Haftka,et al.  Surrogate Model-Based Optimization Framework: A Case Study in Aerospace Design , 2007, Evolutionary Computation in Dynamic and Uncertain Environments.

[2]  Haluk Topcuoglu,et al.  A comparative study of evolutionary optimization techniques in dynamic environments , 2006, GECCO '06.

[3]  Shengxiang Yang,et al.  Evolutionary Computation for Dynamic Optimization Problems , 2015, GECCO.

[4]  Terence C. Fogarty,et al.  Adaptive Combustion Balancing in Multiple Burner Boiler Using a Genetic Algorithm with Variable Range of Local Search , 1997, ICGA.

[5]  A. Sima Etaner-Uyar,et al.  Selection hyper-heuristics in dynamic environments , 2013, J. Oper. Res. Soc..

[6]  Jürgen Branke,et al.  Multiswarms, exclusion, and anti-convergence in dynamic environments , 2006, IEEE Transactions on Evolutionary Computation.

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

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

[9]  John J. Grefenstette,et al.  Genetic Algorithms for Changing Environments , 1992, PPSN.

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

[11]  Martin Middendorf,et al.  A hierarchical particle swarm optimizer for noisy and dynamic environments , 2006, Genetic Programming and Evolvable Machines.

[12]  Zbigniew Michalewicz,et al.  Adaptive Business Intelligence: Three Case Studies , 2007, Evolutionary Computation in Dynamic and Uncertain Environments.

[13]  Carlos Cruz,et al.  Optimization in dynamic environments: a survey on problems, methods and measures , 2011, Soft Comput..

[14]  Shengxiang Yang,et al.  Memory-based immigrants for genetic algorithms in dynamic environments , 2005, GECCO '05.

[15]  Shengxiang Yang,et al.  A self-organizing random immigrants genetic algorithm for dynamic optimization problems , 2007, Genetic Programming and Evolvable Machines.

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

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

[18]  A. Sima Etaner-Uyar,et al.  Towards an analysis of dynamic environments , 2005, GECCO '05.

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

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

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

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

[23]  Hui Cheng,et al.  IMMIGRANTS-ENHANCED MULTI-POPULATION GENETIC ALGORITHMS FOR DYNAMIC SHORTEST PATH ROUTING PROBLEMS IN MOBILE AD HOC NETWORKS , 2012, Appl. Artif. Intell..

[24]  John J. Grefenstette,et al.  Genetic Algorithms for Tracking Changing Environments , 1993, ICGA.

[25]  Stefan Droste,et al.  Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Analysis of the (1+1) Ea for a Dynamically Bitwise Changing Onemax Analysis of the (1+1) Ea for a Dynamically Bitwise Changing Onemax , 2003 .

[26]  Michel Gendreau,et al.  A review of dynamic vehicle routing problems , 2013, Eur. J. Oper. Res..