Inner Product Based Particle Swarm Optimization

Xinchao Zhao, Jia Liu, Jiaqi Chen, Min Chen, Sai Guo, X. Zuo
{"title":"Inner Product Based Particle Swarm Optimization","authors":"Xinchao Zhao, Jia Liu, Jiaqi Chen, Min Chen, Sai Guo, X. Zuo","doi":"10.1109/FSKD.2018.8686896","DOIUrl":null,"url":null,"abstract":"Standard Particle Swarm Optimization (SPSO)is a well-known and very competitive swarm optimization approach, which is designed by Particle Swarm Central. In all PSO variants, the relative position relation between the individual and the global optimal position has important influences on the performance of algorithms. In this paper, an alternative Standard Particle Swarm Optimization (SPSO 2007)is proposed, which is based on the inner product of difference vectors. One particle will confuse which solution it should learn from when the global best and the personal best positions have comparable attractions to different directions during its velocity updating process. Even the oscillation phenomenon will appear that the global best solution draws the particle close to it at one generation and the personal best solution draws the particle back to it at next generation. In order to overcome this phenomenon particle adopts different velocity update strategies when the angle between difference vectors is either acute or obtuse of two directions in this paper. Two difference vectors refer to the current particle to the global and the personal best solutions. The vector level and the component level inner product based PSOs are proposed, denoted as IPSPSO2007V and IPSPSO2007C respectively. They are analyzed firstly and then compared with SPSO2007 with IEEE CEC2015 benchmarks, which indicate that two inner product based PSOs show promising performance.","PeriodicalId":235481,"journal":{"name":"2018 14th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"212 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 14th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FSKD.2018.8686896","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Standard Particle Swarm Optimization (SPSO)is a well-known and very competitive swarm optimization approach, which is designed by Particle Swarm Central. In all PSO variants, the relative position relation between the individual and the global optimal position has important influences on the performance of algorithms. In this paper, an alternative Standard Particle Swarm Optimization (SPSO 2007)is proposed, which is based on the inner product of difference vectors. One particle will confuse which solution it should learn from when the global best and the personal best positions have comparable attractions to different directions during its velocity updating process. Even the oscillation phenomenon will appear that the global best solution draws the particle close to it at one generation and the personal best solution draws the particle back to it at next generation. In order to overcome this phenomenon particle adopts different velocity update strategies when the angle between difference vectors is either acute or obtuse of two directions in this paper. Two difference vectors refer to the current particle to the global and the personal best solutions. The vector level and the component level inner product based PSOs are proposed, denoted as IPSPSO2007V and IPSPSO2007C respectively. They are analyzed firstly and then compared with SPSO2007 with IEEE CEC2015 benchmarks, which indicate that two inner product based PSOs show promising performance.
基于内积的粒子群优化
标准粒子群算法(Standard Particle Swarm Optimization, SPSO)是由Particle Swarm Central设计的一种著名的、竞争激烈的群体优化方法。在所有PSO变体中,个体与全局最优位置之间的相对位置关系对算法的性能有重要影响。本文提出了一种基于差分向量内积的标准粒子群优化算法(SPSO 2007)。在速度更新过程中,当全局最佳位置和个人最佳位置对不同方向具有可比吸引力时,一个粒子会混淆它应该学习哪个解。甚至振荡现象也会出现:全局最优解在一代时使粒子靠近它,而个人最优解在下一代时又使粒子靠近它。为了克服这一现象,本文在不同矢量夹角为两个方向的锐角或钝角时,粒子采用不同的速度更新策略。两个差分向量是指当前粒子对全局和个人的最优解。提出了基于矢量级和分量级内积的pso,分别记为IPSPSO2007V和IPSPSO2007C。首先对它们进行了分析,然后将其与SPSO2007和IEEE CEC2015基准进行了比较,结果表明两种基于内积的pso具有良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信