DocumentCode
2324159
Title
Are long jumps of Cauchy mutations effective in fast evolutionary programming?
Author
Liu, Yong
Author_Institution
Sch. of Comput. Sci. & Eng., Univ. of Aizu, Fukushima, Japan
fYear
2010
fDate
18-23 July 2010
Firstpage
1
Lastpage
8
Abstract
It had been discovered that not long jumps but short jumps with large variances among Cauchy mutations had contributed to the better performance of fast evolutionary programming (FEP) than that of classical evolutionary programming (CEP). One strong force to push the effective Cauchy mutations to have the shorter step sizes came from the different behaviors of the the same self-adaptation used in CEP and FEP on optimizing the same test functions from the same initial populations. This paper explored such correlation between the mutation step sizes and self-adaptation, and suggests that it is as necessary to set up an upper bound as to have a lower bound on the strategy parameters in self-adaptation.
Keywords
evolutionary computation; Cauchy mutations; classical evolutionary programming; fast evolutionary programming; long jumps; lower bound; self-adaptation; Benchmark testing; Correlation; Next generation networking; Optimization; Programming; Size measurement; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation (CEC), 2010 IEEE Congress on
Conference_Location
Barcelona
Print_ISBN
978-1-4244-6909-3
Type
conf
DOI
10.1109/CEC.2010.5585944
Filename
5585944
Link To Document