基于相对位置的细菌觅食优化算法

Xiaohui Yan, Cuiying Wen, Yan Ye, Zhicong Zhang, Shuai Li
{"title":"基于相对位置的细菌觅食优化算法","authors":"Xiaohui Yan, Cuiying Wen, Yan Ye, Zhicong Zhang, Shuai Li","doi":"10.1145/3446132.3446154","DOIUrl":null,"url":null,"abstract":"Bacterial foraging optimization (BFO) algorithm has been widely applied to various optimization problems. However, BFO often suffers from premature convergence and lacking of population information exchanging. To overcome these shortcomings, a relative position-based bacterial foraging optimization (RPBFO) is proposed. The three-layer circulation structure is replaced by a single-layer circulation structure in this algorithm. The relative position-based updating method is used to replace the absolute position-based updating method in the chemotactic operation. The reproduction step of BFO is eliminated. And the escape strategy is employed in the elimination-dispersal operation. Then the optimization results of the RPBFO algorithm are tested on 11 benchmark functions. The results show that the optimization ability of the RPBFO algorithm is significantly better than the original BFO and GA algorithms. On most benchmark functions, it also shows a better performance in convergence speed and accuracy than the PSO algorithm.","PeriodicalId":125388,"journal":{"name":"Proceedings of the 2020 3rd International Conference on Algorithms, Computing and Artificial Intelligence","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Relative Position-based Bacterial Foraging Optimization for Numerical Optimization\",\"authors\":\"Xiaohui Yan, Cuiying Wen, Yan Ye, Zhicong Zhang, Shuai Li\",\"doi\":\"10.1145/3446132.3446154\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Bacterial foraging optimization (BFO) algorithm has been widely applied to various optimization problems. However, BFO often suffers from premature convergence and lacking of population information exchanging. To overcome these shortcomings, a relative position-based bacterial foraging optimization (RPBFO) is proposed. The three-layer circulation structure is replaced by a single-layer circulation structure in this algorithm. The relative position-based updating method is used to replace the absolute position-based updating method in the chemotactic operation. The reproduction step of BFO is eliminated. And the escape strategy is employed in the elimination-dispersal operation. Then the optimization results of the RPBFO algorithm are tested on 11 benchmark functions. The results show that the optimization ability of the RPBFO algorithm is significantly better than the original BFO and GA algorithms. On most benchmark functions, it also shows a better performance in convergence speed and accuracy than the PSO algorithm.\",\"PeriodicalId\":125388,\"journal\":{\"name\":\"Proceedings of the 2020 3rd International Conference on Algorithms, Computing and Artificial Intelligence\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2020 3rd International Conference on Algorithms, Computing and Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3446132.3446154\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2020 3rd International Conference on Algorithms, Computing and Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3446132.3446154","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

细菌觅食优化算法(BFO)已广泛应用于各种优化问题。然而,BFO往往存在过早收敛和缺乏人口信息交换的问题。为了克服这些缺点,提出了一种基于相对位置的细菌觅食优化算法(RPBFO)。该算法将三层循环结构替换为单层循环结构。在趋化手术中,采用基于相对位置的更新方法代替基于绝对位置的更新方法。消除了BFO的再现步骤。在消散操作中采用了逃逸策略。然后在11个基准函数上对RPBFO算法的优化结果进行了测试。结果表明,RPBFO算法的优化能力明显优于原有的BFO和GA算法。在大多数基准函数上,该算法在收敛速度和精度上都优于粒子群算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Relative Position-based Bacterial Foraging Optimization for Numerical Optimization
Bacterial foraging optimization (BFO) algorithm has been widely applied to various optimization problems. However, BFO often suffers from premature convergence and lacking of population information exchanging. To overcome these shortcomings, a relative position-based bacterial foraging optimization (RPBFO) is proposed. The three-layer circulation structure is replaced by a single-layer circulation structure in this algorithm. The relative position-based updating method is used to replace the absolute position-based updating method in the chemotactic operation. The reproduction step of BFO is eliminated. And the escape strategy is employed in the elimination-dispersal operation. Then the optimization results of the RPBFO algorithm are tested on 11 benchmark functions. The results show that the optimization ability of the RPBFO algorithm is significantly better than the original BFO and GA algorithms. On most benchmark functions, it also shows a better performance in convergence speed and accuracy than the PSO algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信