Particle swarm optimization with information share mechanism

Zhi-hui Zhan, Jun Zhang, Rui-zhang Huang
{"title":"Particle swarm optimization with information share mechanism","authors":"Zhi-hui Zhan, Jun Zhang, Rui-zhang Huang","doi":"10.1145/1569901.1570146","DOIUrl":null,"url":null,"abstract":"This paper proposes an information share mechanism into particle swarm optimization (PSO) in order to use all the useful information of the swarm to prevent premature convergence. The particle in traditional PSO uses only the information from its personal best position and the neighborhood's best position. This mechanism is not with sufficient search information and therefore the algorithm is easy to be trapped into local optima. In the proposed information share PSO (ISPSO), all the particles post their best search information to a share device and any particle can read the information on the device and use the information provided by any other particle to help enhance its search ability. Therefore, the ISPSO can use the whole swarm's information to guide the flying direction. The ISPSO has been applied to optimize multimodal functions, and the experimental results demonstrate that the ISPSO can yield better performance when is compared with the traditional and some other improved PSOs.","PeriodicalId":193093,"journal":{"name":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1569901.1570146","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper proposes an information share mechanism into particle swarm optimization (PSO) in order to use all the useful information of the swarm to prevent premature convergence. The particle in traditional PSO uses only the information from its personal best position and the neighborhood's best position. This mechanism is not with sufficient search information and therefore the algorithm is easy to be trapped into local optima. In the proposed information share PSO (ISPSO), all the particles post their best search information to a share device and any particle can read the information on the device and use the information provided by any other particle to help enhance its search ability. Therefore, the ISPSO can use the whole swarm's information to guide the flying direction. The ISPSO has been applied to optimize multimodal functions, and the experimental results demonstrate that the ISPSO can yield better performance when is compared with the traditional and some other improved PSOs.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于信息共享机制的粒子群优化
在粒子群优化(PSO)中引入信息共享机制,利用粒子群的所有有用信息防止过早收敛。传统粒子群算法中,粒子只利用自身最佳位置和邻域最佳位置的信息。这种机制没有提供足够的搜索信息,算法容易陷入局部最优。在所提出的信息共享粒子群(ISPSO)中,所有粒子将自己的最佳搜索信息发布到共享设备上,任何粒子都可以读取设备上的信息,并利用任何其他粒子提供的信息来帮助增强自己的搜索能力。因此,ISPSO可以利用整个蜂群的信息来引导飞行方向。将ISPSO应用于多模态函数的优化,实验结果表明,与传统的和一些改进的pso相比,ISPSO具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Metaheuristics for graph bisection Bayesian network structure learning using cooperative coevolution Session details: Track 10: genetic programming Simulating human grandmasters: evolution and coevolution of evaluation functions An evolutionary approach to feature function generation in application to biomedical image patterns
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1