Optimal Linear Crossover for Mitigating Negative Transfer in Evolutionary Multitasking

IF 15.9 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE IEEE Transactions on Evolutionary Computation Pub Date : 2026-02-01 Epub Date: 2024-11-04 DOI:10.1109/TEVC.2024.3490174
Zhaobo Liu;Jianhua Yuan;Haili Zhang;Tao Zeng;Zexuan Zhu
{"title":"Optimal Linear Crossover for Mitigating Negative Transfer in Evolutionary Multitasking","authors":"Zhaobo Liu;Jianhua Yuan;Haili Zhang;Tao Zeng;Zexuan Zhu","doi":"10.1109/TEVC.2024.3490174","DOIUrl":null,"url":null,"abstract":"Evolutionary multitasking (EMT) algorithms use information exchange among individuals in a population to solve multiple optimization problems simultaneously. Negative transfer is a critical factor that affects the performance of EMT algorithms. In this study, we propose an innovative approach to mitigate negative transfer in EMT algorithms. The proposed approach is grounded in rigorous theoretical analysis, which provides valuable theoretical insights into the design of an optimal linear crossover operator for mitigating negative transfer. By identifying interpretable conditions, we establish a solid theoretical foundation to prevent negative transfer in diverse scenarios. Building upon these findings, we theoretically derive a closed-form expression for the optimal crossover (OC) operator and propose practical design methods based on approximations. Furthermore, we integrate the proposed OC operator into a fundamental EMT algorithm framework. The resultant algorithm is comparable or superior to other state-of-the-art methods. Empirical validation through comprehensive experiments confirms the effectiveness of our theoretical findings.","PeriodicalId":13206,"journal":{"name":"IEEE Transactions on Evolutionary Computation","volume":"30 1","pages":"46-60"},"PeriodicalIF":15.9000,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10742196/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/11/4 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Evolutionary multitasking (EMT) algorithms use information exchange among individuals in a population to solve multiple optimization problems simultaneously. Negative transfer is a critical factor that affects the performance of EMT algorithms. In this study, we propose an innovative approach to mitigate negative transfer in EMT algorithms. The proposed approach is grounded in rigorous theoretical analysis, which provides valuable theoretical insights into the design of an optimal linear crossover operator for mitigating negative transfer. By identifying interpretable conditions, we establish a solid theoretical foundation to prevent negative transfer in diverse scenarios. Building upon these findings, we theoretically derive a closed-form expression for the optimal crossover (OC) operator and propose practical design methods based on approximations. Furthermore, we integrate the proposed OC operator into a fundamental EMT algorithm framework. The resultant algorithm is comparable or superior to other state-of-the-art methods. Empirical validation through comprehensive experiments confirms the effectiveness of our theoretical findings.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在多任务进化过程中减轻负迁移的最优线性交叉
进化多任务(EMT)算法利用群体中个体之间的信息交换来同时解决多个优化问题。负迁移是影响EMT算法性能的一个重要因素。在这项研究中,我们提出了一种创新的方法来减轻EMT算法中的负迁移。所提出的方法基于严格的理论分析,为设计最优线性交叉算子以减轻负迁移提供了有价值的理论见解。通过确定可解释的条件,我们建立了坚实的理论基础,以防止各种情况下的负迁移。基于这些发现,我们从理论上推导出最优交叉(OC)算子的封闭表达式,并提出了基于近似的实用设计方法。此外,我们将提出的OC算子整合到基本的EMT算法框架中。所得算法可与其他最先进的方法相媲美或优于其他最先进的方法。通过综合实验的实证验证,证实了理论发现的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation 工程技术-计算机:理论方法
CiteScore
21.90
自引率
9.80%
发文量
196
审稿时长
3.6 months
期刊介绍: The IEEE Transactions on Evolutionary Computation is published by the IEEE Computational Intelligence Society on behalf of 13 societies: Circuits and Systems; Computer; Control Systems; Engineering in Medicine and Biology; Industrial Electronics; Industry Applications; Lasers and Electro-Optics; Oceanic Engineering; Power Engineering; Robotics and Automation; Signal Processing; Social Implications of Technology; and Systems, Man, and Cybernetics. The journal publishes original papers in evolutionary computation and related areas such as nature-inspired algorithms, population-based methods, optimization, and hybrid systems. It welcomes both purely theoretical papers and application papers that provide general insights into these areas of computation.
期刊最新文献
AutoPSO: A Meta-Framework for Automated Particle Swarm Optimization Table of Contents LLM-Assisted Automatic Memetic Algorithm for Lot-Streaming Hybrid Job Shop Scheduling With Variable Sublots ES-GP: An Ensemble Surrogate-Assisted Genetic Programming Approach to Image Classification Data-Driven Dynamic Multiobjective Optimization With Response to Stochastic Changes for Municipal Solid Waste Incineration Process
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1