2016
DOI: 10.1088/1757-899x/160/1/012108
|View full text |Cite
|
Sign up to set email alerts
|

Performance Comparison of Cuckoo Search and Differential Evolution Algorithm for Constrained Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
15
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 24 publications
(15 citation statements)
references
References 11 publications
0
15
0
Order By: Relevance
“…In fact, differential evolution, simulated annealing and PSO are special cases of CS algorithm, hence it is not surprising why CS algorithm outperforms them (Yang, 2014). In Solihin and Zanil (2016), CS algorithm outperformed Differential evolution algorithm in terms of convergence speed to reach optimum solution. In addition, CS algorithm was reported as being more computationally efficient than the PSO (Adnan and Razzaque, 2013).…”
Section: Introductionmentioning
confidence: 99%
“…In fact, differential evolution, simulated annealing and PSO are special cases of CS algorithm, hence it is not surprising why CS algorithm outperforms them (Yang, 2014). In Solihin and Zanil (2016), CS algorithm outperformed Differential evolution algorithm in terms of convergence speed to reach optimum solution. In addition, CS algorithm was reported as being more computationally efficient than the PSO (Adnan and Razzaque, 2013).…”
Section: Introductionmentioning
confidence: 99%
“…In this work, a minimum data set generated using CCD was applied. These data were fitted into a model using IT2 fuzzy‐KM and the framework was regressed using a gradient descent technique . This technique was carried out to minimise the integral square of error (ISE).…”
Section: Resultsmentioning
confidence: 99%
“…Different categories and application of cuckoo search algorithm are discussed in [9]. CS algorithm is found to outperform Differential Evolution algorithm with respect to convergence speed and efficiency of computation [10][11]. An extended binary version of the Cuckoo Search, namely BCS, is being used for mapping continuous solutions produced by CS to binary ones while performing feature selection.…”
Section: Related Workmentioning
confidence: 99%