Co-evolutionary algorithm based on problem analysis for dynamic multiobjective optimization

IF 6.8 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Sciences Pub Date : 2023-07-01 DOI:10.1016/j.ins.2023.03.100
Xiaoli Li , Anran Cao , Kang Wang , Xin Li , Quanbo Liu
{"title":"Co-evolutionary algorithm based on problem analysis for dynamic multiobjective optimization","authors":"Xiaoli Li ,&nbsp;Anran Cao ,&nbsp;Kang Wang ,&nbsp;Xin Li ,&nbsp;Quanbo Liu","doi":"10.1016/j.ins.2023.03.100","DOIUrl":null,"url":null,"abstract":"<div><p><span>Dynamic multiobjective optimization problems (DMOPs) vary over time, requiring an </span>optimization algorithm<span> to track the position of Pareto-optimal front (PF) in a dynamic environment. To achieve that, a novel co-evolutionary algorithm based on problem analysis (CAPA) is proposed in this paper. CAPA is designed to solve DMOPs from decision space and objective space simultaneously, which is achieved by the combination of adjustable prediction (AP) and precise mapping strategy (PM). In decision space, the proposed multi-model prediction can estimate the location of new population based on the historical median points. In objective space, a novel sampling method is developed to search for sample points with better convergence or diversity. Then, mapping these sample points back to decision space based on inverse model. Through the problem analysis mechanism, the proportion of the new solutions produced by each strategy changes adaptively. CAPA is incorporated into the dynamic multiobjective evolutionary algorithm (DMOEA) based on decomposition (MOEA/D) to construct a novel algorithm. The efficacy of CAPA is validated by comparison with five state-of-the-art algorithms on 28 benchmarks. Experimental results show that CAPA has the ability to generate high quality population uniformly along PF.</span></p></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"634 ","pages":"Pages 520-538"},"PeriodicalIF":6.8000,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025523004243","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Dynamic multiobjective optimization problems (DMOPs) vary over time, requiring an optimization algorithm to track the position of Pareto-optimal front (PF) in a dynamic environment. To achieve that, a novel co-evolutionary algorithm based on problem analysis (CAPA) is proposed in this paper. CAPA is designed to solve DMOPs from decision space and objective space simultaneously, which is achieved by the combination of adjustable prediction (AP) and precise mapping strategy (PM). In decision space, the proposed multi-model prediction can estimate the location of new population based on the historical median points. In objective space, a novel sampling method is developed to search for sample points with better convergence or diversity. Then, mapping these sample points back to decision space based on inverse model. Through the problem analysis mechanism, the proportion of the new solutions produced by each strategy changes adaptively. CAPA is incorporated into the dynamic multiobjective evolutionary algorithm (DMOEA) based on decomposition (MOEA/D) to construct a novel algorithm. The efficacy of CAPA is validated by comparison with five state-of-the-art algorithms on 28 benchmarks. Experimental results show that CAPA has the ability to generate high quality population uniformly along PF.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于问题分析的动态多目标优化协同进化算法
动态多目标优化问题(DMOP)随时间变化,需要一种优化算法来跟踪动态环境中Pareto最优前沿(PF)的位置。为此,本文提出了一种新的基于问题分析的协同进化算法。CAPA是通过可调预测(AP)和精确映射策略(PM)的结合,从决策空间和目标空间同时求解DMOP的。在决策空间中,所提出的多模型预测可以基于历史中值点来估计新人口的位置。在目标空间中,提出了一种新的采样方法来搜索具有更好收敛性或多样性的采样点。然后,基于逆模型将这些样本点映射回决策空间。通过问题分析机制,每个策略产生的新解决方案的比例自适应地变化。将CAPA引入基于分解的动态多目标进化算法(DMOEA)中,构造了一种新的算法。通过在28个基准上与五种最先进的算法进行比较,验证了CAPA的有效性。实验结果表明,CAPA具有沿PF均匀生成高质量种群的能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
期刊最新文献
Editorial Board Tensorized topological manifold for multiple kernel clustering LPCLNet: Leveraging local pixel-wise contrastive learning for image tampering localization UHTS-DRL: A deep reinforcement learning framework for integrated agile satellite observation and data transmission scheduling A framework for technological bottleneck detection and collaborative optimization in heterogeneous parallel networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1