.png){kind=icon}
返回
Exploring dynamic self-adaptive populations in differential evolution
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-005-0537-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Although the Differential Evolution (DE) algorithm has been shown to be a simple yet powerful evolutionary algorithm for optimizing continuous functions, users are still faced with the problem of preliminary testing and hand-tuning of the evolutionary parameters prior to commencing the actual optimization process. As a solution, self-adaptation has been found to be highly beneficial in automatically and dynamically adjusting evolutionary parameters such as crossover rates and mutation rates. In this paper, we present a first attempt at self-adapting the population size parameter in addition to self-adapting crossover and mutation rates. Firstly, our main objective is to demonstrate the feasibility of self-adapting the population size parameter in DE. Using De Jong's F1-F5 benchmark test problems, we showed that DE with self-adaptive populations produced highly competitive results compared to a conventional DE algorithm with static populations. In addition to reducing the number of parameters used in DE, the proposed algorithm actually outperformed the conventional DE algorithm for one of the test problems. It was also found that that an absolute encoding methodology for self-adapting population size in DE produced results with greater optimization reliability compared to a relative encoding methodology.
Keyword:
parameterless evolutionary algorithms
differential evolution
self-adaptation
population dynamics
parameter encoding
evolutionary optimization
natural computation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容