2017
DOI: 10.1016/j.asoc.2017.07.053
|View full text |Cite
|
Sign up to set email alerts
|

Bio-inspired computation: Recent development on the modifications of the cuckoo search algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
28
0
1

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 62 publications
(29 citation statements)
references
References 68 publications
0
28
0
1
Order By: Relevance
“…In Table 1, each row changes p anewLowerValue and p anewU pperValue , and each column changes p anewLower and p anewU pper . This paper selects α = 1 and p a = 0.25, which are mentioned by Yang and Deb [18] and recent literature [28]. With functions of Table 2, we did 9600 experiments, and the results are shown in Figure 1c.…”
Section: Step Size and P A Are Changed By Coefficient Functionmentioning
confidence: 99%
See 1 more Smart Citation
“…In Table 1, each row changes p anewLowerValue and p anewU pperValue , and each column changes p anewLower and p anewU pper . This paper selects α = 1 and p a = 0.25, which are mentioned by Yang and Deb [18] and recent literature [28]. With functions of Table 2, we did 9600 experiments, and the results are shown in Figure 1c.…”
Section: Step Size and P A Are Changed By Coefficient Functionmentioning
confidence: 99%
“…Chiroma et al [28] found that the population reduction and usage of biased random walk are the most frequently used modifications. To improve the CS algorithm, this paper chooses a different method.…”
Section: Introductionmentioning
confidence: 99%
“…Some studies are undertaken in the improvement of traditional metaheuristic algorithms [8][9][10]. In [8], the MapReduce programming paradigm is implemented in 2 Mathematical Problems in Engineering the Apache Spark tool.…”
Section: Introductionmentioning
confidence: 99%
“…The Cuckoo Search binary algorithm is proposed and applied to different instances of the crew scheduling problem. In [9], the modifications of the original CS algorithms are summarized. The continuous, binary, and multiobjective CS algorithms are compared both in the aspects of benchmark tests and in the applications.…”
Section: Introductionmentioning
confidence: 99%
“…Generally, the modification can be categorized into two classes. One is the adjustment of the parameters, and the other is hybridization with other intelligence algorithms [32]. For the first method, Uroš Mlakar et al [33] proposed a hybrid self-adaptive CS algorithm (HSA-CS) with which the search space was explored using three exploration search strategies, i.e., random long-distance search strategy, stochastic moderate-distance search strategy and stochastic short-distance search strategy.…”
Section: Introductionmentioning
confidence: 99%