Evolutionary programming based on non-uniform mutation
文献类型:期刊论文
作者 | Zhao, Xinchao1,2; Gao, Xiao-Shan2![]() |
刊名 | APPLIED MATHEMATICS AND COMPUTATION
![]() |
出版日期 | 2007-09-01 |
卷号 | 192期号:1页码:1-11 |
关键词 | evolutionary programming non-uniform mutation executing process |
ISSN号 | 0096-3003 |
DOI | 10.1016/j.amc.2006.06.107 |
英文摘要 | A new evolutionary programming using non-uniform mutation instead of Gaussian, Cauchy and Levy 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 Levy 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. (c) 2006 Elsevier Inc. All rights reserved. |
WOS研究方向 | Mathematics |
语种 | 英语 |
WOS记录号 | WOS:000253495000001 |
出版者 | ELSEVIER SCIENCE INC |
源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/5234] ![]() |
专题 | 系统科学研究所 |
通讯作者 | Zhao, Xinchao |
作者单位 | 1.Beijing Univ Posts & Telecommun, Sch Sci, Beijing 100876, Peoples R China 2.Acad Sinica, AMSS, Inst Syst Sci, KLMM, Beijing 100080, Peoples R China 3.Nanjing Univ, Dept Math, Nanjing 210093, Peoples R China |
推荐引用方式 GB/T 7714 | Zhao, Xinchao,Gao, Xiao-Shan,Hu, Ze-Chun. Evolutionary programming based on non-uniform mutation[J]. APPLIED MATHEMATICS AND COMPUTATION,2007,192(1):1-11. |
APA | Zhao, Xinchao,Gao, Xiao-Shan,&Hu, Ze-Chun.(2007).Evolutionary programming based on non-uniform mutation.APPLIED MATHEMATICS AND COMPUTATION,192(1),1-11. |
MLA | Zhao, Xinchao,et al."Evolutionary programming based on non-uniform mutation".APPLIED MATHEMATICS AND COMPUTATION 192.1(2007):1-11. |
入库方式: OAI收割
来源:数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。