Performance of a Modified Cuckoo Search Algorithm for Unconstrained Optimization Problems
Milan Tuba, Miloš Subotić, Nadezda Stanarevic · 2012
Cuckoo search (CS) algorithm is one of the latest additions to the group of nature inspired optimization heuristics. It has been introduced by Young and Deb in 2009 and was proven to be a promising tool for solving hard optimization problems. This paper presents a modified cuckoo search algorithm for unconstrained optimization problems. We implemented a modification where the step size is determined from the sorted, rather than only permuted fitness matrix. Our modified algorithm was tested on ten standard benchmark functions. Experimental results show that our modification improves results in most cases, compared to the pure cuckoo search algorithm.