Multi-group Flower Pollination Algorithm Based on Novel Communication Strategies

IF 0.9 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Journal of Internet Technology Pub Date : 2021-03-30 DOI:10.3966/160792642021032202003
Jeng-Shyang Pan, Jiawen Zhuang, Hao Luo, S. Chu
{"title":"Multi-group Flower Pollination Algorithm Based on Novel Communication Strategies","authors":"Jeng-Shyang Pan, Jiawen Zhuang, Hao Luo, S. Chu","doi":"10.3966/160792642021032202003","DOIUrl":null,"url":null,"abstract":"Multi-group Flower Pollination Algorithm (MFPA) based on novel communication strategies was proposed with an eye to the disadvantages of the Flower Pollination Algorithm (FPA), such as tardy convergence rate, inferior search accuracy, and strong local optimum. By introducing a parallel operation to divide the population into some groups, the global search capability of the algorithm was improved. Then three new communication strategies were proposed. Strategy 1 combined high-quality pollens of each group for evolution and replaced the old pollens. Strategy 2 let each group’s inferior pollens approaching to the optimal pollen. Strategy 3 was a combination of strategies 1 and 2. Then, experiments on 25 classical test functions show that MFPA based on novel communication strategies has a good global optimization ability, improving the convergence speed and accuracy of the FPA. Thus, we compare MFPA using three strategies with FPA and PSO, its result shows that MFPA is better than FPA and PSO. Finally, we also applied it to two practical problems and achieved a better convergence effect than FPA.","PeriodicalId":50172,"journal":{"name":"Journal of Internet Technology","volume":"22 1","pages":"257-269"},"PeriodicalIF":0.9000,"publicationDate":"2021-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Internet Technology","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.3966/160792642021032202003","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 8

Abstract

Multi-group Flower Pollination Algorithm (MFPA) based on novel communication strategies was proposed with an eye to the disadvantages of the Flower Pollination Algorithm (FPA), such as tardy convergence rate, inferior search accuracy, and strong local optimum. By introducing a parallel operation to divide the population into some groups, the global search capability of the algorithm was improved. Then three new communication strategies were proposed. Strategy 1 combined high-quality pollens of each group for evolution and replaced the old pollens. Strategy 2 let each group’s inferior pollens approaching to the optimal pollen. Strategy 3 was a combination of strategies 1 and 2. Then, experiments on 25 classical test functions show that MFPA based on novel communication strategies has a good global optimization ability, improving the convergence speed and accuracy of the FPA. Thus, we compare MFPA using three strategies with FPA and PSO, its result shows that MFPA is better than FPA and PSO. Finally, we also applied it to two practical problems and achieved a better convergence effect than FPA.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于新型通信策略的多组花授粉算法
针对花轮询算法(FPA)收敛速度慢、搜索精度低、局部最优性强等缺点,提出了一种基于新通信策略的多组花轮询算法。通过引入并行运算将种群划分为若干组,提高了算法的全局搜索能力。然后提出了三种新的沟通策略。策略1结合每组的优质花粉进行进化,并替换旧花粉。策略2让每组的劣质花粉接近最佳花粉。战略3是战略1和战略2的结合。然后,在25个经典测试函数上的实验表明,基于新通信策略的MFPA具有良好的全局优化能力,提高了FPA的收敛速度和精度。因此,我们将使用三种策略的MFPA与FPA和PSO进行了比较,结果表明MFPA优于FPA和PS O。最后,我们还将其应用于两个实际问题,并取得了比FPA更好的收敛效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Internet Technology
Journal of Internet Technology COMPUTER SCIENCE, INFORMATION SYSTEMS-TELECOMMUNICATIONS
CiteScore
3.20
自引率
18.80%
发文量
112
审稿时长
13.8 months
期刊介绍: The Journal of Internet Technology accepts original technical articles in all disciplines of Internet Technology & Applications. Manuscripts are submitted for review with the understanding that they have not been published elsewhere. Topics of interest to JIT include but not limited to: Broadband Networks Electronic service systems (Internet, Intranet, Extranet, E-Commerce, E-Business) Network Management Network Operating System (NOS) Intelligent systems engineering Government or Staff Jobs Computerization National Information Policy Multimedia systems Network Behavior Modeling Wireless/Satellite Communication Digital Library Distance Learning Internet/WWW Applications Telecommunication Networks Security in Networks and Systems Cloud Computing Internet of Things (IoT) IPv6 related topics are especially welcome.
期刊最新文献
Abnormal Detection Method of Transship Based on Marine Target Spatio-Temporal Data Multidimensional Concept Map Representation of the Learning Objects Ontology Model for Personalized Learning Multiscale Convolutional Attention-based Residual Network Expression Recognition A Dynamic Access Control Scheme with Conditional Anonymity in Socio-Meteorological Observation A Behaviorally Evidence-based Method for Computing Spatial Comparisons of Image Scenarios
×
引用
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