.png){kind=icon}
返回
Self-organizing migrating algorithm using covariance matrix adaptation evolution strategy for dynamic constrained optimization
.png){kind=icon}
OA
AI
DOI：10.1016/j.swevo.2021.100936.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The dynamic constrained optimization problems can be a challenge for the optimization algorithms. They must tackle global optimum detection, as well as the change of the environment. Recently, a novel test suite for dynamic constrained optimization was introduced. Furthermore, three well-performed evolutionary algorithms were compared based on it. The experimental results show that each algorithm performed best for a different type of optimization problem. The objective of our work was to develop an algorithm reflecting requirements arising from the novel test suite and regarding the results provided by the tested algorithms. In this work, we present a novel evolutionary algorithm for dynamic constrained optimization. The algorithm hybridizes the self-organizing migrating algorithm and the covariance matrix adaptation evolution strategy with constraints handling approach. To avoid premature convergence, the best solutions representing feasible regions do not affect the rest of the population. Two clustering methods, exclusion radius, and quantum particles are used to preserve population diversity. The performance is evaluated on the recently published test suite and compared to the three state-of-the-art algorithms. The presented algorithm outperformed these algorithms in most test cases, which indicates the efficiency of the utilized mechanisms.
Keyword:
Dynamic constrained optimization
Self-organizing migrating algorithm
Covariance matrix adaptation
Evolution strategy
Moving peaks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。