当前最佳粒子群算法

Ashmita Roy Medha, Saroj K. Biswas, Muskan Gupta, Arpita Nath Boruah, Rahul Kumar, Vivek Verma, B. Purkayastha
{"title":"当前最佳粒子群算法","authors":"Ashmita Roy Medha, Saroj K. Biswas, Muskan Gupta, Arpita Nath Boruah, Rahul Kumar, Vivek Verma, B. Purkayastha","doi":"10.1109/IATMSI56455.2022.10119383","DOIUrl":null,"url":null,"abstract":"Particle Swarm Optimization (PSO) is a metaheuristic optimization method based on swarm intelligence. Due to its flexibility and ability to produce optimum performance, it is commonly used in various applications. While PSO has been used extensively to provide solutions to various complicated problems in engineering, it has also many deficiencies. Several improved PSO techniques have been proposed to compensate these deficiencies. However, there are still some scopes of improvement in its components. In this work, we have proposed an improvised PSO called Current-best Particle Swarm Optimization (CPSO) which introduces a new parameter called “cbest” that has been used in the social component of PSO to overcome the local minima issue. The suggested model, CPSO, has differentiate with the basic PSO method and the Iterative (ibest) PSO method using some optimization functions. The findings indicate that the recommended model outperforms the other models.","PeriodicalId":221211,"journal":{"name":"2022 IEEE Conference on Interdisciplinary Approaches in Technology and Management for Social Innovation (IATMSI)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Current-best Particle Swarm Optimization\",\"authors\":\"Ashmita Roy Medha, Saroj K. Biswas, Muskan Gupta, Arpita Nath Boruah, Rahul Kumar, Vivek Verma, B. Purkayastha\",\"doi\":\"10.1109/IATMSI56455.2022.10119383\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Particle Swarm Optimization (PSO) is a metaheuristic optimization method based on swarm intelligence. Due to its flexibility and ability to produce optimum performance, it is commonly used in various applications. While PSO has been used extensively to provide solutions to various complicated problems in engineering, it has also many deficiencies. Several improved PSO techniques have been proposed to compensate these deficiencies. However, there are still some scopes of improvement in its components. In this work, we have proposed an improvised PSO called Current-best Particle Swarm Optimization (CPSO) which introduces a new parameter called “cbest” that has been used in the social component of PSO to overcome the local minima issue. The suggested model, CPSO, has differentiate with the basic PSO method and the Iterative (ibest) PSO method using some optimization functions. The findings indicate that the recommended model outperforms the other models.\",\"PeriodicalId\":221211,\"journal\":{\"name\":\"2022 IEEE Conference on Interdisciplinary Approaches in Technology and Management for Social Innovation (IATMSI)\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE Conference on Interdisciplinary Approaches in Technology and Management for Social Innovation (IATMSI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IATMSI56455.2022.10119383\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Conference on Interdisciplinary Approaches in Technology and Management for Social Innovation (IATMSI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IATMSI56455.2022.10119383","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

粒子群优化(PSO)是一种基于群体智能的元启发式优化方法。由于其灵活性和产生最佳性能的能力,它通常用于各种应用中。粒子群算法在广泛应用于解决工程中各种复杂问题的同时,也存在许多不足。为了弥补这些不足,提出了几种改进的PSO技术。然而,其组成部分仍有一些改进的余地。在这项工作中,我们提出了一种称为当前最佳粒子群优化(CPSO)的临时粒子群优化算法,该算法引入了一个名为“cbest”的新参数,该参数已用于粒子群优化算法的社会部分,以克服局部最小问题。该模型与基本粒子群算法和使用一些优化函数的迭代(ibest)粒子群算法有所区别。结果表明,所推荐的模型优于其他模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Current-best Particle Swarm Optimization
Particle Swarm Optimization (PSO) is a metaheuristic optimization method based on swarm intelligence. Due to its flexibility and ability to produce optimum performance, it is commonly used in various applications. While PSO has been used extensively to provide solutions to various complicated problems in engineering, it has also many deficiencies. Several improved PSO techniques have been proposed to compensate these deficiencies. However, there are still some scopes of improvement in its components. In this work, we have proposed an improvised PSO called Current-best Particle Swarm Optimization (CPSO) which introduces a new parameter called “cbest” that has been used in the social component of PSO to overcome the local minima issue. The suggested model, CPSO, has differentiate with the basic PSO method and the Iterative (ibest) PSO method using some optimization functions. The findings indicate that the recommended model outperforms the other models.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信