一种改进的具有相关随机系数的混合粒子群全局优化算法

Shanhe Jiang, Chaolong Zhang, Wenjin Wu, Yanmei Li
{"title":"一种改进的具有相关随机系数的混合粒子群全局优化算法","authors":"Shanhe Jiang, Chaolong Zhang, Wenjin Wu, Yanmei Li","doi":"10.1109/YAC.2018.8406456","DOIUrl":null,"url":null,"abstract":"In this paper, an improved hybrid particle swarm optimization (IHPSO) was proposed by using the learning strategies framework of the particle swarm optimization (PSO), and adapting the gravitational search algorithm (GSA) into the PSO. To be specific, the IHPSO adopts three learning strategies, namely dependent random coefficients, fixed iteration interval cycle, and adaptive evolution stagnation cycle. The particle first enters into the PSO stage and updates its velocity based on the first strategy to enhance the exploration ability. Particles that fail to improve their fitness then enter into the GSA operators in terms of the latter two strategies to decrease the computational cost in the hybridization. To evaluate the effectiveness and feasibility of the IHPSO, the simulations were performed on various test functions. Results reveal that the IHPSO exhibits superior performance in terms of accuracy, reliability and efficiency compared to PSO, GSA and other recently developed hybrid variants.","PeriodicalId":226586,"journal":{"name":"2018 33rd Youth Academic Annual Conference of Chinese Association of Automation (YAC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An improved hybrid particle swarm optimization with dependent random coefficients for global optimization\",\"authors\":\"Shanhe Jiang, Chaolong Zhang, Wenjin Wu, Yanmei Li\",\"doi\":\"10.1109/YAC.2018.8406456\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an improved hybrid particle swarm optimization (IHPSO) was proposed by using the learning strategies framework of the particle swarm optimization (PSO), and adapting the gravitational search algorithm (GSA) into the PSO. To be specific, the IHPSO adopts three learning strategies, namely dependent random coefficients, fixed iteration interval cycle, and adaptive evolution stagnation cycle. The particle first enters into the PSO stage and updates its velocity based on the first strategy to enhance the exploration ability. Particles that fail to improve their fitness then enter into the GSA operators in terms of the latter two strategies to decrease the computational cost in the hybridization. To evaluate the effectiveness and feasibility of the IHPSO, the simulations were performed on various test functions. Results reveal that the IHPSO exhibits superior performance in terms of accuracy, reliability and efficiency compared to PSO, GSA and other recently developed hybrid variants.\",\"PeriodicalId\":226586,\"journal\":{\"name\":\"2018 33rd Youth Academic Annual Conference of Chinese Association of Automation (YAC)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 33rd Youth Academic Annual Conference of Chinese Association of Automation (YAC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/YAC.2018.8406456\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 33rd Youth Academic Annual Conference of Chinese Association of Automation (YAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/YAC.2018.8406456","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

本文利用粒子群算法的学习策略框架,将引力搜索算法引入到混合粒子群算法中,提出了一种改进的混合粒子群算法。具体来说,IHPSO采用了依赖随机系数、固定迭代间隔周期和自适应进化停滞周期三种学习策略。粒子首先进入粒子群阶段,根据第一策略更新速度,增强探测能力。对于适应度没有提高的粒子,采用后两种策略进入GSA算子,以减少杂交的计算成本。为了评估IHPSO的有效性和可行性,对各种测试功能进行了模拟。结果表明,IHPSO在准确性、可靠性和效率方面优于PSO、GSA和其他新开发的混合变体。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An improved hybrid particle swarm optimization with dependent random coefficients for global optimization
In this paper, an improved hybrid particle swarm optimization (IHPSO) was proposed by using the learning strategies framework of the particle swarm optimization (PSO), and adapting the gravitational search algorithm (GSA) into the PSO. To be specific, the IHPSO adopts three learning strategies, namely dependent random coefficients, fixed iteration interval cycle, and adaptive evolution stagnation cycle. The particle first enters into the PSO stage and updates its velocity based on the first strategy to enhance the exploration ability. Particles that fail to improve their fitness then enter into the GSA operators in terms of the latter two strategies to decrease the computational cost in the hybridization. To evaluate the effectiveness and feasibility of the IHPSO, the simulations were performed on various test functions. Results reveal that the IHPSO exhibits superior performance in terms of accuracy, reliability and efficiency compared to PSO, GSA and other recently developed hybrid variants.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A local multi-robot cooperative formation control Data-driven policy learning strategy for nonlinear robust control with unknown perturbation Inverse kinematics of 7-DOF redundant manipulators with arbitrary offsets based on augmented Jacobian On supply demand coordination in vehicle-to-grid — A brief literature review Trajectory tracking control for mobile robots based on second order fast terminal sliding mode
×
引用
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