A New and More Challenging Compositive Multi-Task Optimization Problem Test Suite

Yiyi Jiang, Zhi-hui Zhan, Jinchao Zhang
{"title":"A New and More Challenging Compositive Multi-Task Optimization Problem Test Suite","authors":"Yiyi Jiang, Zhi-hui Zhan, Jinchao Zhang","doi":"10.1109/ICIST55546.2022.9926808","DOIUrl":null,"url":null,"abstract":"Evolutionary multi-task optimization (EMTO) is a recently emerging topic in the research area of evolutionary computation, aiming at solving multiple different optimization tasks simultaneously. Recently, with the development of EMTO, many multi-task optimization problem (MTOP) benchmark test suites have been proposed. However, these MTOP test suites are not sufficiently challenging. That is, the tasks in these MTOPs always have the same dimensionality and the aligned dimensions of the tasks can have related physical meanings or similar optimal values. To address these disadvantages of existing MTOP test suites, we propose a new and more challenging compositive MTOP (cMTOP) test suite. There are ten cMTOP instances in this test suite and each instance contains two tasks. These cMTOP instances are more challenging with three properties. First, the tasks in each cMTOP have different numbers of dimensions. Second, to make the aligned dimensions of two tasks have irrelated physical meanings, each task is a composition function composed of several basic functions. Third, each task in cMTOP is shifted and rotated to make the aligned dimensions of the two tasks have different optimal values. Based on these properties, the proposed cMTOP test suite is more challenging and can better evaluate the performance of EMTO algorithms. Finally, we analyze the performance of several state-of-the-art EMTO algorithms on this new and challenging cMTOP test suite.","PeriodicalId":211213,"journal":{"name":"2022 12th International Conference on Information Science and Technology (ICIST)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 12th International Conference on Information Science and Technology (ICIST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIST55546.2022.9926808","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Evolutionary multi-task optimization (EMTO) is a recently emerging topic in the research area of evolutionary computation, aiming at solving multiple different optimization tasks simultaneously. Recently, with the development of EMTO, many multi-task optimization problem (MTOP) benchmark test suites have been proposed. However, these MTOP test suites are not sufficiently challenging. That is, the tasks in these MTOPs always have the same dimensionality and the aligned dimensions of the tasks can have related physical meanings or similar optimal values. To address these disadvantages of existing MTOP test suites, we propose a new and more challenging compositive MTOP (cMTOP) test suite. There are ten cMTOP instances in this test suite and each instance contains two tasks. These cMTOP instances are more challenging with three properties. First, the tasks in each cMTOP have different numbers of dimensions. Second, to make the aligned dimensions of two tasks have irrelated physical meanings, each task is a composition function composed of several basic functions. Third, each task in cMTOP is shifted and rotated to make the aligned dimensions of the two tasks have different optimal values. Based on these properties, the proposed cMTOP test suite is more challenging and can better evaluate the performance of EMTO algorithms. Finally, we analyze the performance of several state-of-the-art EMTO algorithms on this new and challenging cMTOP test suite.
一个新的更具挑战性的综合多任务优化问题测试套件
进化多任务优化(EMTO)是进化计算领域的一个新兴研究课题,旨在同时解决多个不同的优化任务。近年来,随着EMTO的发展,出现了许多多任务优化问题(MTOP)基准测试套件。然而,这些MTOP测试套件没有足够的挑战性。也就是说,这些mtop中的任务总是具有相同的维度,并且任务的对齐维度可以具有相关的物理意义或相似的最优值。为了解决现有MTOP测试套件的这些缺点,我们提出了一个新的更具挑战性的综合MTOP (cMTOP)测试套件。在这个测试套件中有10个cMTOP实例,每个实例包含两个任务。这些cMTOP实例具有三个属性,更具挑战性。首先,每个cMTOP中的任务具有不同的维数。其次,为了使两个任务的对齐维度具有不相关的物理意义,每个任务都是由几个基本功能组成的组合函数。第三,对cMTOP中的每个任务进行移动和旋转,使两个任务的对齐维度具有不同的最优值。基于这些特性,提出的cMTOP测试套件更具挑战性,可以更好地评估EMTO算法的性能。最后,我们分析了几种最先进的EMTO算法在这个新的和具有挑战性的cMTOP测试套件上的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信