基于聚类系数和特征距离的分集引导量子粒子群优化算法

Wei Zhao, Ye San
{"title":"基于聚类系数和特征距离的分集引导量子粒子群优化算法","authors":"Wei Zhao, Ye San","doi":"10.1109/ISSCAA.2010.5633144","DOIUrl":null,"url":null,"abstract":"Aiming at the drawback of being easily trapped into the local optima and premature convergence in quantum-behaved particle swarm optimization algorithm, clustering coefficient and characteristic distance is proposed to measure diversity of the population by which quantum-behaved particle swarm optimization algorithm is guided. The population is divergent to increase population diversity and enhance exploration if clustering coefficient is large and characteristic distance is small; the population is convergent to reduce population diversity and enhance exploitation if clustering coefficient is small and characteristic distance is large. The simulation results of testing four benchmark functions show that diversity-guided quantum-behaved particle swarm optimization algorithm based on clustering coefficient and characteristic distance has better optimization performance than other algorithms, the validity and feasibility of the method is verified.","PeriodicalId":324652,"journal":{"name":"2010 3rd International Symposium on Systems and Control in Aeronautics and Astronautics","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Diversity-guided quantum-behaved particle swarm optimization algorithm based on clustering coefficient and characteristic distance\",\"authors\":\"Wei Zhao, Ye San\",\"doi\":\"10.1109/ISSCAA.2010.5633144\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Aiming at the drawback of being easily trapped into the local optima and premature convergence in quantum-behaved particle swarm optimization algorithm, clustering coefficient and characteristic distance is proposed to measure diversity of the population by which quantum-behaved particle swarm optimization algorithm is guided. The population is divergent to increase population diversity and enhance exploration if clustering coefficient is large and characteristic distance is small; the population is convergent to reduce population diversity and enhance exploitation if clustering coefficient is small and characteristic distance is large. The simulation results of testing four benchmark functions show that diversity-guided quantum-behaved particle swarm optimization algorithm based on clustering coefficient and characteristic distance has better optimization performance than other algorithms, the validity and feasibility of the method is verified.\",\"PeriodicalId\":324652,\"journal\":{\"name\":\"2010 3rd International Symposium on Systems and Control in Aeronautics and Astronautics\",\"volume\":\"102 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 3rd International Symposium on Systems and Control in Aeronautics and Astronautics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSCAA.2010.5633144\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 3rd International Symposium on Systems and Control in Aeronautics and Astronautics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSCAA.2010.5633144","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

针对量子粒子群优化算法容易陷入局部最优和过早收敛的缺点,提出用聚类系数和特征距离来度量种群的多样性,以此来指导量子粒子群优化算法。聚类系数大,特征距离小,种群发散,增加种群多样性,加强探索;当聚类系数较小时,特征距离较大时,种群会趋于收敛,从而减少种群多样性,促进开发。测试4个基准函数的仿真结果表明,基于聚类系数和特征距离的分集引导量子粒子群优化算法比其他算法具有更好的优化性能,验证了该方法的有效性和可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Diversity-guided quantum-behaved particle swarm optimization algorithm based on clustering coefficient and characteristic distance
Aiming at the drawback of being easily trapped into the local optima and premature convergence in quantum-behaved particle swarm optimization algorithm, clustering coefficient and characteristic distance is proposed to measure diversity of the population by which quantum-behaved particle swarm optimization algorithm is guided. The population is divergent to increase population diversity and enhance exploration if clustering coefficient is large and characteristic distance is small; the population is convergent to reduce population diversity and enhance exploitation if clustering coefficient is small and characteristic distance is large. The simulation results of testing four benchmark functions show that diversity-guided quantum-behaved particle swarm optimization algorithm based on clustering coefficient and characteristic distance has better optimization performance than other algorithms, the validity and feasibility of the method is verified.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The application of signal analysis in the nuclear power system under ocean conditions The application of wavelet filtering on denoising hemispherical resonator gyro signal Research on signal de-noising technique for MEMS gyro The correction of spaceborne satellite's yaw steering law based on the star tracker high-precision measurement Application of magneto-rheological (MR) damper in landing gear shimmy
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1