基于预测和存档双重机制的动态多目标优化算法

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Swarm and Evolutionary Computation Pub Date : 2024-08-09 DOI:10.1016/j.swevo.2024.101693
Maocai Wang, Bin Li, Guangming Dai, Zhiming Song, Xiaoyu Chen, Qian Bao, Lei Peng
{"title":"基于预测和存档双重机制的动态多目标优化算法","authors":"Maocai Wang,&nbsp;Bin Li,&nbsp;Guangming Dai,&nbsp;Zhiming Song,&nbsp;Xiaoyu Chen,&nbsp;Qian Bao,&nbsp;Lei Peng","doi":"10.1016/j.swevo.2024.101693","DOIUrl":null,"url":null,"abstract":"<div><p>In the dynamic multi-objective optimization problems, if the environmental changes are detected, an appropriate response strategy be employed to respond quickly to the change. The predictive mechanism is effective in detecting the patterns of change in a problem and is often used to track the Pareto Frontier (PF) in a new environment. However, these methods often rely on the historical optimization results to approximate new environmental solutions, which can lead to back-predictions and mislead population convergence because of the low quality of historical solutions. This paper proposes a dual mechanism of prediction and archive (DMPA_DMOEA) to address the problem. The improvements include: (1) The well-distributed solutions from the previous environment be retained to ensure that reliable solutions exist in the new environment. (2) An LSTM neural network model is used to construct the predictor, which makes full use of the historical information and fits the nonlinear relationship between the pareto set (PS), thus improving the accuracy of the predicted solution. (3) These archived solutions and the predicted solutions collectively form the initial population for the new environment, which improves the quality of the initial population and maintains excellent tracking performance. Finally, Multiple benchmark problems and different variation types are tested to validate the effectiveness of the proposed algorithm. Experiment results show that the proposed algorithm can effectively handle DMOPs and has shown its remarkable superiority in comparison with state-of-the-art algorithms.</p></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"90 ","pages":"Article 101693"},"PeriodicalIF":8.2000,"publicationDate":"2024-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A dynamic multi-objective optimization algorithm with a dual mechanism based on prediction and archive\",\"authors\":\"Maocai Wang,&nbsp;Bin Li,&nbsp;Guangming Dai,&nbsp;Zhiming Song,&nbsp;Xiaoyu Chen,&nbsp;Qian Bao,&nbsp;Lei Peng\",\"doi\":\"10.1016/j.swevo.2024.101693\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In the dynamic multi-objective optimization problems, if the environmental changes are detected, an appropriate response strategy be employed to respond quickly to the change. The predictive mechanism is effective in detecting the patterns of change in a problem and is often used to track the Pareto Frontier (PF) in a new environment. However, these methods often rely on the historical optimization results to approximate new environmental solutions, which can lead to back-predictions and mislead population convergence because of the low quality of historical solutions. This paper proposes a dual mechanism of prediction and archive (DMPA_DMOEA) to address the problem. The improvements include: (1) The well-distributed solutions from the previous environment be retained to ensure that reliable solutions exist in the new environment. (2) An LSTM neural network model is used to construct the predictor, which makes full use of the historical information and fits the nonlinear relationship between the pareto set (PS), thus improving the accuracy of the predicted solution. (3) These archived solutions and the predicted solutions collectively form the initial population for the new environment, which improves the quality of the initial population and maintains excellent tracking performance. Finally, Multiple benchmark problems and different variation types are tested to validate the effectiveness of the proposed algorithm. Experiment results show that the proposed algorithm can effectively handle DMOPs and has shown its remarkable superiority in comparison with state-of-the-art algorithms.</p></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"90 \",\"pages\":\"Article 101693\"},\"PeriodicalIF\":8.2000,\"publicationDate\":\"2024-08-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Swarm and Evolutionary Computation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2210650224002311\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650224002311","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

在动态多目标优化问题中,如果能检测到环境变化,就能采用适当的应对策略来快速应对变化。预测机制能有效检测问题的变化规律,通常用于跟踪新环境下的帕累托前沿(PF)。然而,这些方法往往依赖于历史优化结果来近似新的环境解,由于历史解的质量较低,可能会导致反向预测,误导群体收敛。本文提出了预测和归档双重机制(DMPA_DMOEA)来解决这一问题。其改进包括(1) 保留上一个环境中分布良好的解决方案,以确保新环境中存在可靠的解决方案。(2) 使用 LSTM 神经网络模型构建预测器,充分利用历史信息并拟合帕雷托集(PS)之间的非线性关系,从而提高预测解决方案的准确性。(3) 这些存档解和预测解共同构成新环境的初始种群,从而提高初始种群的质量,保持优异的跟踪性能。最后,测试了多个基准问题和不同的变化类型,以验证所提算法的有效性。实验结果表明,所提出的算法可以有效地处理 DMOPs,与最先进的算法相比具有显著的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A dynamic multi-objective optimization algorithm with a dual mechanism based on prediction and archive

In the dynamic multi-objective optimization problems, if the environmental changes are detected, an appropriate response strategy be employed to respond quickly to the change. The predictive mechanism is effective in detecting the patterns of change in a problem and is often used to track the Pareto Frontier (PF) in a new environment. However, these methods often rely on the historical optimization results to approximate new environmental solutions, which can lead to back-predictions and mislead population convergence because of the low quality of historical solutions. This paper proposes a dual mechanism of prediction and archive (DMPA_DMOEA) to address the problem. The improvements include: (1) The well-distributed solutions from the previous environment be retained to ensure that reliable solutions exist in the new environment. (2) An LSTM neural network model is used to construct the predictor, which makes full use of the historical information and fits the nonlinear relationship between the pareto set (PS), thus improving the accuracy of the predicted solution. (3) These archived solutions and the predicted solutions collectively form the initial population for the new environment, which improves the quality of the initial population and maintains excellent tracking performance. Finally, Multiple benchmark problems and different variation types are tested to validate the effectiveness of the proposed algorithm. Experiment results show that the proposed algorithm can effectively handle DMOPs and has shown its remarkable superiority in comparison with state-of-the-art algorithms.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
期刊最新文献
A survey on vehicle–drone cooperative delivery operations optimization: Models, methods, and future research directions Bayesian network structure learning based on discrete artificial jellyfish search: Leveraging scoring and graphical properties A learning-based memetic algorithm for energy-efficient distributed flow-shop scheduling with preventive maintenance Provable space discretization based evolutionary search for scalable multi-objective security games Multi-Objective Optimization for Distributed Generator and Shunt Capacitor Placement Considering Voltage-Dependent Nonlinear Load Models
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1