Differential evolution using historical knowledge

Differential evolution (DE) is a simple but efficient algorithm for the global optimization over continuous spaces. However, the problem of premature convergence still exists. When trapped in evolution stagnation, DE usually requires much time to jump over. In this paper, the algorithm of DE/rand/1/bin is improved by making use of the historical knowledge. An auxiliary population (AP) is used as a warehouse for storing the information of candidate solutions. This scheme enables AP as a resource, which can maintain the population diversity without computation consumed. A new operator with the extended search direction (ESD) is presented to prevent the premature convergence by use of the historical knowledge of candidate solutions. The proposed strategy attempts to balance the exploration and exploitation abilities of DE. The comparison shows that the improved DE algorithm performs better than DE/rand/1/bin and PSO.

[1]  Kwok-Wo Wong,et al.  A novel particle swarm optimizer with time-delay , 2007, Appl. Math. Comput..

[2]  Ji-Pyng Chiou,et al.  Ant direction hybrid differential evolution for solving large capacitor placement problems , 2004 .

[3]  Qing Ling,et al.  A Differential Evolution with Simulated Annealing Updating Method , 2006, 2006 International Conference on Machine Learning and Cybernetics.

[4]  Amit Konar,et al.  Differential Evolution with Local Neighborhood , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[5]  M. M. Ali,et al.  Differential evolution with preferential crossover , 2007, Eur. J. Oper. Res..

[6]  Xiao-Feng Wang,et al.  Neural network-based shape recognition using generalized differential evolution training algorithm , 2005, Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005..

[7]  A. Kai Qin,et al.  Self-adaptive differential evolution algorithm for numerical optimization , 2005, 2005 IEEE Congress on Evolutionary Computation.

[8]  Nurhan Karaboga,et al.  Digital IIR Filter Design Using Differential Evolution Algorithm , 2005, EURASIP J. Adv. Signal Process..

[9]  Ivan Zelinka,et al.  ON STAGNATION OF THE DIFFERENTIAL EVOLUTION ALGORITHM , 2000 .

[10]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[11]  Jouni Lampinen,et al.  A Fuzzy Adaptive Differential Evolution Algorithm , 2005, Soft Comput..

[12]  Mehmet Fatih Tasgetiren,et al.  A Multi-Populated Differential Evolution Algorithm for Solving Constrained Optimization Problem , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[13]  Saku Kukkonen,et al.  Real-parameter optimization with differential evolution , 2005, 2005 IEEE Congress on Evolutionary Computation.

[14]  Cliff T. Ragsdale,et al.  Modified differential evolution: a greedy random strategy for genetic recombination , 2005 .

[15]  René Thomsen,et al.  A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).