arrow
返回

Dual-archive-based particle swarm optimization for dynamic optimization

delete2019-12-01
delete17
PRE
AI
刘晓芳 封面图
刘晓芳 (Xiaofang Liu)
Y
Yuren Zhou *
X
Xue Yu
林盈 封面图
林盈 (Ying Lin)
DOI:10.1016/j.asoc.2019.105876delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

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总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Applied Soft Computing 封面图
Applied Soft Computing
IF:
6.6
论文数:
1.4W
被引数:
4.8W

机构

S
Sun Yat Sen University
学者数:
9.9W
论文数: 7.2W
被引数: 95
引用论文

引用论文

Noisy evolutionary optimization algorithms - A comprehensive survey
err2017-04-01
err102
PREAI
errRakshit, Pratyusha; Konar, Amit; Das, Swagatam
err分享
err收藏
Scaling Up Dynamic Optimization Problems: A Divide-and-Conquer Approach
err2020-02-01
err46
errOAAI
errYazdani, Danial; Omidvar, Mohammad Nabi; Branke, Juergen; Trung Thanh Nguyen; Yao, Xin
err分享
err收藏
A novel framework for improving multi-population algorithms for dynamic optimization problems: A scheduling approach
err2019-02-01
err35
PREAI
errKordestani, Javidan Kazemi; Ranginkaman, Amir Ehsan; Meybodi, Mohammad Reza; Novoa-Hernandez, Pavel
err分享
err收藏
学者 查看更多内容