2023
DOI: 10.1038/s41598-023-31081-1
|View full text |Cite
|
Sign up to set email alerts
|

Hybrid artificial electric field employing cuckoo search algorithm with refraction learning for engineering optimization problems

Abstract: Due to its low dependency on the control parameters and straightforward operations, the Artificial Electric Field Algorithm (AEFA) has drawn much interest; yet, it still has slow convergence and low solution precision. In this research, a hybrid Artificial Electric Field Employing Cuckoo Search Algorithm with Refraction Learning (AEFA-CSR) is suggested as a better version of the AEFA to address the aforementioned issues. The Cuckoo Search (CS) method is added to the algorithm to boost convergence and diversity… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
9
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
9
1

Relationship

4
6

Authors

Journals

citations
Cited by 19 publications
(9 citation statements)
references
References 76 publications
(112 reference statements)
0
9
0
Order By: Relevance
“…But like other metaheuristic algorithms, the HBA has drawbacks such as a limited ability for global exploration, a slow convergence rate, poor precision, and a propensity to settle for a local optimum. These limitations corroborate the No-Free-Lunch theorem (NFL) which demonstrates logically that there is no one optimization algorithm that is applicable to resolve all types of optimization problems [ 39 , 40 ]. Consequently, this work introduces a Gold Sine mechanism-based Honey Badger Algorithm with Tent chaos (GST-HBA), to tackle the aforementioned challenges in the original HBA.…”
Section: Introductionmentioning
confidence: 79%
“…But like other metaheuristic algorithms, the HBA has drawbacks such as a limited ability for global exploration, a slow convergence rate, poor precision, and a propensity to settle for a local optimum. These limitations corroborate the No-Free-Lunch theorem (NFL) which demonstrates logically that there is no one optimization algorithm that is applicable to resolve all types of optimization problems [ 39 , 40 ]. Consequently, this work introduces a Gold Sine mechanism-based Honey Badger Algorithm with Tent chaos (GST-HBA), to tackle the aforementioned challenges in the original HBA.…”
Section: Introductionmentioning
confidence: 79%
“…Additionally, Table 1 includes 6 multimodal functions (F8-F13), which differ from F1-F7 by having numerous local optimal. These functions assess the algorithm's exploration capability 64 , as they require it to search for multiple optimal solutions. Their expressions are provided in Table 1 .…”
Section: Experiments and Results Analysismentioning
confidence: 99%
“…It is clear that the improved DGS-SCSO algorithm has the best performance, achieving an overall efficiency (OE) of 79.66%, which considers the number of losses (L) and the total number of functions (NF). L is subtracted from NF, and the result of the subtraction is divided by NF to compute OE 42 , 45 . The table presents the OE of all the optimizers, denoting the number of “Wins, Losses, and Ties” as W, L, and T, respectively.…”
Section: Experiments and Discussionmentioning
confidence: 99%