模糊参数粒子群优化

P. Yadmellat, S. Salehizadeh, M. Menhaj
{"title":"模糊参数粒子群优化","authors":"P. Yadmellat, S. Salehizadeh, M. Menhaj","doi":"10.1109/ICINIS.2008.111","DOIUrl":null,"url":null,"abstract":"This paper proposes a new fuzzy tuned parameter particle swarm optimization (FPPSO) which remarkably outperforms the standard PSO as well as the previous fuzzy based approaches. Two benchmark functions with asymmetric initial range settings are used to validate the proposed algorithm and compare its performance with that of the other algorithms known as fuzzy based PSO. Numerical results indicate that FPPSO is considerably competitive due to its ability to find the functions' global optimum as well as its better convergence performance..","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Fuzzy Parameter Particle Swarm Optimization\",\"authors\":\"P. Yadmellat, S. Salehizadeh, M. Menhaj\",\"doi\":\"10.1109/ICINIS.2008.111\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a new fuzzy tuned parameter particle swarm optimization (FPPSO) which remarkably outperforms the standard PSO as well as the previous fuzzy based approaches. Two benchmark functions with asymmetric initial range settings are used to validate the proposed algorithm and compare its performance with that of the other algorithms known as fuzzy based PSO. Numerical results indicate that FPPSO is considerably competitive due to its ability to find the functions' global optimum as well as its better convergence performance..\",\"PeriodicalId\":185739,\"journal\":{\"name\":\"2008 First International Conference on Intelligent Networks and Intelligent Systems\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 First International Conference on Intelligent Networks and Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICINIS.2008.111\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 First International Conference on Intelligent Networks and Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICINIS.2008.111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

本文提出了一种新的模糊调谐参数粒子群优化算法(FPPSO),该算法明显优于标准粒子群优化算法和以往基于模糊的粒子群优化算法。使用两个具有非对称初始范围设置的基准函数来验证所提出的算法,并将其与其他称为基于模糊的粒子群算法的性能进行比较。数值结果表明,FPPSO具有较好的全局最优寻优能力和较好的收敛性能,具有很强的竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fuzzy Parameter Particle Swarm Optimization
This paper proposes a new fuzzy tuned parameter particle swarm optimization (FPPSO) which remarkably outperforms the standard PSO as well as the previous fuzzy based approaches. Two benchmark functions with asymmetric initial range settings are used to validate the proposed algorithm and compare its performance with that of the other algorithms known as fuzzy based PSO. Numerical results indicate that FPPSO is considerably competitive due to its ability to find the functions' global optimum as well as its better convergence performance..
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信