基于可学习自监督支持向量机的多模态多目标优化个体选择策略

IF 8.1 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS
Xiaochuan Gao , Weiting Bai , Qianlong Dang , Shuai Yang , Guanghui Zhang
{"title":"基于可学习自监督支持向量机的多模态多目标优化个体选择策略","authors":"Xiaochuan Gao ,&nbsp;Weiting Bai ,&nbsp;Qianlong Dang ,&nbsp;Shuai Yang ,&nbsp;Guanghui Zhang","doi":"10.1016/j.ins.2024.121553","DOIUrl":null,"url":null,"abstract":"<div><div>Multimodal multi-objective optimization problem (MMOP) is a frontier research problem, which can provide decision makers with more choices without making trade-offs. Many multimodal multi-objective evolutionary algorithms (MMOEAs) have been proposed to solve MMOP. However, most MMOEAs tend to prioritize the objective dominance of individuals in the process of individual selection, and only individuals with the same objective dominance will be considered the diversity, which leads to the loss of many promising solutions. To solve the above problem, this paper proposes a learnable self-supervised support vector machine (SVM) based multimodal multi-objective optimization algorithm (SVMEA). Support vector machine can learn the knowledge about distinguishing the advantages and disadvantages of individuals from the data in the existing training set and select individuals, in which the objective dominance of individuals is as important as diversity. Moreover, a crowding distance calculation method based on Manhattan distance is designed. Compared with the traditional method using Euclidean distance to calculate crowding distance, it can better evaluate the diversity of individuals in the decision space and assist the selection of elite solutions. Experimental results show that the proposed SVMEA is competitive with seven other advanced MMOEAs on 34 benchmark problems and a practical application problem.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"690 ","pages":"Article 121553"},"PeriodicalIF":8.1000,"publicationDate":"2024-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Learnable self-supervised support vector machine based individual selection strategy for multimodal multi-objective optimization\",\"authors\":\"Xiaochuan Gao ,&nbsp;Weiting Bai ,&nbsp;Qianlong Dang ,&nbsp;Shuai Yang ,&nbsp;Guanghui Zhang\",\"doi\":\"10.1016/j.ins.2024.121553\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Multimodal multi-objective optimization problem (MMOP) is a frontier research problem, which can provide decision makers with more choices without making trade-offs. Many multimodal multi-objective evolutionary algorithms (MMOEAs) have been proposed to solve MMOP. However, most MMOEAs tend to prioritize the objective dominance of individuals in the process of individual selection, and only individuals with the same objective dominance will be considered the diversity, which leads to the loss of many promising solutions. To solve the above problem, this paper proposes a learnable self-supervised support vector machine (SVM) based multimodal multi-objective optimization algorithm (SVMEA). Support vector machine can learn the knowledge about distinguishing the advantages and disadvantages of individuals from the data in the existing training set and select individuals, in which the objective dominance of individuals is as important as diversity. Moreover, a crowding distance calculation method based on Manhattan distance is designed. Compared with the traditional method using Euclidean distance to calculate crowding distance, it can better evaluate the diversity of individuals in the decision space and assist the selection of elite solutions. Experimental results show that the proposed SVMEA is competitive with seven other advanced MMOEAs on 34 benchmark problems and a practical application problem.</div></div>\",\"PeriodicalId\":51063,\"journal\":{\"name\":\"Information Sciences\",\"volume\":\"690 \",\"pages\":\"Article 121553\"},\"PeriodicalIF\":8.1000,\"publicationDate\":\"2024-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Sciences\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0020025524014671\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"0\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025524014671","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

多模态多目标优化问题(MMOP)是一个前沿研究问题,它能为决策者提供更多选择,而无需做出权衡。许多多模态多目标进化算法(MMOEAs)被提出来解决多模态多目标优化问题。然而,大多数多目标进化算法在个体选择过程中倾向于优先考虑个体的目标优势,只有目标优势相同的个体才会被认为是多样性的,这就导致了许多有希望的解决方案的丢失。为了解决上述问题,本文提出了一种基于可学习自监督支持向量机(SVM)的多模态多目标优化算法(SVMEA)。支持向量机可以从现有训练集中的数据中学习区分个体优劣的知识,并选择个体,其中个体的目标主导性与多样性同等重要。此外,还设计了一种基于曼哈顿距离的拥挤距离计算方法。与使用欧氏距离计算拥挤距离的传统方法相比,它能更好地评估决策空间中个体的多样性,并帮助选择精英解。实验结果表明,在 34 个基准问题和一个实际应用问题上,所提出的 SVMEA 与其他七种先进的 MMOEA 相比具有很强的竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Learnable self-supervised support vector machine based individual selection strategy for multimodal multi-objective optimization
Multimodal multi-objective optimization problem (MMOP) is a frontier research problem, which can provide decision makers with more choices without making trade-offs. Many multimodal multi-objective evolutionary algorithms (MMOEAs) have been proposed to solve MMOP. However, most MMOEAs tend to prioritize the objective dominance of individuals in the process of individual selection, and only individuals with the same objective dominance will be considered the diversity, which leads to the loss of many promising solutions. To solve the above problem, this paper proposes a learnable self-supervised support vector machine (SVM) based multimodal multi-objective optimization algorithm (SVMEA). Support vector machine can learn the knowledge about distinguishing the advantages and disadvantages of individuals from the data in the existing training set and select individuals, in which the objective dominance of individuals is as important as diversity. Moreover, a crowding distance calculation method based on Manhattan distance is designed. Compared with the traditional method using Euclidean distance to calculate crowding distance, it can better evaluate the diversity of individuals in the decision space and assist the selection of elite solutions. Experimental results show that the proposed SVMEA is competitive with seven other advanced MMOEAs on 34 benchmark problems and a practical application problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
×
引用
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学术官方微信