.png){kind=icon}
返回
Neuro-PSO algorithm for large-scale dynamic optimization
.png){kind=icon}
OA
AI
DOI：10.1016/j.swevo.2025.101865.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Over the last few decades, dynamic optimization and large-scale optimization have been two challenging research topics. In this context, dynamic optimization with high dimensionality is undoubtedly another important research topic. For such a combined problem, this paper develops: (1) an algorithm that incorporates problem decomposition to deal with high dimensionality, (2) a search algorithm for optimization, and (3) a prediction strategy to deal with dynamic changes. Firstly, a decomposition method is introduced to divide the problem into multiple subproblems based on the level of interactions among the decision variables. For optimization, a multi-population search algorithm is proposed, where each subpopulation evolves individually. Finally, a machine learning-based prediction strategy is developed to learn information from historical solutions and predict some solutions that maybe useful for the new environment. The proposed algorithm is tested using the generalized moving peaks benchmark problems. The results show that the proposed algorithm can find better solutions than existing approaches.
Keyword:
Evolutionary dynamic optimization
Large-scale dynamic optimization problems
Tracking moving optimum
Generalized moving peaks benchmark
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.5
论文数:
2.2K
被引数:
1.0W
机构
引用论文
.png){kind=icon}
Neural Network Training With Levenberg-Marquardt and Adaptable Weight Compression基于levenberg-marquardt和自适应权值压缩的神经网络训练
PREAI
分享收藏A General Framework of Multipopulation Methods with Clustering in Undetectable Dynamic Environments
OAAI
OAAI分享收藏
查看更多内容