A novel preference-driven evolutionary algorithm for dynamic multi-objective problems

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Swarm and Evolutionary Computation Pub Date : 2024-06-30 DOI:10.1016/j.swevo.2024.101638
Xueqing Wang , Jinhua Zheng , Zhanglu Hou , Yuan Liu , Juan Zou , Yizhang Xia , Shengxiang Yang
{"title":"A novel preference-driven evolutionary algorithm for dynamic multi-objective problems","authors":"Xueqing Wang ,&nbsp;Jinhua Zheng ,&nbsp;Zhanglu Hou ,&nbsp;Yuan Liu ,&nbsp;Juan Zou ,&nbsp;Yizhang Xia ,&nbsp;Shengxiang Yang","doi":"10.1016/j.swevo.2024.101638","DOIUrl":null,"url":null,"abstract":"<div><p>Most studies in dynamic multi-objective optimization have predominantly focused on rapidly and accurately tracking changes in the Pareto optimal front (POF) and Pareto optimal set (POS) when the environment undergoes changes. However, there are real-world scenarios where it is necessary to simultaneously solve changing objective functions and satisfy the preference of Decision Makers (DMs). In particular, the DMs may be only interested in a partial region of the POF, known as the region of interest (ROI), rather than requiring the entire POF. To meet the challenge of simultaneously predicting a changing POF and/or POS and dynamic ROI, this paper proposes a new dynamic multi-objective evolutionary algorithm (DMOEAs) based on the preference. The proposed algorithm consists of three key components: an evolutionary direction adjustment strategy based on changing reference points to accommodate shifts in preferences, an angle-based search strategy for tracking the varying ROI, and a hybrid prediction strategy that combines linear prediction models and population manifold estimation within the ROI to ensure convergence and distribution in scenarios where preferences remain unchanged. Experimental studies conducted on 30 widely used benchmark problems in which it outperforms contrasting algorithms on 71% of test suits. Empirical results demonstrate the significant advantages of the proposed algorithm over existing state-of-the-art DMOEAs.</p></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":null,"pages":null},"PeriodicalIF":8.2000,"publicationDate":"2024-06-30","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/S2210650224001767","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Most studies in dynamic multi-objective optimization have predominantly focused on rapidly and accurately tracking changes in the Pareto optimal front (POF) and Pareto optimal set (POS) when the environment undergoes changes. However, there are real-world scenarios where it is necessary to simultaneously solve changing objective functions and satisfy the preference of Decision Makers (DMs). In particular, the DMs may be only interested in a partial region of the POF, known as the region of interest (ROI), rather than requiring the entire POF. To meet the challenge of simultaneously predicting a changing POF and/or POS and dynamic ROI, this paper proposes a new dynamic multi-objective evolutionary algorithm (DMOEAs) based on the preference. The proposed algorithm consists of three key components: an evolutionary direction adjustment strategy based on changing reference points to accommodate shifts in preferences, an angle-based search strategy for tracking the varying ROI, and a hybrid prediction strategy that combines linear prediction models and population manifold estimation within the ROI to ensure convergence and distribution in scenarios where preferences remain unchanged. Experimental studies conducted on 30 widely used benchmark problems in which it outperforms contrasting algorithms on 71% of test suits. Empirical results demonstrate the significant advantages of the proposed algorithm over existing state-of-the-art DMOEAs.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
针对动态多目标问题的新型偏好驱动进化算法
动态多目标优化的大多数研究主要集中在当环境发生变化时,快速准确地跟踪帕累托最优前沿(POF)和帕累托最优集(POS)的变化。然而,在现实世界中,有必要同时求解不断变化的目标函数并满足决策者(DMs)的偏好。特别是,决策制定者可能只对 POF 的部分区域(称为感兴趣区域 (ROI))感兴趣,而不需要整个 POF。为了应对同时预测不断变化的 POF 和/或 POS 以及动态 ROI 的挑战,本文提出了一种基于偏好的新型动态多目标进化算法(DMOEAs)。所提出的算法由三个关键部分组成:基于参考点变化的进化方向调整策略,以适应偏好的变化;基于角度的搜索策略,用于跟踪变化的 ROI;混合预测策略,结合 ROI 内的线性预测模型和种群流形估计,以确保在偏好保持不变的情况下的收敛和分布。在 30 个广泛使用的基准问题上进行了实验研究,其中 71% 的测试服优于对比算法。实证结果表明,与现有的最先进 DMOEA 相比,所提出的算法具有显著优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
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 cloud 15kV-HDPE insulator leakage current classification based improved particle swarm optimization and LSTM-CNN deep learning approach A multi-strategy optimizer for energy minimization of multi-UAV-assisted mobile edge computing An archive-assisted multi-modal multi-objective evolutionary algorithm Historical knowledge transfer driven self-adaptive evolutionary multitasking algorithm with hybrid resource release for solving nonlinear equation systems Expected coordinate improvement for high-dimensional Bayesian optimization
×
引用
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