Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4635045 | Applied Mathematics and Computation | 2007 | 11 Pages |
Abstract
A new evolutionary programming using non-uniform mutation instead of Gaussian, Cauchy and Lévy mutations is proposed. Evolutionary programming with non-uniform mutation (NEP) has the merits of searching the space uniformly at the early stage and very locally at the later stage during the programming. For a suite of 14 benchmark problems, NEP outperforms the improved evolutionary programming using mutation based on Lévy probability distribution (ILEP) for multimodal functions with many local minima while being comparable to ILEP in performance for unimodal and multimodal functions with only a few minima. The detailed theoretical analysis of the executing process of NEP and the expected step size on non-uniform mutation are given.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Xinchao Zhao, Xiao-Shan Gao, Ze-Chun Hu,