Clustering-based Autoencoding for Dynamic Multiobjective Evolutionary Optimization

Yulong Ye, Qingling Zhu, Lingjie Li, Jianyong Chen
{"title":"Clustering-based Autoencoding for Dynamic Multiobjective Evolutionary Optimization","authors":"Yulong Ye, Qingling Zhu, Lingjie Li, Jianyong Chen","doi":"10.1109/DOCS55193.2022.9967742","DOIUrl":null,"url":null,"abstract":"Dynamic multiobjective optimization problems (DMOPs) usually contain multiple conflicting objectives that change over time, which requires the optimization algorithms to quickly track the Pareto optimal front (POF) when the environment changes. In recent years, transfer learning (TL)-based methods have been considered promising in solving DMOPs. However, most existing TL-based methods are computationally extensive and therefore time-consuming. In this paper, a clustering based autoencoding for DMOEA, called CAE-DMOEA, is proposed, which aims to generate a high-quality initial population to accelerate the evolutionary process and improve the optimization performance. In particular, by learning the mapping relationship between the regional centroids of the approximate Pareto-optimal solutions (POS) from the previous two environments, the CAE-DMOEA can effectively predict the regional centroids of the POS in the new environment, which helps to tracking the moving POS and enhance the optimization efficiency. To study the performance of the proposed method, extensive experiments have been carried out by comparing three state-of-the-art DMOEAs. The experimental results show that the overall performance of the CAE-DMOEA is superior to that of the compared algorithms.","PeriodicalId":348545,"journal":{"name":"2022 4th International Conference on Data-driven Optimization of Complex Systems (DOCS)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 4th International Conference on Data-driven Optimization of Complex Systems (DOCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DOCS55193.2022.9967742","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Dynamic multiobjective optimization problems (DMOPs) usually contain multiple conflicting objectives that change over time, which requires the optimization algorithms to quickly track the Pareto optimal front (POF) when the environment changes. In recent years, transfer learning (TL)-based methods have been considered promising in solving DMOPs. However, most existing TL-based methods are computationally extensive and therefore time-consuming. In this paper, a clustering based autoencoding for DMOEA, called CAE-DMOEA, is proposed, which aims to generate a high-quality initial population to accelerate the evolutionary process and improve the optimization performance. In particular, by learning the mapping relationship between the regional centroids of the approximate Pareto-optimal solutions (POS) from the previous two environments, the CAE-DMOEA can effectively predict the regional centroids of the POS in the new environment, which helps to tracking the moving POS and enhance the optimization efficiency. To study the performance of the proposed method, extensive experiments have been carried out by comparing three state-of-the-art DMOEAs. The experimental results show that the overall performance of the CAE-DMOEA is superior to that of the compared algorithms.
基于聚类的动态多目标进化优化自编码
动态多目标优化问题通常包含多个相互冲突且随时间变化的目标,这就要求优化算法在环境变化时快速跟踪Pareto最优前沿。近年来,基于迁移学习(TL)的方法被认为是解决dmp问题的有前途的方法。然而,大多数现有的基于语言的方法计算量很大,因此很耗时。本文提出了一种基于聚类的DMOEA自编码算法CAE-DMOEA,该算法旨在生成高质量的初始种群,从而加快进化过程,提高优化性能。特别是,CAE-DMOEA通过学习前两种环境中近似pareto最优解(POS)区域质心之间的映射关系,可以有效地预测新环境中近似pareto最优解(POS)的区域质心,有助于跟踪移动的POS,提高优化效率。为了研究所提出的方法的性能,通过比较三种最先进的dmoea进行了大量的实验。实验结果表明,CAE-DMOEA算法的整体性能优于对比算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信