A PSO Algorithm with Multi-Grouping and Two-Layer Structure

T. Zeng, Chuanjian Wang, Zhangliang Wei
{"title":"A PSO Algorithm with Multi-Grouping and Two-Layer Structure","authors":"T. Zeng, Chuanjian Wang, Zhangliang Wei","doi":"10.1109/ICDSBA48748.2019.00015","DOIUrl":null,"url":null,"abstract":"A PSO (particle swarm optimization) algorithm with multiple groups and two-layer structure(MTPSO) is proposed. First, the whole particle swarm is divided into several groups, each one is optimized. For enhance efficiency in the optimization process, each particle adopts a mixed algorithm of negative gradient. Secondly, according to the function value of each particle solution, the particle group is divided into two structures: the elite layer and the ordinary layer. In the algorithm initialization phase, the particles with the best value in each group are selected into the elite layer. The particles in the elite layer are relatively fixed and regularly selected (similar to the parliamentary mechanism in human society), that is, each elite layer as a whole. After several iterations of optimization calculations in the same way as the normal layer, the new elite layer is formed again according to the previou method. The optimal solution calculated by the elite layer is added as a global optimal solution to the position update formula of each particle. Similarly, the optimal solution for the common layer is also added to the update formula for each particle in the elite layer. It reflects the upper and lower particle’s mutual penetration and mutual influence of. Simulation experiments show the proposed algorithm is able to avoid premature and powerful global optimization ability and fast convergence, PSO’s computing efficiency.","PeriodicalId":382429,"journal":{"name":"2019 3rd International Conference on Data Science and Business Analytics (ICDSBA)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 3rd International Conference on Data Science and Business Analytics (ICDSBA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDSBA48748.2019.00015","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A PSO (particle swarm optimization) algorithm with multiple groups and two-layer structure(MTPSO) is proposed. First, the whole particle swarm is divided into several groups, each one is optimized. For enhance efficiency in the optimization process, each particle adopts a mixed algorithm of negative gradient. Secondly, according to the function value of each particle solution, the particle group is divided into two structures: the elite layer and the ordinary layer. In the algorithm initialization phase, the particles with the best value in each group are selected into the elite layer. The particles in the elite layer are relatively fixed and regularly selected (similar to the parliamentary mechanism in human society), that is, each elite layer as a whole. After several iterations of optimization calculations in the same way as the normal layer, the new elite layer is formed again according to the previou method. The optimal solution calculated by the elite layer is added as a global optimal solution to the position update formula of each particle. Similarly, the optimal solution for the common layer is also added to the update formula for each particle in the elite layer. It reflects the upper and lower particle’s mutual penetration and mutual influence of. Simulation experiments show the proposed algorithm is able to avoid premature and powerful global optimization ability and fast convergence, PSO’s computing efficiency.
一种多分组双层结构粒子群算法
提出了一种多群双层结构粒子群优化算法(MTPSO)。首先,将整个粒子群划分为若干组,并对每组进行优化。为了提高优化过程的效率,每个粒子采用负梯度混合算法。其次,根据各粒子溶液的功能值,将粒子群划分为精英层和普通层两种结构。在算法初始化阶段,将每组中值最优的粒子选择到精英层。精英层中的粒子是相对固定的、有规律的选择(类似于人类社会的议会机制),即每个精英层作为一个整体。按照与正常层相同的方法进行多次迭代优化计算后,根据前面的方法重新形成新的精英层。将精英层计算出的最优解作为全局最优解加入到每个粒子的位置更新公式中。同样,普通层的最优解也被添加到精英层中每个粒子的更新公式中。它反映了上下粒子的相互渗透和相互影响。仿真实验表明,该算法具有避免过早全局优化能力强、收敛速度快等优点,提高了粒子群算法的计算效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信