.png){kind=icon}
返回
Multi-search differential evolution algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-016-0885-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The differential evolution algorithm (DE) has been shown to be a very simple and effective evolutionary algorithm. Recently, DE has been successfully used for the numerical optimization. In this paper, first, based on the fitness value of each individual, the population is partitioned into three subpopulations with different size. Then, a dynamically adjusting method is used to change the three subpopulation group sizes based on the previous successful rate of different mutation strategies. Second, inspired by the DE/current to pbest/1, three mutation strategies including DE/current to cbest/1, DE/current to rbest/1 and DE/current to fbest/1 are proposed to take on the responsibility for either exploitation or exploration. Finally, a novel effective parameter adaptation method is designed to automatically tune the parameter F and CR in DE algorithm. In order to validate the effectiveness of MSDE, it is tested on ten benchmark functions chosen from literature. Compared with some evolution algorithms from literature, MSDE performs better in most of the benchmark problems.
Keyword:
Multiple sub-populations
Differential evolution
Adaptive parameter control
Global optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization求解全局数值优化问题的策略自适应差分进化算法
OAAI
OAAI分享收藏Comprehensive learning particle swarm optimizer for global optimization of multimodal functions
PREAI
分享收藏Interior search algorithm (ISA): A novel approach for global optimization内部搜索算法 (ISA): 一种新的全局优化方法.png)
ISA TRANSACTIONS
ISA TRANSACTIONSIF6.5
PREAI
分享收藏
查看更多内容