Advertisement
Published in:
2008 | OriginalPaper | Chapter
A Self-adaptive Evolutionary Programming Based on Optimum Search Direction
Authors : Guangming Lin, Xin Lu, Yongsheng Liang, Lishan Kang, Xin Yao
Published in: Advances in Computation and Intelligence
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The Classical Evolutionary Programming (CEP) relies on Gaussian mutation, whereas Fast Evolutionary Programming (FEP) selects Cauchy distribution as the primary mutation operator, Improved Fast Evolutionary (IFEP) selects the better Gaussian and Cauchy distribution as the primary mutation operator. In this paper, we propose a self-adaptive Evolutionary Programming based on Optimum Search Direction (OSDEP) in which we introduce the current best global individual into mutation to guide individuals to converge according to the global search direction. Extensive empirical studies have been carried out to evaluate the performance of OSDEP, IFEP, FEP and CEP. From the experimental results on seven widely used test functions, we can show that OSDEP outperforms all of IFEP, FEP and CEP for all the test functions.