约束多目标优化的协同竞争多任务框架

IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Xinyu Feng , Qianlong Dang , Xiaochuan Gao , Yanghui Wu , Lifei Zheng
{"title":"约束多目标优化的协同竞争多任务框架","authors":"Xinyu Feng ,&nbsp;Qianlong Dang ,&nbsp;Xiaochuan Gao ,&nbsp;Yanghui Wu ,&nbsp;Lifei Zheng","doi":"10.1016/j.asoc.2025.113900","DOIUrl":null,"url":null,"abstract":"<div><div>Constrained multi-objective optimization problems (CMOPs) are common in the real world. Constrained multi-objective evolutionary algorithms (CMOEAs) based on evolutionary multi-tasking show excellent performance in solving CMOPs. However, not all tasks can find useful information during the process of evolution, which inevitably results in a waste of computing resources. In this paper, a CMOEA based on collaborative competition multitasking (TCCMT) is proposed, in which two auxiliary tasks are constructed to co-evolve with the main task in a collaborative competition manner. During the process of evolution, only the dominant auxiliary task is selected to help the main task evolve, which reduces the resource consumption to evolve the invalid tasks. Meanwhile, the evolutionary process is divided into three stages in order to balance exploration and exploitation. The auxiliary tasks customize the constrained adaptive regression strategy and double angle enhancement strategy respectively to improve the ability to solve different problems. Compared with the nine most advanced CMOEAs on 33 benchmark problems and 7 real-world engineering problems, the Friedman test results show that TCCMT achieves the best rank on all test problems and exhibits a statistically significant difference.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"185 ","pages":"Article 113900"},"PeriodicalIF":6.6000,"publicationDate":"2025-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A collaborative competition multitasking framework for constrained multi-objective optimization\",\"authors\":\"Xinyu Feng ,&nbsp;Qianlong Dang ,&nbsp;Xiaochuan Gao ,&nbsp;Yanghui Wu ,&nbsp;Lifei Zheng\",\"doi\":\"10.1016/j.asoc.2025.113900\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Constrained multi-objective optimization problems (CMOPs) are common in the real world. Constrained multi-objective evolutionary algorithms (CMOEAs) based on evolutionary multi-tasking show excellent performance in solving CMOPs. However, not all tasks can find useful information during the process of evolution, which inevitably results in a waste of computing resources. In this paper, a CMOEA based on collaborative competition multitasking (TCCMT) is proposed, in which two auxiliary tasks are constructed to co-evolve with the main task in a collaborative competition manner. During the process of evolution, only the dominant auxiliary task is selected to help the main task evolve, which reduces the resource consumption to evolve the invalid tasks. Meanwhile, the evolutionary process is divided into three stages in order to balance exploration and exploitation. The auxiliary tasks customize the constrained adaptive regression strategy and double angle enhancement strategy respectively to improve the ability to solve different problems. Compared with the nine most advanced CMOEAs on 33 benchmark problems and 7 real-world engineering problems, the Friedman test results show that TCCMT achieves the best rank on all test problems and exhibits a statistically significant difference.</div></div>\",\"PeriodicalId\":50737,\"journal\":{\"name\":\"Applied Soft Computing\",\"volume\":\"185 \",\"pages\":\"Article 113900\"},\"PeriodicalIF\":6.6000,\"publicationDate\":\"2025-09-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Soft Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S156849462501213X\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S156849462501213X","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

约束多目标优化问题在现实世界中很常见。基于进化多任务的约束多目标进化算法(cmoea)在求解多目标问题方面表现出优异的性能。然而,并不是所有的任务在进化过程中都能找到有用的信息,这就不可避免地造成了计算资源的浪费。本文提出了一种基于协同竞争多任务(TCCMT)的CMOEA算法,该算法构建了两个辅助任务,以协同竞争的方式与主任务协同进化。在进化过程中,只选择优势的辅助任务来帮助主任务进化,从而减少了进化无效任务的资源消耗。同时,为了平衡勘探和开发,将演化过程分为三个阶段。辅助任务分别定制约束自适应回归策略和双角度增强策略,提高求解不同问题的能力。Friedman测试结果表明,在33个基准问题和7个实际工程问题上,与9个最先进的cmoea相比,TCCMT在所有测试问题上的排名都是最好的,并且具有统计学上的显著差异。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A collaborative competition multitasking framework for constrained multi-objective optimization
Constrained multi-objective optimization problems (CMOPs) are common in the real world. Constrained multi-objective evolutionary algorithms (CMOEAs) based on evolutionary multi-tasking show excellent performance in solving CMOPs. However, not all tasks can find useful information during the process of evolution, which inevitably results in a waste of computing resources. In this paper, a CMOEA based on collaborative competition multitasking (TCCMT) is proposed, in which two auxiliary tasks are constructed to co-evolve with the main task in a collaborative competition manner. During the process of evolution, only the dominant auxiliary task is selected to help the main task evolve, which reduces the resource consumption to evolve the invalid tasks. Meanwhile, the evolutionary process is divided into three stages in order to balance exploration and exploitation. The auxiliary tasks customize the constrained adaptive regression strategy and double angle enhancement strategy respectively to improve the ability to solve different problems. Compared with the nine most advanced CMOEAs on 33 benchmark problems and 7 real-world engineering problems, the Friedman test results show that TCCMT achieves the best rank on all test problems and exhibits a statistically significant difference.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Applied Soft Computing
Applied Soft Computing 工程技术-计算机:跨学科应用
CiteScore
15.80
自引率
6.90%
发文量
874
审稿时长
10.9 months
期刊介绍: Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities. Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.
×
引用
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学术官方微信