An improved memory prediction strategy for dynamic multiobjective optimization

Jinhua Zheng, Tian Chen, H. Xie, Shengxiang Yang
{"title":"An improved memory prediction strategy for dynamic multiobjective optimization","authors":"Jinhua Zheng, Tian Chen, H. Xie, Shengxiang Yang","doi":"10.1109/ICCIA49625.2020.00039","DOIUrl":null,"url":null,"abstract":"In evolutionary dynamic multiobjective optimization (EDMO), the memory strategy and prediction method are considered as effective and efficient methods. To handling dynamic multiobjective problems (DMOPs), this paper studies the behavior of environment change and tries to make use of the historical information appropriately. And then, this paper proposes an improved memory prediction model that uses the memory strategy to provide valuable information to the prediction model to predict the POS of the new environment more accurately. This memory prediction model is incorporated into a multiobjective evolutionary algorithm based on decomposition (MOEA/D). In particular, the resultant algorithm (MOEA/D-MP) adopts a sensor-based method to detect the environment change and find a similar one in history to reuse the information of it in the prediction process. The proposed algorithm is compared with several state-of-the-art dynamic multiobjective evolutionary algorithms (DMOEA) on six typical benchmark problems with different dynamic characteristics. Experimental results demonstrate that the proposed algorithm can effectively tackle DMOPs.","PeriodicalId":237536,"journal":{"name":"2020 5th International Conference on Computational Intelligence and Applications (ICCIA)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 5th International Conference on Computational Intelligence and Applications (ICCIA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIA49625.2020.00039","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In evolutionary dynamic multiobjective optimization (EDMO), the memory strategy and prediction method are considered as effective and efficient methods. To handling dynamic multiobjective problems (DMOPs), this paper studies the behavior of environment change and tries to make use of the historical information appropriately. And then, this paper proposes an improved memory prediction model that uses the memory strategy to provide valuable information to the prediction model to predict the POS of the new environment more accurately. This memory prediction model is incorporated into a multiobjective evolutionary algorithm based on decomposition (MOEA/D). In particular, the resultant algorithm (MOEA/D-MP) adopts a sensor-based method to detect the environment change and find a similar one in history to reuse the information of it in the prediction process. The proposed algorithm is compared with several state-of-the-art dynamic multiobjective evolutionary algorithms (DMOEA) on six typical benchmark problems with different dynamic characteristics. Experimental results demonstrate that the proposed algorithm can effectively tackle DMOPs.
一种改进的动态多目标优化记忆预测策略
在进化动态多目标优化(EDMO)中,记忆策略和预测方法是两种有效的优化方法。为了处理动态多目标问题,本文研究了环境变化的行为,并尝试适当地利用历史信息。然后,本文提出了一种改进的记忆预测模型,该模型利用记忆策略为预测模型提供有价值的信息,从而更准确地预测新环境的POS。该记忆预测模型被纳入基于分解的多目标进化算法(MOEA/D)。具体而言,所得算法(MOEA/D-MP)采用基于传感器的方法检测环境变化,并找到历史上相似的环境变化,以便在预测过程中重用其信息。针对六个具有不同动态特性的典型基准问题,将该算法与几种最新动态多目标进化算法(DMOEA)进行了比较。实验结果表明,该算法可以有效地处理dmp问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信