On the Analysis of Evolutionary Programming with Self-adaptive Cauchy Operation  

作　　者：LIANG Xiao YUE Lihua XIONG Yan CHENG Wenjuan LIU Shichen 

机构地区：[1]School of Computer Science and Technology, University of Science and Technology of China. Hefei 230027, China [2]School of Computer and Information, Hefei University of Technology, Hefei 230009, China

出　　处：《Chinese Journal of Electronics》2012年第2期309-312,共4页电子学报（英文版）

基　　金：＊Manuscript Received Apr. 2010; Accepted Dec. 2010. This work is supported by the National Natural Science Foundation of China （No.90818007） and the National High Technology Research and Development Program of China （863 Program） （No.2009AA01Z203）.

摘　　要：In this paper, a novel evolutionary pro- gramming with self-adaptive Cauchy mutation ACEP is proposed to solve the numerical optimization problems. ACEP utilizes the self-adaptive parameter r of Cauchy mu- tation to alter the search step size in time, and it obtains the best solution with only half population size of Fast evo- lutionary programming （FEP）. The empirical experiments on four benchmark functions are undertaken. In the typi- cal unimodal functions ACEP performs much better than FEP on the convergence rate and the best solutions. While in the multimodal functions with many local minima, the accuracy of the best value in ACEP improves at least 50 percent than FEP on average statistic.

关 键 词：Self-adaptive Cauchy evolutionary pro-gramming Cauchy mutation Numerical optimization Fast evolutionary programming. 

分 类 号：O242.23[理学—计算数学] TP273.2[理学—数学]