Hybrid Differential Evolution with Convex Mutation
Differential Evolution (DE) is a simple yet powerful evolutionary algorithm for global numerical optimization. In this paper, the authors propose a novel hybrid DE variant to accelerate the convergence rate of the classical DE algorithm. The proposed algorithm is hybridized with a convex mutation. The convex mutation is able to utilize the information of the parents, and hence, provides faster convergence speed. Their proposal is referred to as Convex-DE. In order to verify their expectation, they test their approach on 13 widely used benchmark functions. The results indicate that their approach is better than the classical DE algorithm in terms of the convergence speed and the quality of final solution.