Abstract
This paper presents the implementation analysis of the benchmark Rosenbrock and Levy test functions using the Cuckoo Search with emphasis on the effect of the search population and iterations count in the algorithm’s search processes. After many experimental procedures, this study revealed that deploying a population of 10 nests is sufficient to obtain acceptable solutions to the Rosenbrock and Levy test functions (or any similar problem to these test landscapes). In fact, increasing the search population to 25 or more nests was a demerit to the Cuckoo Search as it resulted in increased processing overhead without any improvement in processing outcomes. In terms of the iteration count, it was discovered that the Cuckoo Search could obtain satisfactory results in as little as 100 iterations. The outcome of this study is beneficial to the research community as it helps in facilitating the choice of parameters whenever one is confronted with similar problems.
Highlights
The scientific community has adduced several reasons for the popularity of optimization among researchers since the second half of the 20th century
This study aimed to investigate the effect of the search population as well as the number of iterations needed to obtain very good solutions in the Cuckoo Search
This paper presented the diagnostic evaluation of the effects of search population and the number of iterations in solving the benchmark Rosenbrock and Levy functions using the Cuckoo Search (CS)
Summary
This paper presents the implementation analysis of the benchmark Rosenbrock and Levy test functions using the Cuckoo Search with emphasis on the effect of the search population and iterations count in the algorithm’s search processes. This study revealed that deploying a population of 10 nests is sufficient to obtain acceptable solutions to the Rosenbrock and Levy test functions (or any similar problem to these test landscapes). Increasing the search population to 25 or more nests was a demerit to the Cuckoo Search as it resulted in increased processing overhead without any improvement in processing outcomes. In terms of the iteration count, it was discovered that the Cuckoo Search could obtain satisfactory results in as little as 100 iterations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have