A differential evolution with simulated annealing updating method

In this paper, we point out that conventional differential evolution (CDE) algorithm runs the risk of being trapped by local optima because of its greedy updating strategy and intrinsic differential property. A novel simulated annealing differential evolution (SADE) algorithm is proposed to improve the premature property of CDE. With the aid of simulated annealing updating strategy, BADE is able to escape from the local optima, and achieve the balance between exploration and exploitation. Optimization results on standard test suits indicate that SADE outperforms CDE in the global search ability.