.png){kind=icon}
返回
A novel framework for improving multi-population algorithms for dynamic optimization problems: A scheduling approach
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2018.09.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a novel framework for improving the performance of multi-population algorithms in solving dynamic optimization problems (DOPs). The fundamental idea of the proposed framework is to incorporate the concept of scheduling into multi-population methods with the aim to allocate more function evaluations to the best performing sub-populations. Two methods are developed based on the proposed framework, each of which uses a different approach for scheduling the sub-populations. The first method combines the quality of sub-populations and the degree of diversity among them into a single feedback parameter for detecting the best performing sub-population. The second method uses the learning automata as the central unit for performing the scheduling operation. In order to validate the applicability of the proposed methods, they are incorporated into three well-known algorithms for DOPs. The experimental results show the efficiency of the scheduling approach for improving the multi-population methods on the moving peaks benchmark (MPB) and generalized dynamic benchmark generator.
Keyword:
Dynamic optimization problems
Differential evolution
Moving peaks benchmark
Evolutionary computation
Scheduling
Learning automata
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.5
论文数:
2.2K
被引数:
1.0W
机构
引用论文
分享收藏A General Framework of Multipopulation Methods with Clustering in Undetectable Dynamic Environments
OAAI
OAAI分享收藏A Role for Transcription Factor GTF2IRD2 in Executive Function in Williams-Beuren Syndrome.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏分享收藏
查看更多内容