2022
DOI: 10.1016/j.prime.2022.100039
|View full text |Cite
|
Sign up to set email alerts
|

A novel improved version of hunger games search algorithm for function optimization and efficient controller design of buck converter system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
17
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 26 publications
(17 citation statements)
references
References 26 publications
0
17
0
Order By: Relevance
“…The proposed OCSANM was compared with the original CSA (Feng et al, 2021) and two of the best-performed algorithms so far for control of the buck converter system with FOPID controller, namely LFDSA (Izci et al, 2022b) and HGS (Izci and Ekinci, 2022) algorithms. The population and maximum iteration numbers were set to 25 and 40, respectively, and a run time of 30 has been utilized for all the algorithms.…”
Section: Simulation Results and Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…The proposed OCSANM was compared with the original CSA (Feng et al, 2021) and two of the best-performed algorithms so far for control of the buck converter system with FOPID controller, namely LFDSA (Izci et al, 2022b) and HGS (Izci and Ekinci, 2022) algorithms. The population and maximum iteration numbers were set to 25 and 40, respectively, and a run time of 30 has been utilized for all the algorithms.…”
Section: Simulation Results and Discussionmentioning
confidence: 99%
“…Moreover, the closed-loop transfer functions of the combined system are calculated using these parameters, which are given in equations (28)–(31), respectively. It is also worth reminding that equations (30) and (31) represent the transfer functions of the current best two algorithms that have been proposed for tuning an FOPID controller for a buck converter system, namely LFDSA (Izci et al, 2022b) and HGS (Izci and Ekinci, 2022), respectively.…”
Section: Simulation Results and Discussionmentioning
confidence: 99%
“…The unimodal benchmark functions, F1–F7, play a crucial role in evaluating an algorithm's ability to converge to the global optimum. Details of those functions can be found in our previous studies [69–71]. With a single minimum point, these functions assess the algorithm's capacity to efficiently explore the search space and locate the global solution.…”
Section: Classical and Recent Cec Benchmark Functionsmentioning
confidence: 99%
“…Evaluating algorithms on these functions enables us to assess their capability to navigate complex landscapes and escape local optima to find the global optimum. The inclusion of functions such as Schwefel, Rastrigin, Ackley, Griewank, Penalized, and Penalized2 [69–71] in evaluation allows us to thoroughly examine the GOANM algorithm's performance in terms of global optimization in the presence of multiple optima. Fixed‐dimensional multimodal benchmark functions, F14–F23, provide a specific context for evaluating algorithms, where the dimensionality of the search space is predetermined.…”
Section: Classical and Recent Cec Benchmark Functionsmentioning
confidence: 99%
See 1 more Smart Citation