An improved CPSO algorithm

B. Borowska
{"title":"An improved CPSO algorithm","authors":"B. Borowska","doi":"10.1109/STC-CSIT.2016.7589854","DOIUrl":null,"url":null,"abstract":"This paper presents an improved particle swarm optimization algorithm (CPSO) in which corrective procedure was introduced. The aim of this corrective procedure is to set new, better velocities for some particles when their present velocities are inefficient. New velocities are the functions of previous and current velocities. The presented algorithm was tested with a set of benchmark functions and analyzed both in terms of their efficiency, premature convergence and the ability to avoid local optima. The results of the tests were compared with those obtained through the standard PSO and IPSO to demonstrate the superiority of CPSO.","PeriodicalId":433594,"journal":{"name":"2016 XIth International Scientific and Technical Conference Computer Sciences and Information Technologies (CSIT)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 XIth International Scientific and Technical Conference Computer Sciences and Information Technologies (CSIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/STC-CSIT.2016.7589854","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

This paper presents an improved particle swarm optimization algorithm (CPSO) in which corrective procedure was introduced. The aim of this corrective procedure is to set new, better velocities for some particles when their present velocities are inefficient. New velocities are the functions of previous and current velocities. The presented algorithm was tested with a set of benchmark functions and analyzed both in terms of their efficiency, premature convergence and the ability to avoid local optima. The results of the tests were compared with those obtained through the standard PSO and IPSO to demonstrate the superiority of CPSO.
一种改进的CPSO算法
本文提出了一种改进的粒子群优化算法(CPSO),并引入了修正过程。这种修正程序的目的是在某些粒子的现有速度无效时,为它们设定新的、更好的速度。新速度是先前速度和当前速度的函数。用一组基准函数对算法进行了测试,分析了算法的效率、过早收敛性和避免局部最优的能力。将实验结果与标准PSO和IPSO进行了比较,证明了CPSO的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信