.png){kind=icon}
.png){kind=icon}
Return
A novel hybrid arithmetic optimization algorithm for solving constrained optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2023.110554.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The present study aims to optimize the engineering design and manufacturing problems with a novel hybrid optimizer named: AOA-NM (Arithmetic optimization-Nelder mead). To overcome the local optima trap shortcoming and improve the solution quality of a recently introduced arithmetic optimization algorithm (AOA), the Nelder-Mead local search methodology has been incorporated into the basic AOA framework. The objective of the proposed hybridization approach was to facilitate the refinement of the exploration-exploitation behaviour of the AOA search. In the numerical validation stage, numerous multidimensional benchmarks from the CEC2020 were used as challenging testing functions to investigate the suggested AOA-NM optimizer. To investigate the viability of the proposed hybridized algorithm in real-world applications, it is investigated for ten constrained engineering de-sign problems, and the performance was contrasted with other distinguished metaheuristics extracted from the literature. Additionally, a hands-on manufacturing problem of milling process parameter optimization and vehicle structure shape optimization is posed and solved at the forefront to evaluate both AOA and AOA-NM efficacy. The proficiency of the AOA-NM algorithm, in terms of both solution quality and stability, is confirmed by performed comparative analysis and found to be robust in handling challenging practical issues.(c) 2023 Published by Elsevier B.V.
Keywords:
Hybrid algorithm
Arithmetic optimization
Nelder-Mead
Metaheuristics
Manufacturing problems
Engineering optimization
Journal
K
IF:
7.6
Papers:
1.2W
Citations:
4.5W
View more organizations