A dynamic task-assisted constrained multimodal multi-objective optimization algorithm based on reinforcement learning

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Zheng Wang , Qianlin Ye , Wanliang Wang , Guoqing Li , Rui Dai
{"title":"A dynamic task-assisted constrained multimodal multi-objective optimization algorithm based on reinforcement learning","authors":"Zheng Wang ,&nbsp;Qianlin Ye ,&nbsp;Wanliang Wang ,&nbsp;Guoqing Li ,&nbsp;Rui Dai","doi":"10.1016/j.swevo.2025.102087","DOIUrl":null,"url":null,"abstract":"<div><div>Constrained multimodal optimization problems (CMMOPs) are required to satisfy constraint limitations and ensure the convergence and diversity of the solutions in the objective and decision spaces. It increases the difficulty of solving the optimization problems. To design efficient constrained multimodal multi-objective optimization evolutionary algorithms (CMMOEAs) to solve them is a hot topic today. A novel dynamic auxiliary task selection algorithm (DTCMMO-RL) is designed based on the multi-task framework and reinforcement learning. The algorithm designs three auxiliary tasks to optimize constrained multi-objective problems, simple multi-objective problems and multimodal optimization problems, respectively. At the same time, Q-learning in reinforcement learning is employed to dynamically select the current optimal auxiliary task to utilize the useful information obtained rationally. In addition, an indicator (IGDXp) capable of evaluating the comprehensive performance of the solutions in the objective space and decision space is designed. To verify the excellence of DTCMMO-RL, a series of experiments with 11 comparison algorithms on CMMF and CMMOP are conducted to verify the feasibility and effectiveness of multiple strategies.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"98 ","pages":"Article 102087"},"PeriodicalIF":8.2000,"publicationDate":"2025-07-19","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/S2210650225002457","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

Constrained multimodal optimization problems (CMMOPs) are required to satisfy constraint limitations and ensure the convergence and diversity of the solutions in the objective and decision spaces. It increases the difficulty of solving the optimization problems. To design efficient constrained multimodal multi-objective optimization evolutionary algorithms (CMMOEAs) to solve them is a hot topic today. A novel dynamic auxiliary task selection algorithm (DTCMMO-RL) is designed based on the multi-task framework and reinforcement learning. The algorithm designs three auxiliary tasks to optimize constrained multi-objective problems, simple multi-objective problems and multimodal optimization problems, respectively. At the same time, Q-learning in reinforcement learning is employed to dynamically select the current optimal auxiliary task to utilize the useful information obtained rationally. In addition, an indicator (IGDXp) capable of evaluating the comprehensive performance of the solutions in the objective space and decision space is designed. To verify the excellence of DTCMMO-RL, a series of experiments with 11 comparison algorithms on CMMF and CMMOP are conducted to verify the feasibility and effectiveness of multiple strategies.
基于强化学习的动态任务辅助约束多模态多目标优化算法
约束多模态优化问题要求满足约束限制,并保证目标空间和决策空间中解的收敛性和多样性。这增加了求解优化问题的难度。设计高效的约束多模态多目标优化进化算法(cmmoea)来解决这些问题是当今的研究热点。基于多任务框架和强化学习,设计了一种新的动态辅助任务选择算法(DTCMMO-RL)。该算法设计了三个辅助任务,分别对约束多目标问题、简单多目标问题和多模态优化问题进行优化。同时,利用强化学习中的q学习动态选择当前最优的辅助任务,合理利用得到的有用信息。此外,还设计了一个能够在目标空间和决策空间中评价方案综合性能的指标(IGDXp)。为了验证DTCMMO-RL的卓越性,在CMMF和CMMOP上进行了11种比较算法的一系列实验,验证了多种策略的可行性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信