一种改进的随机惯性加权粒子群优化算法

A. Biswas, A. Lakra, Sharad Kumar, Avjeet Singh
{"title":"一种改进的随机惯性加权粒子群优化算法","authors":"A. Biswas, A. Lakra, Sharad Kumar, Avjeet Singh","doi":"10.1109/ISCBI.2013.27","DOIUrl":null,"url":null,"abstract":"Interactive cooperation of local best and global best solution encourages particles to move towards them, with a hope that better solution may present in the neighboring positions around local best or global best. However, this encouragement does not guarantees that movements taken by particle will always be the suitable one (comparatively better solution). With the influence of three random parameters in PSO-RANDIW increases exploration power as well as probability of unsuitable movements (move towards comparatively worst solution). These unsuitable movement may delay in convergence. In this paper, we have introduced a noble method to avoid such move with cognition of particle's own worst solution. Analysis on well known four benchmark functions shows proposed approach performance is comparatively better.","PeriodicalId":311471,"journal":{"name":"2013 International Symposium on Computational and Business Intelligence","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"An Improved Random Inertia Weighted Particle Swarm Optimization\",\"authors\":\"A. Biswas, A. Lakra, Sharad Kumar, Avjeet Singh\",\"doi\":\"10.1109/ISCBI.2013.27\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Interactive cooperation of local best and global best solution encourages particles to move towards them, with a hope that better solution may present in the neighboring positions around local best or global best. However, this encouragement does not guarantees that movements taken by particle will always be the suitable one (comparatively better solution). With the influence of three random parameters in PSO-RANDIW increases exploration power as well as probability of unsuitable movements (move towards comparatively worst solution). These unsuitable movement may delay in convergence. In this paper, we have introduced a noble method to avoid such move with cognition of particle's own worst solution. Analysis on well known four benchmark functions shows proposed approach performance is comparatively better.\",\"PeriodicalId\":311471,\"journal\":{\"name\":\"2013 International Symposium on Computational and Business Intelligence\",\"volume\":\"79 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-08-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Symposium on Computational and Business Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCBI.2013.27\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Symposium on Computational and Business Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCBI.2013.27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

局部最优解和全局最优解的互动合作鼓励粒子向它们移动,希望在局部最优解或全局最优解的相邻位置出现更好的解。然而,这种鼓励并不能保证粒子的运动总是合适的(相对更好的解决方案)。在三个随机参数的影响下,pso - randw算法的搜索功率增大,不合适运动(向相对最差解移动)的概率增大。这些不合适的运动可能会延迟趋同。在本文中,我们引入了一种利用粒子自身最坏解的认知来避免这种移动的高贵方法。对四种常用基准函数的分析表明,该方法具有较好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Improved Random Inertia Weighted Particle Swarm Optimization
Interactive cooperation of local best and global best solution encourages particles to move towards them, with a hope that better solution may present in the neighboring positions around local best or global best. However, this encouragement does not guarantees that movements taken by particle will always be the suitable one (comparatively better solution). With the influence of three random parameters in PSO-RANDIW increases exploration power as well as probability of unsuitable movements (move towards comparatively worst solution). These unsuitable movement may delay in convergence. In this paper, we have introduced a noble method to avoid such move with cognition of particle's own worst solution. Analysis on well known four benchmark functions shows proposed approach performance is comparatively better.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信