基于改进学习策略和交叉算子的简化粒子群算法

M. Nazari, M. Esnaashari, Mohammadreza Parvizimosaed, A. Damia
{"title":"基于改进学习策略和交叉算子的简化粒子群算法","authors":"M. Nazari, M. Esnaashari, Mohammadreza Parvizimosaed, A. Damia","doi":"10.1109/CSICC58665.2023.10105402","DOIUrl":null,"url":null,"abstract":"In terms of balancing the exploration and exploitation capabilities of the PSO method in order to increase its resilience, this work provides a unique particle swarm optimization with enhanced learning techniques and a crossover operator (LSCPSO). Each particle is updated depending on the simplified equations in the first stage. The proposed LSCPSO method then employs a self-learning technique in which each particle (personal best) learns from k better particles in the current population. Then, a crossover step is introduced to the algorithm in the subsequent stage. After taking the k global best (gbest particle), the crossover is performed. This method strengthens the LSCPSO algorithm's capacity for social learning and global exploration. In subsequent trials, the performance of the LSCPSO algorithm is compared to that of five sample PSO variations. The benchmark function test results show that the proposed ILSPSO algorithm has much better overall performance than the other PSO variations that were looked at.","PeriodicalId":127277,"journal":{"name":"2023 28th International Computer Conference, Computer Society of Iran (CSICC)","volume":"32 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Noval Reduced Particle Swarm Optimization With Improved Learning Strategy and Crossover Operator\",\"authors\":\"M. Nazari, M. Esnaashari, Mohammadreza Parvizimosaed, A. Damia\",\"doi\":\"10.1109/CSICC58665.2023.10105402\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In terms of balancing the exploration and exploitation capabilities of the PSO method in order to increase its resilience, this work provides a unique particle swarm optimization with enhanced learning techniques and a crossover operator (LSCPSO). Each particle is updated depending on the simplified equations in the first stage. The proposed LSCPSO method then employs a self-learning technique in which each particle (personal best) learns from k better particles in the current population. Then, a crossover step is introduced to the algorithm in the subsequent stage. After taking the k global best (gbest particle), the crossover is performed. This method strengthens the LSCPSO algorithm's capacity for social learning and global exploration. In subsequent trials, the performance of the LSCPSO algorithm is compared to that of five sample PSO variations. The benchmark function test results show that the proposed ILSPSO algorithm has much better overall performance than the other PSO variations that were looked at.\",\"PeriodicalId\":127277,\"journal\":{\"name\":\"2023 28th International Computer Conference, Computer Society of Iran (CSICC)\",\"volume\":\"32 3\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 28th International Computer Conference, Computer Society of Iran (CSICC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSICC58665.2023.10105402\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 28th International Computer Conference, Computer Society of Iran (CSICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSICC58665.2023.10105402","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在平衡粒子群算法的探索和开发能力以提高其弹性方面,本研究提供了一种独特的粒子群优化方法,该方法具有增强的学习技术和交叉算子(LSCPSO)。每个粒子根据第一阶段的简化方程进行更新。提出的LSCPSO方法采用了一种自学习技术,其中每个粒子(个人最佳)从当前种群中的k个更好的粒子中学习。然后,在后续阶段的算法中引入交叉步骤。取k个全局最优(gbest particle)后,进行交叉。该方法增强了LSCPSO算法的社会学习能力和全局探索能力。在随后的试验中,将LSCPSO算法的性能与五个样本PSO变量的性能进行了比较。基准函数测试结果表明,所提出的ILSPSO算法比其他的PSO算法具有更好的整体性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Noval Reduced Particle Swarm Optimization With Improved Learning Strategy and Crossover Operator
In terms of balancing the exploration and exploitation capabilities of the PSO method in order to increase its resilience, this work provides a unique particle swarm optimization with enhanced learning techniques and a crossover operator (LSCPSO). Each particle is updated depending on the simplified equations in the first stage. The proposed LSCPSO method then employs a self-learning technique in which each particle (personal best) learns from k better particles in the current population. Then, a crossover step is introduced to the algorithm in the subsequent stage. After taking the k global best (gbest particle), the crossover is performed. This method strengthens the LSCPSO algorithm's capacity for social learning and global exploration. In subsequent trials, the performance of the LSCPSO algorithm is compared to that of five sample PSO variations. The benchmark function test results show that the proposed ILSPSO algorithm has much better overall performance than the other PSO variations that were looked at.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信