Solving dynamic constrained optimisation problems using repair methods

It has been shown that (i) dynamic constrained optimisation problems (DCOPs), a very common class of problems in real-world applications, have some special characteristics that make them very different from unconstrained dynamic problems and stationary constrained problems and (ii) some existing dynamic optimisation (DO) and constraint handling (CH) algorithms might not work effectively in solving DCOPs. The ineffectiveness of existing algorithms in solving DCOPs, and the lack of algorithms specificaly designed for solving continuous DCOPs create an important gap in current research about DO. In this paper, we propose a set of new mechanisms to effectively handle dynamics in DCOPs and use them to develop new algorithms for solving DCOPs. The goal is to combine the advantages of DO and CH strategies while overcoming the drawbacks of these methods in solving DCOPs. To evaluate the performance of the new algorithms, we compare them against several representative DO and CH algorithms using a set of new performance measures and a set of 18 benchmark problems, which were designed to simulate the characteristics of DCOPs. The test results confirm the advantages of the newly proposed mechanisms and algorithms. Not only do they overcome all existing drawbacks and hence perform significantly better than the tested existing algorithms in solving DCOPs, they also perform equally to or better than these existing DO and CH algorithms in other groups of tested problems except in static problems. In this paper we also (i) carry out detailed analyses of how and why the newly proposed mechanisms/algorithms work better in DCOPs, (ii) investigate the contribution of each of the proposed mechanisms and (iii) study the influence of different parameter values on algorithm performance in solving DCOPs. These analyses reveal some interesting and counter-intuitive findings about the characteristics of DCOPs and the way we can solve DCOPs.

[1]  Hartmut Schmeck,et al.  Designing evolutionary algorithms for dynamic optimization problems , 2003 .

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

[3]  Lawrence Davis,et al.  Shall We Repair? Genetic AlgorithmsCombinatorial Optimizationand Feasibility Constraints , 1993, ICGA.

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

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

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

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

[8]  Ángel Fernando Kuri Morales,et al.  A UNIVERSAL ECLECTIC GENETIC ALGORITHM FOR CONSTRAINED OPTIMIZATION , 2022 .

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

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

[11]  Shengxiang Yang,et al.  Genetic Algorithms with Memory- and Elitism-Based Immigrants in Dynamic Environments , 2008, Evolutionary Computation.

[12]  Shengxiang Yang,et al.  Learning behavior in abstract memory schemes for dynamic optimization problems , 2009, Soft Comput..

[13]  Hendrik Richter Memory Design for Constrained Dynamic Optimization Problems , 2010, EvoApplications.

[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]  Hendrik Richter,et al.  Detecting change in dynamic fitness landscapes , 2009, 2009 IEEE Congress on Evolutionary Computation.

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

[17]  Xin Yao,et al.  Stochastic ranking for constrained evolutionary optimization , 2000, IEEE Trans. Evol. Comput..

[18]  Xin Yao,et al.  Continuous Dynamic Constrained Optimization—The Challenges , 2012, IEEE Transactions on Evolutionary Computation.