Implementation Strategies for the Cuckoo Search and the African Buffalo Optimization for the Benchmark Rosenbrock Function

Abstract

The introduction of five benchmark globaloptimization test functions by De Jong has remained prominent in Mathematicsand Computer Science for over three decades now. This paper examines the effectof the search population and the number of iterations of the Cuckoo Search andthe African Buffalo Optimization in providing solutions to one of Dejongfunction, the Rosenbrock function, sometimes called Dejong2 function which is aunimodal non-separable function. The Rosenbrock function because of its deceptiveflat landscape has proven to be a good test case for optimization algorithmssince the flat surface provides very misleading information to search agents.After a number of experimental investigations using different iteration numbersand population, this study concludes that the CS provides better solutions butat a cost of more computer resources than the ABO. As a result, this study inharmony with the No Free Lunch Theorem concludes that if speed is the mainconsideration, the ABO is a better algorithm in solving the Rosenbrock (or asimilar function), otherwise, the CS is a better choice.