Hybrid algorithm proposal for optimizing benchmarking problems: Salp swarm algorithm enhanced by arithmetic optimization algorithm

IF 1.6 3区 工程技术 Q4 ENGINEERING, INDUSTRIAL International Journal of Industrial Engineering Computations Pub Date : 2023-01-01 DOI:10.5267/j.ijiec.2023.1.002
Erkan Erdemir
{"title":"Hybrid algorithm proposal for optimizing benchmarking problems: Salp swarm algorithm enhanced by arithmetic optimization algorithm","authors":"Erkan Erdemir","doi":"10.5267/j.ijiec.2023.1.002","DOIUrl":null,"url":null,"abstract":"Metaheuristic algorithms are easy, flexible and nature-inspired algorithms used to optimize functions. To make metaheuristic algorithms better, multiple algorithms are combined and hybridized. In this context, a hybrid algorithm (HSSAOA) was developed by adapting the exploration phase of the arithmetic optimization algorithm (AOA) to the position update part of the salp swarm algorithm (SSA) of the leader salps/salps. And also, there have also been a few new additions to the SSA. The proposed HSSAOA was tested in three different groups using 22 benchmark functions and compared with 7 well-known algorithms. HSSAOA optimized the best results in a total of 16 benchmark functions in each group. In addition, a statistically significant difference was obtained compared to other algorithms.","PeriodicalId":51356,"journal":{"name":"International Journal of Industrial Engineering Computations","volume":"30 1","pages":""},"PeriodicalIF":1.6000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Industrial Engineering Computations","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.5267/j.ijiec.2023.1.002","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, INDUSTRIAL","Score":null,"Total":0}
引用次数: 0

Abstract

Metaheuristic algorithms are easy, flexible and nature-inspired algorithms used to optimize functions. To make metaheuristic algorithms better, multiple algorithms are combined and hybridized. In this context, a hybrid algorithm (HSSAOA) was developed by adapting the exploration phase of the arithmetic optimization algorithm (AOA) to the position update part of the salp swarm algorithm (SSA) of the leader salps/salps. And also, there have also been a few new additions to the SSA. The proposed HSSAOA was tested in three different groups using 22 benchmark functions and compared with 7 well-known algorithms. HSSAOA optimized the best results in a total of 16 benchmark functions in each group. In addition, a statistically significant difference was obtained compared to other algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
优化基准问题的混合算法方案:由算术优化算法增强的Salp群算法
元启发式算法是一种简单、灵活、受自然启发的算法,用于优化函数。为了提高元启发式算法的性能,将多个算法进行组合和杂交。在此背景下,将算法优化算法(AOA)的探索阶段应用于leader salp /salp的salp swarm算法(SSA)的位置更新部分,提出了一种混合算法(HSSAOA)。此外,SSA也增加了一些新成员。采用22个基准函数对本文提出的HSSAOA算法进行了三组测试,并与7种知名算法进行了比较。HSSAOA对每组共16个基准函数的优化效果最好。此外,与其他算法相比,具有统计学上的显著差异。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
5.70
自引率
9.10%
发文量
35
审稿时长
20 weeks
期刊最新文献
A unifying framework and a mathematical model for the Slab Stack Shuffling Problem Heuristics and metaheuristics to minimize makespan for flowshop with peak power consumption constraints Minimizing operating expenditures for a manufacturing system featuring quality reassurances, probabilistic failures, overtime, and outsourcing Composite heuristics and water wave optimality algorithms for tri-criteria multiple job classes and customer order scheduling on a single machine Investigating the collective impact of postponement, scrap, and external suppliers on multiproduct replenishing decision
×
引用
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