Some improvement to the mutation donor of differential evolution

摘要

Purpose - The purpose of this paper is to improve the existing differential evolution (DE) mutation operator so as to accelerate its convergence.rnDesign/methodology/approach - A new general donor form for mutation operation in DE is presented, which defines a donor as a convex combination of the triplet of individuals selected for a mutation. Three new donor schemes from that form are deduced.rnFindings - The three donor schemes were empirically compared with the original DE version and three existing variants of DE by using a suite of nine well-known test functions, and were also demonstrated by a practical application case - training a neural network to approximate aerodynamic data. The obtained numerical simulation results suggested that these modifications to the mutation operator could improve the DE's convergence performance in both the convergence rate and the convergence reliability.rnResearch limitations/implications - Further research is still needed for adequately explaining why it was possible to simultaneously improve both the convergence rate and the convergence reliability of DE to that extent despite the well-known "No Free Lunch" theorem. Also further research is considered necessary for outlining more distinctively the particular class of problems, where the current observations can be generalized.rnPractical implications - More complicated engineering problems could be solved sub-optimally, whereas their real optimal solution may never be reached subject to the current computer capability. Originality/value - Though DE has demonstrated a considerably better convergence performance than the other evolutionary algorithms (Eas), its convergence rate is still far from what is hoped for by scientists. On the one hand, a higher convergence rate is always expected for any optimization method used in seeking the global optimum of a non-linear objective function. On the other hand, since all Eas, including DE, work with a population of solutions rather than a single solution, many evaluations of candidate solutions are required in the optimization process. If evaluation of candidate solutions is too time-consuming, the overall optimization cost may become too expensive. One often has to limit the algorithm to operate within an acceptable time, which maybe is not enough to find the global optimum (optima), but enough to obtain a sub-optimal solution. Therefore, it is continuously necessary to investigate the new strategies to improve the current DE algorithm.