Multi-strategy Mutation Constrained Differential Evolution Algorithm Based on Replacement and Restart Mechanism

In order to balance relationships between objective functions and constraints, this paper proposes a multi-strategy mutation constrained differential evolution algorithm based on the replacement and restart mechanism (MCODE). Due to the feasible rule as the constraint processing technology, MCODE utilizes multi-strategy mutation to balance the relationship between the constraints and the objective functions. Moreover, MCODE employs the replacement and restart mechanism to improve the diversity for jumping out of the local solution of the infeasible area. The comparison with the other four constrained optimization methods on the 18 CEC2010 test functions shows that MCODE achieves a relatively competitive result.