基于竞争机制的多目标粒子群优化算法

Zhenguo Miao, Lei Zhang
{"title":"基于竞争机制的多目标粒子群优化算法","authors":"Zhenguo Miao, Lei Zhang","doi":"10.1109/ICAIE53562.2021.00038","DOIUrl":null,"url":null,"abstract":"The performance of existing multi-objective particle swarm optimization algorithms largely depends on the global or individual optimal particles stored in the external archive. To simplify the process, a multi-objective particle swarm optimization algorithm with competition mechanism has been proposed. The algorithm maintains the diversity of the population through the max and min angle between the general individual and the more excellent individual. The performance of the proposed NMOPSO is verified by comparing with three advanced multi-objective algorithms. Experimental results show that the method has good performance in optimization quality and convergence speed.","PeriodicalId":285278,"journal":{"name":"2021 2nd International Conference on Artificial Intelligence and Education (ICAIE)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Multi-objective particle swarm optimization algorithm based on competition mechanism\",\"authors\":\"Zhenguo Miao, Lei Zhang\",\"doi\":\"10.1109/ICAIE53562.2021.00038\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The performance of existing multi-objective particle swarm optimization algorithms largely depends on the global or individual optimal particles stored in the external archive. To simplify the process, a multi-objective particle swarm optimization algorithm with competition mechanism has been proposed. The algorithm maintains the diversity of the population through the max and min angle between the general individual and the more excellent individual. The performance of the proposed NMOPSO is verified by comparing with three advanced multi-objective algorithms. Experimental results show that the method has good performance in optimization quality and convergence speed.\",\"PeriodicalId\":285278,\"journal\":{\"name\":\"2021 2nd International Conference on Artificial Intelligence and Education (ICAIE)\",\"volume\":\"101 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 2nd International Conference on Artificial Intelligence and Education (ICAIE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAIE53562.2021.00038\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 2nd International Conference on Artificial Intelligence and Education (ICAIE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAIE53562.2021.00038","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

现有的多目标粒子群优化算法的性能在很大程度上取决于存储在外部存档中的全局或单个最优粒子。为了简化这一过程,提出了一种带有竞争机制的多目标粒子群优化算法。该算法通过一般个体与最优个体之间的最大最小夹角来保持种群的多样性。通过与三种先进的多目标算法的比较,验证了该算法的性能。实验结果表明,该方法在优化质量和收敛速度方面具有良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-objective particle swarm optimization algorithm based on competition mechanism
The performance of existing multi-objective particle swarm optimization algorithms largely depends on the global or individual optimal particles stored in the external archive. To simplify the process, a multi-objective particle swarm optimization algorithm with competition mechanism has been proposed. The algorithm maintains the diversity of the population through the max and min angle between the general individual and the more excellent individual. The performance of the proposed NMOPSO is verified by comparing with three advanced multi-objective algorithms. Experimental results show that the method has good performance in optimization quality and convergence speed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信