Improved optimal foraging algorithm for global optimization

IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, THEORY & METHODS
Chen Ding, GuangYu Zhu
{"title":"Improved optimal foraging algorithm for global optimization","authors":"Chen Ding, GuangYu Zhu","doi":"10.1007/s00607-024-01290-1","DOIUrl":null,"url":null,"abstract":"<p>The optimal foraging algorithm (OFA) is a swarm-based algorithm motivated by animal behavioral ecology theory. When solving complex optimization problems characterized by multiple peaks, OFA is easy to get trapped in local minima and encounters slow convergence. Therefore, this paper presents an improved optimal foraging algorithm with social behavior based on quasi-opposition (QOS-OFA) to address these problems. First, quasi-opposition-based learning (QOBL) is introduced to improve the overall quality of the population in the initialization phase. Second, an efficient cosine-based scale factor is designed to accelerate the exploration of the search space. Third, a new search strategy with social behavior is designed to enhance local exploitation. The cosine-based scale factor is used as a regulator to achieve a balance between global exploration and local exploitation. The proposed QOS-OFA is compared with seven meta-heuristic algorithms on a CEC benchmark test suite and three real-world optimization problems. The experimental results show that QOS-OFA is better than other competitors on most of the test problems.</p>","PeriodicalId":10718,"journal":{"name":"Computing","volume":"123 1","pages":""},"PeriodicalIF":3.3000,"publicationDate":"2024-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00607-024-01290-1","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

The optimal foraging algorithm (OFA) is a swarm-based algorithm motivated by animal behavioral ecology theory. When solving complex optimization problems characterized by multiple peaks, OFA is easy to get trapped in local minima and encounters slow convergence. Therefore, this paper presents an improved optimal foraging algorithm with social behavior based on quasi-opposition (QOS-OFA) to address these problems. First, quasi-opposition-based learning (QOBL) is introduced to improve the overall quality of the population in the initialization phase. Second, an efficient cosine-based scale factor is designed to accelerate the exploration of the search space. Third, a new search strategy with social behavior is designed to enhance local exploitation. The cosine-based scale factor is used as a regulator to achieve a balance between global exploration and local exploitation. The proposed QOS-OFA is compared with seven meta-heuristic algorithms on a CEC benchmark test suite and three real-world optimization problems. The experimental results show that QOS-OFA is better than other competitors on most of the test problems.

Abstract Image

改进的全局优化最佳觅食算法
最优觅食算法(OFA)是一种基于蜂群的算法,其灵感来源于动物行为生态学理论。在求解具有多峰值特征的复杂优化问题时,OFA 容易陷入局部最小值,收敛速度较慢。因此,本文提出了一种改进的基于准位置的社会行为最优觅食算法(QOS-OFA)来解决这些问题。首先,本文引入了基于准位置的学习(QOBL),以提高初始化阶段种群的整体质量。其次,设计了一种高效的基于余弦的比例因子,以加速搜索空间的探索。第三,设计了一种具有社会行为的新搜索策略,以加强局部开发。基于余弦的比例因子被用作调节器,以实现全局探索和局部开发之间的平衡。在 CEC 基准测试套件和三个实际优化问题上,将所提出的 QOS-OFA 与七种元启发式算法进行了比较。实验结果表明,QOS-OFA 在大多数测试问题上都优于其他竞争者。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computing
Computing 工程技术-计算机:理论方法
CiteScore
8.20
自引率
2.70%
发文量
107
审稿时长
3 months
期刊介绍: Computing publishes original papers, short communications and surveys on all fields of computing. The contributions should be written in English and may be of theoretical or applied nature, the essential criteria are computational relevance and systematic foundation of results.
×
引用
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学术官方微信