基于拥挤距离和轮盘赌的多目标粒子群优化方法

R. A. Santana, M. R. Pontes, C. J. A. B. Filho
{"title":"基于拥挤距离和轮盘赌的多目标粒子群优化方法","authors":"R. A. Santana, M. R. Pontes, C. J. A. B. Filho","doi":"10.1109/ISDA.2009.73","DOIUrl":null,"url":null,"abstract":"This paper presents a multiobjective optimization algorithm based on Particle Swarm Optimization (MOPSO-CDR) that uses a diversity mechanism called crowding distance to select the social leaders and the cognitive leader. We also use the same mechanism to delete solutions of the external archive. The performance of our proposal was evaluated in five well known benchmark functions using four metrics previously presented in the literature. Our proposal was compared to other four multi objective optimization algorithms based on Particle Swarm Optimization, called m-DNPSO, CSS-MOPSO, MOPSO and MOPSO-CDLS. The results showed that the proposed approach is competitive when compared to the other approaches and outperforms the other algorithms in many cases.","PeriodicalId":330324,"journal":{"name":"2009 Ninth International Conference on Intelligent Systems Design and Applications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"58","resultStr":"{\"title\":\"A Multiple Objective Particle Swarm Optimization Approach Using Crowding Distance and Roulette Wheel\",\"authors\":\"R. A. Santana, M. R. Pontes, C. J. A. B. Filho\",\"doi\":\"10.1109/ISDA.2009.73\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a multiobjective optimization algorithm based on Particle Swarm Optimization (MOPSO-CDR) that uses a diversity mechanism called crowding distance to select the social leaders and the cognitive leader. We also use the same mechanism to delete solutions of the external archive. The performance of our proposal was evaluated in five well known benchmark functions using four metrics previously presented in the literature. Our proposal was compared to other four multi objective optimization algorithms based on Particle Swarm Optimization, called m-DNPSO, CSS-MOPSO, MOPSO and MOPSO-CDLS. The results showed that the proposed approach is competitive when compared to the other approaches and outperforms the other algorithms in many cases.\",\"PeriodicalId\":330324,\"journal\":{\"name\":\"2009 Ninth International Conference on Intelligent Systems Design and Applications\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"58\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Ninth International Conference on Intelligent Systems Design and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISDA.2009.73\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Ninth International Conference on Intelligent Systems Design and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISDA.2009.73","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 58

摘要

提出了一种基于粒子群算法(MOPSO-CDR)的多目标优化算法,该算法利用拥挤距离的多样性机制来选择社会领导者和认知领导者。我们还使用相同的机制来删除外部存档的解决方案。我们的建议的性能在五个众所周知的基准函数中进行评估,使用先前在文献中提出的四个指标。并与基于粒子群算法的m-DNPSO、CSS-MOPSO、MOPSO和MOPSO- cdls四种多目标优化算法进行了比较。结果表明,该方法与其他方法相比具有竞争力,并且在许多情况下优于其他算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Multiple Objective Particle Swarm Optimization Approach Using Crowding Distance and Roulette Wheel
This paper presents a multiobjective optimization algorithm based on Particle Swarm Optimization (MOPSO-CDR) that uses a diversity mechanism called crowding distance to select the social leaders and the cognitive leader. We also use the same mechanism to delete solutions of the external archive. The performance of our proposal was evaluated in five well known benchmark functions using four metrics previously presented in the literature. Our proposal was compared to other four multi objective optimization algorithms based on Particle Swarm Optimization, called m-DNPSO, CSS-MOPSO, MOPSO and MOPSO-CDLS. The results showed that the proposed approach is competitive when compared to the other approaches and outperforms the other algorithms in many cases.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信