2015
DOI: 10.1016/j.amc.2015.06.041
|View full text |Cite
|
Sign up to set email alerts
|

Cuckoo search algorithm based on frog leaping local search and chaos theory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
14
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 32 publications
(14 citation statements)
references
References 12 publications
(17 reference statements)
0
14
0
Order By: Relevance
“…Section 3.1 illustrates the benefits of logistic map. Most of modified CS algorithms are mainly focused on choosing chaotic maps (e.g., [23][24][25]). These studies do not mention how to reduce repeated calculation in each dimension.…”
Section: Simulation Experimentsmentioning
confidence: 99%
See 1 more Smart Citation
“…Section 3.1 illustrates the benefits of logistic map. Most of modified CS algorithms are mainly focused on choosing chaotic maps (e.g., [23][24][25]). These studies do not mention how to reduce repeated calculation in each dimension.…”
Section: Simulation Experimentsmentioning
confidence: 99%
“…Huang et al [24] proposed a Chaos-enhanced cuckoo search that use logistic map to ameliorate CS. Liu and Fu [25] proposed a cuckoo search algorithm based on frog leaping local search and chaos theory. Zheng and Zhou [26] used Gaussian distribution to initiate the CS algorithm, which only considered the initial part was not comprehensive.…”
Section: Introductionmentioning
confidence: 99%
“…e chaos theory is a mathematics researching field which is applied to enhance the random search process. Many studies have integrated chaos theory into different algorithms to improve the effectiveness of metaheuristic algorithms in solving optimization problems such as the PSO algorithm [23], SA [24], Cuckoo Search Algorithm (CSA) [25], Fruit-fly Optimization (FFO) algorithm [26], ABC algorithm [27], and Differential Evolution (DE) [28]. In general, these methods with the integration of chaos theory have offered a higher solution quality than original methods.…”
Section: Introductionmentioning
confidence: 99%
“…Li Huang [11] improved three parts of the standard CS algorithm, i.e., chaotic initial position, variable step size of Lévy Flight,and chaos transboundary treatment. Liu Xiaoying [12] introduced the inertia weight factor of the particle swarm algorithm into the Levy flight, and adopted the leapfrog algorithm in the local search mechanism of the standard CS algorithm. Seen in the light of No Free Lunch Theorem [13], any existing optimization strategy can hardly solve all kinds of problems.…”
Section: Introductionmentioning
confidence: 99%