返回
Dual-archive-based particle swarm optimization for dynamic optimization
DOI:10.1016/j.asoc.2019.105876.png)
摘要
En 中文
In dynamic optimization problems, although the problem environments keep changing, a new environment is usually related to its previous environments. Based on the relevance, the search experience in the previous environments can be reused to accelerate the optimization of the current new environment. Thus, in this paper, we propose a dual-archive-based particle swarm optimization to utilize the useful information accumulated in past environments as well as to explore the emerging information of each new environment. Specifically, in the proposed algorithm, the good solutions found in past environments are stored in two different archives, i.e., a fine-grained archive and a coarsegrained archive, so as to preserve both detailed information and systemic information, respectively. Once the environment is changed, the solutions in the two archives will be used for guidance to quickly find high-quality solutions in the new environment. The proposed algorithm is evaluated on the famous moving peaks benchmark in terms of two performance measures. The experimental results show that the proposed algorithm is competitive with state-of-the-art algorithms for dynamic optimization problems. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Particle swarm optimization
Dynamic optimization problems
Evolutionary computation
Information reuse
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
Analysis of selection hyper-heuristics for population-based meta-heuristics in real-valued dynamic optimization实值动态优化中基于种群的元启发式的选择超启发式分析
Ensemble and Arithmetic Recombination-Based Speciation Differential Evolution for Multimodal Optimization基于集成和算术重组的多峰优化物种差分进化

