Particle Swarm Optimization with Ring Topology for Multi-modal Multi-objective Problems

You-Chao Sun, Chaoli Sun
{"title":"Particle Swarm Optimization with Ring Topology for Multi-modal Multi-objective Problems","authors":"You-Chao Sun, Chaoli Sun","doi":"10.1145/3583131.3590382","DOIUrl":null,"url":null,"abstract":"Multi-modal multi-objective optimization problems (MMOPs) are ubiquitous in real-world applications, in which multiple objective functions are conflicting and need to be optimized simultaneously. Furthermore, multiple Pareto optimal solutions of MMOPs are mapped to the same point on the Pareto front. Canonical multi-objective optimization algorithms show poor performance for MMOPs due to the lack of diversity maintenance in the decision space. In this paper, a particle swarm optimization with ring topology, denoted as PSO-RT, is proposed for solving MMOPs. The population is firstly divided into several sub-populations based on a dynamic radius to form a ring topology. Then, each solution will update its position by learning from one of its personal best positions and the best position of its neighbors. The personal best position to be learned is selected based on the special crowding distance to improve the exploration capability, and the best position of its neighbors is selected according to the weighted indicator to speed up convergence. The performance of PSO-RT is evaluated on 22 test problems. Experimental results show that our proposed PSO-RT can obtain competitive or better results than some state-of-the-art algorithms proposed for MMOPs in terms of Pareto sets proximity (PSP) and inverted generational distance (IGDX) matrics.","PeriodicalId":89841,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference. Genetic and Evolutionary Computation Conference","volume":"632 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Genetic and Evolutionary Computation Conference. Genetic and Evolutionary Computation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3583131.3590382","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Multi-modal multi-objective optimization problems (MMOPs) are ubiquitous in real-world applications, in which multiple objective functions are conflicting and need to be optimized simultaneously. Furthermore, multiple Pareto optimal solutions of MMOPs are mapped to the same point on the Pareto front. Canonical multi-objective optimization algorithms show poor performance for MMOPs due to the lack of diversity maintenance in the decision space. In this paper, a particle swarm optimization with ring topology, denoted as PSO-RT, is proposed for solving MMOPs. The population is firstly divided into several sub-populations based on a dynamic radius to form a ring topology. Then, each solution will update its position by learning from one of its personal best positions and the best position of its neighbors. The personal best position to be learned is selected based on the special crowding distance to improve the exploration capability, and the best position of its neighbors is selected according to the weighted indicator to speed up convergence. The performance of PSO-RT is evaluated on 22 test problems. Experimental results show that our proposed PSO-RT can obtain competitive or better results than some state-of-the-art algorithms proposed for MMOPs in terms of Pareto sets proximity (PSP) and inverted generational distance (IGDX) matrics.
多模态多目标问题的环拓扑粒子群优化
多模态多目标优化问题在实际应用中普遍存在,其中多个目标函数相互冲突,需要同时进行优化。此外,将mmpp的多个Pareto最优解映射到Pareto前沿的同一点上。典型的多目标优化算法由于在决策空间中缺乏多样性维护而表现出较差的性能。本文提出了一种环拓扑粒子群优化算法,称为PSO-RT,用于求解mmmops问题。首先根据动态半径将种群划分为若干个子种群,形成环形拓扑结构;然后,每个解决方案将通过学习它自己的最佳位置和它的邻居的最佳位置来更新它的位置。根据特殊的拥挤距离选择需要学习的个人最佳位置以提高勘探能力,并根据加权指标选择其邻居的最佳位置以加快收敛速度。通过22个测试问题对PSO-RT的性能进行了评价。实验结果表明,在Pareto集接近度(PSP)和倒代距离(IGDX)矩阵方面,我们提出的PSO-RT算法可以获得与现有的mops算法相当或更好的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信
小红书