.png){kind=icon}
返回
Global replacement-based differential evolution with neighbor-based memory for dynamic optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-018-1147-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Dynamic optimization problems challenge the evolutionary algorithms, owing to the diversity loss or the low search efficiency of the algorithms, especially when the problems change frequently. This paper presents a novel differential evolution algorithm to address the dynamic optimization problems. Unlike the most used DE/rand/1 mutation operator, in this paper, the DE/best/1 mutation is employed to generate a mutant individual. In order to enhance the search efficiency of differential evolution, the classical differential evolution algorithm is modified by a novel replacement operator, in which the worst individual in the whole population is replaced by the newly generated trial vector as a steady-state manner. During optimizing, some newly generated solutions are stored into a memory set, in which these stored solutions are located around the current best solution. When the environmental change is detected, the stored solutions are expected to guide the reinitialized solutions to track the new location of global optimum as soon as possible. The performance of the proposed algorithm is compared with six state-of-the-art dynamic evolutionary algorithms over some benchmark problems. The experimental results show that the proposed algorithm clearly outperforms the competitors.
Keyword:
Global replacement
Differential evolution
Neighbor-based memory
Dynamic optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
A General Framework of Multipopulation Methods with Clustering in Undetectable Dynamic Environments
OAAI
OAAI分享收藏分享收藏WD2O: a novel wind driven dynamic optimization approach with effective change detection.png)
APPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
分享收藏
查看更多内容