Name
Abstract | ||
|---|---|---|
It has been taken for granted that long jumps of Cauchy mutation in a fast evolutionary programming (FEP) increase the probability of finding a near-optimum when the distance between the current search point and the optimum is large, but decrease the probability when such distance is small [1]. By explicitly measuring the search step sizes, this paper gives sound evidence that not long jumps but large variances in Cauchy mutation have contributed to the better performance of FEP than that of classical evolutionary programming (CEP). It has been discovered that smaller step-size mutations among Cauchy mutations had led to the faster convergence of FEP in some test functions, while these helpful Cauchy mutations could actually have shorter search step sizes than Gaussian mutations used in CEP. The reason that Cauchy mutations could have shorter step sizes than Gaussian mutations is that Cauchy mutations and Gaussian mutations could radically alter self-adaptation in FEP and CEP. This paper further discusses the correlation between mutations and self-adaptation in CEP and FEP. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-92137-0_7 | ISICA |
Keywords | Field | DocType |
shorter step size,classical evolutionary programming,cauchy mutation,search step size,fast evolutionary programming,current search point,long jump,shorter search step size,gaussian mutation,evolutionary programming,helpful cauchy mutation | Convergence (routing),Applied mathematics,Algorithm,Cauchy distribution,Correlation,Self adaptation,Cauchy mutation,Gaussian,Evolutionary programming,Mathematics | Conference |
Volume | ISSN | Citations |
5370 | 0302-9743 | 1 |
PageRank | References | Authors |
0.36 | 4 | 1 |