摘要

Shuffled Complex Evolution (SCE) has been used widely and proved to be a robust and efficient global optimization algorithm. In this paper, an improved Shuffled Complex Evolution is proposed. The new method, by changing the strategy of generating new points, is presented to guarantee the convergence rate, and improve the quality of solution, while avoiding the probability of getting trapped in local solution during the process of optimization. The efficiency of the new method is analyzed in terms of the quality of solution and the generation of evolution, in comparison with the classical Shuffled complex evolution (SCE) algorithm using six benchmark optimization functions. Simulation results indicate that the new method improves the search performance on the six benchmark function.

  • 出版日期2012

全文