A Repair Method for Differential Evolution with Combined Variants to Solve Dynamic Constrained Optimization Problems

Repair methods, which usually require feasible solutions as reference, have been employed by Evolutionary Algorithms to solve constrained optimization problems. In this work, a novel repair method, which does not require feasible solutions as reference and inspired by the differential mutation, is added to an algorithm which uses two variants of differential evolution to solve dynamic constrained optimization problems. The proposed repair method replaces a local search operator with the aim to improve the overall performance of the algorithm in different frequencies of change in the constrained space. The proposed approach is compared against other recently proposed algorithms in an also recently proposed benchmark. The results show that the proposed improved algorithm outperforms its original version and provides a very competitive overall performance with different change frequencies.