2021
DOI: 10.1007/s00500-021-05939-3
|View full text |Cite
|
Sign up to set email alerts
|

Exploratory cuckoo search for solving single-objective optimization problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
13
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 49 publications
(16 citation statements)
references
References 44 publications
0
13
0
Order By: Relevance
“…ROL strategy combining the refraction principle [ 28 , 34 ] from physics with an OBL strategy is a strong method to strengthen MAs [ 28 , 29 , 34 , 35 ]. In this paper, the ROL strategy is applied to augment the performance of the BROMLDE algorithm.…”
Section: The Proposed Bromlde Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…ROL strategy combining the refraction principle [ 28 , 34 ] from physics with an OBL strategy is a strong method to strengthen MAs [ 28 , 29 , 34 , 35 ]. In this paper, the ROL strategy is applied to augment the performance of the BROMLDE algorithm.…”
Section: The Proposed Bromlde Algorithmmentioning
confidence: 99%
“…To be specific, in [ 28 ], a refracted oppositional learning (ROL) strategy is incorporated into the artificial bee colony algorithm, promoting the diversity of the population and guiding it to explore the global optimal solution. Based on the ROL strategy, the authors in [ 29 ] propose a cuckoo search algorithm with refraction learning, improving the capability of cuckoo search to avoid local optimal positions. Regrettably, their suitable scale factors are difficult to select.…”
Section: Introductionmentioning
confidence: 99%
“…Cuckoo search (CS) is a mathematical optimization algorithm inspired by the nesting and parasitic reproduction behaviors of some cuckoo species and the Lévy flight behavior of some fruit flies and birds [25,26]. It has been successfully applied to solve various optimization problems because of its few parameters and easy implementation [27,28]. The CS algorithm uses Lévy flight to generate a new solution.…”
Section: Introductionmentioning
confidence: 99%
“…Metaheuristics are general frameworks to build heuristics for combinatorial and global optimization problems [ 3 ]. The application of natural or biology-inspired metaheuristic optimizations, such as Genetic Algorithm [ 4 ], Particle Swarm Optimization [ 5 ], Harmony Search [ 6 ], Differential Evolution (DE) [ 7 – 10 ], Artificial Bee Colony [ 11 ], Fruit Fly Optimization [ 12 ], Distributed Grey Wolf Optimizer (DGWO) [ 13 ], Moth Search Algorithm (MSA) [ 14 ], Slime Mould Algorithm (SMA) [ 15 ], Gaining Sharing Knowledge-Based Optimization [ 16 , 17 ], Cuckoo Search with Exploratory (ECS) [ 18 ], Discrete Jaya with Refraction Learning and Three Mutation (DJRL3M) [ 19 ], and Monarch Butterfly Optimization (MBO) [ 20 ], Hunger Games Search (HGS) [ 21 ], Runge Kutta Method (RUN) [ 22 ], and Harris Hawks Optimization (HHO) [ 23 ], has been very successful to solve the complex optimization problems, such as feature selection [ 24 28 ], image segmentation [ 29 ], controller designation [ 30 ], flow-shop scheduling problem [ 31 , 32 ], and the node placement of wireless sensor networks [ 33 ].…”
Section: Introductionmentioning
confidence: 99%