Multi-strategy Remora Optimization Algorithm for solving multi-extremum problems

IF 4.8 2区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Journal of Computational Design and Engineering Pub Date : 2023-06-01 DOI:10.1093/jcde/qwad044
H. Jia, Yongchao Li, Di Wu, Honghua Rao, Changsheng Wen, L. Abualigah
{"title":"Multi-strategy Remora Optimization Algorithm for solving multi-extremum problems","authors":"H. Jia, Yongchao Li, Di Wu, Honghua Rao, Changsheng Wen, L. Abualigah","doi":"10.1093/jcde/qwad044","DOIUrl":null,"url":null,"abstract":"\n A metaheuristic algorithm that simulates the foraging behavior of remora has been proposed in recent years, called ROA. ROA mainly simulates host parasitism and host switching in the foraging behavior of remora. However, in the experiment, it was found that there is still room for improvement in the performance of ROA. When dealing with complex optimization problems, ROA often falls into local optimal solutions, and there is also the problem of too-slow convergence. Inspired by the natural rule of “Survival of the fittest ”, this paper proposes a random restart strategy to improve the ability of ROA to jump out of the local optimal solution. Secondly, inspired by the foraging behavior of remora, this paper adds an information entropy evaluation strategy and visual perception strategy based on ROA. With the blessing of three strategies, a multi-strategy Remora Optimization Algorithm (MSROA) is proposed. Through 23 benchmark functions and IEEE CEC2017 test functions, MSROA is comprehensively tested, and the experimental results show that MSROA has strong optimization capabilities. In order to further verify the application of MSROA in practice, this paper tests MSROA through five practical engineering problems, which proves that MSROA has strong competitiveness in solving practical optimization problems.","PeriodicalId":48611,"journal":{"name":"Journal of Computational Design and Engineering","volume":null,"pages":null},"PeriodicalIF":4.8000,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Design and Engineering","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1093/jcde/qwad044","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 1

Abstract

A metaheuristic algorithm that simulates the foraging behavior of remora has been proposed in recent years, called ROA. ROA mainly simulates host parasitism and host switching in the foraging behavior of remora. However, in the experiment, it was found that there is still room for improvement in the performance of ROA. When dealing with complex optimization problems, ROA often falls into local optimal solutions, and there is also the problem of too-slow convergence. Inspired by the natural rule of “Survival of the fittest ”, this paper proposes a random restart strategy to improve the ability of ROA to jump out of the local optimal solution. Secondly, inspired by the foraging behavior of remora, this paper adds an information entropy evaluation strategy and visual perception strategy based on ROA. With the blessing of three strategies, a multi-strategy Remora Optimization Algorithm (MSROA) is proposed. Through 23 benchmark functions and IEEE CEC2017 test functions, MSROA is comprehensively tested, and the experimental results show that MSROA has strong optimization capabilities. In order to further verify the application of MSROA in practice, this paper tests MSROA through five practical engineering problems, which proves that MSROA has strong competitiveness in solving practical optimization problems.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求解多极值问题的多策略Remora优化算法
近年来,人们提出了一种模拟䲟鱼觅食行为的元启发式算法,称为ROA。ROA主要模拟了移蜂觅食行为中的寄主寄生和寄主切换。然而,在实验中,我们发现ROA的性能仍有提升的空间。在处理复杂的优化问题时,ROA常常陷入局部最优解,并且存在收敛过慢的问题。本文根据优胜劣汰的自然法则,提出随机重启策略,提高ROA跳出局部最优解的能力。其次,受䲟鱼觅食行为的启发,增加了基于ROA的信息熵评价策略和视觉感知策略;在三种策略的共同作用下,提出了一种多策略重构优化算法(MSROA)。通过23个基准函数和IEEE CEC2017测试函数,对MSROA进行了全面测试,实验结果表明MSROA具有较强的优化能力。为了进一步验证MSROA在实践中的应用,本文通过5个实际工程问题对MSROA进行了测试,证明MSROA在解决实际优化问题方面具有较强的竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Computational Design and Engineering
Journal of Computational Design and Engineering Computer Science-Human-Computer Interaction
CiteScore
7.70
自引率
20.40%
发文量
125
期刊介绍: Journal of Computational Design and Engineering is an international journal that aims to provide academia and industry with a venue for rapid publication of research papers reporting innovative computational methods and applications to achieve a major breakthrough, practical improvements, and bold new research directions within a wide range of design and engineering: • Theory and its progress in computational advancement for design and engineering • Development of computational framework to support large scale design and engineering • Interaction issues among human, designed artifacts, and systems • Knowledge-intensive technologies for intelligent and sustainable systems • Emerging technology and convergence of technology fields presented with convincing design examples • Educational issues for academia, practitioners, and future generation • Proposal on new research directions as well as survey and retrospectives on mature field.
期刊最新文献
Optimizing Microseismic Monitoring: A Fusion of Gaussian-Cauchy and Adaptive Weight Strategies An RNA Evolutionary Algorithm Based on Gradient Descent for Function Optimization Modified Crayfish Optimization Algorithm with Adaptive Spiral Elite Greedy Opposition-based Learning and Search-hide Strategy for Global Optimization Non-dominated sorting simplified swarm optimization for multi-objective omni-channel of pollution routing problem Generative Early Architectural Visualizations: Incorporating Architect's Style-trained Models
×
引用
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