A modified smell agent optimization for global optimization and industrial engineering design problems

Author:

Wang Shuang12ORCID,Hussien Abdelazim G34ORCID,Kumar Sumit5,AlShourbaji Ibrahim6,Hashim Fatma A78

Affiliation:

1. New Engineering Industry College, Putian University , Putian 351100 , P.R. China

2. School of Information Engineering, Sanming University , Sanming 365004 , China

3. Department of Computer and Information Science, Linköping University , Linköping SE-581 83 , Sweden

4. Faculty of Science, Fayoum University , Fayoum 63514 , Egypt

5. Australian Maritime College, College of Sciences and Engineering, University of Tasmania , 7248 Launceston , Australia

6. Department of Computer Networks and Engineering, Jazan University , Jazan 45142 , Saudi Arabia

7. Faculty of Engineering, Helwan University , HJelwan 11792 , Egypt

8. MEU Research Unit, Middle East University , Amman 11831 , Jordan

Abstract

Abstract This paper introduces an Improved Smell Agent Optimization Algorithm (mSAO), a new and enhanced metaheuristic designed to tackle complex engineering optimization issues by overcoming the shortcomings of the recently introduced Smell Agent Optimization Algorithm. The proposed mSAO incorporates the jellyfish swarm active–passive mechanism and novel random operator in the elementary SAO. The objective of modification is to improve the global convergence speed, exploration–exploitation behaviour, and performance of SAO, as well as provide a problem-free method of global optimization. For numerical validation, the mSAO is examined using 29 IEEE benchmarks with varying degrees of dimensionality, and the findings are contrasted with those of its basic version and numerous renowned recently developed metaheuristics. To measure the viability of the mSAO algorithm for real-world applications, the algorithm was employed to solve to resolve eight challenges drawn from real-world scenarios including cantilever beam design, multi-product batch plant, industrial refrigeration system, pressure vessel design, speed reducer design, tension/compression spring, and three-bar truss problem. The computational analysis demonstrates the robustness of mSAO relatively in finding optimal solutions for mechanical, civil, and industrial design problems. Experimental results show that the suggested modifications lead to an improvement in solution quality by 10–20% of basic SAO while solving constraint benchmarks and engineering problems. Additionally, it contributes to avoiding local optimal stuck, and premature convergence limitations of SAO and simultaneously.

Funder

Fujian University of Technology

Putian University

Sanming University

Publisher

Oxford University Press (OUP)

Subject

Computational Mathematics,Computer Graphics and Computer-Aided Design,Human-Computer Interaction,Engineering (miscellaneous),Modeling and Simulation,Computational Mechanics

Reference99 articles.

1. Metaheuristic algorithms: A comprehensive review;Abdel-Basset;Computational Intelligence for Multimedia Big Data on the Cloud with Engineering Applications,2018

2. Reptile search algorithm (RSA): A nature-inspired meta-heuristic optimizer;Abualigah;Expert Systems with Applications,2022

3. Enhanced flow direction arithmetic optimization algorithm for mathematical optimization problems with applications of data clustering;Abualigah;Engineering Analysis with Boundary Elements,2022

4. The arithmetic optimization algorithm;Abualigah;Computer Methods in Applied Mechanics and Engineering,2021

5. Nature-inspired optimization algorithms for text document clustering–A comprehensive analysis;Abualigah;Algorithms,2020

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3