.png){kind=icon}
返回
Hyper-heuristic approach: automatically designing adaptive mutation operators for evolutionary programming
.png){kind=icon}
OA
AI
DOI：10.1007/s40747-021-00507-6.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Genetic programming (GP) automatically designs programs. Evolutionary programming (EP) is a real-valued global optimisation method. EP uses a probability distribution as a mutation operator, such as Gaussian, Cauchy, or Levy distribution. This study proposes a hyper-heuristic approach that employs GP to automatically design different mutation operators for EP. At each generation, the EP algorithm can adaptively explore the search space according to historical information. The experimental results demonstrate that the EP with adaptive mutation operators, designed by the proposed hyper-heuristics, exhibits improved performance over other EP versions (both manually and automatically designed). Many researchers in evolutionary computation advocate adaptive search operators (which do adapt over time) over non-adaptive operators (which do not alter over time). The core motive of this study is that we can automatically design adaptive mutation operators that outperform automatically designed non-adaptive mutation operators.
Keyword:
Hyper-heuristic
Evolutionary programming
Genetic programming
Adaptive mutation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.6
论文数:
2.1K
被引数:
6.6K
机构
引用论文
.png){kind=icon}
Post‐stroke depression and functional recovery in a population‐based stroke register. The Finnstroke study基于人群的卒中登记中的卒中后抑郁和功能恢复。Finnstroke研究
PREAI
分享收藏
查看更多内容