Nelder-Mead Hybridization of Cuckoo Search

Cuckoo Search Inspired Hybridization of the Nelder-Mead Simplex Algorithm

A new hybridization of the Cuckoo Search (CS) for minimization of real functions. The new approach consists of combining the CS with the Nelder-Mead method. More precisely, instead of using single solutions as nests for the CS, we use the concept of a simplex which is used in the Nelder-Mead algorithm. This makes it possible to use the flip operation introduces in the Nelder-Mead algorithm instead of the Levy flight which is a standard part of the CS. The method has been developed for optimizing the performance of multi-cell solar systems. Although the underlying problem consists of the minimization of a function of a relatively small number of parameters, the difficulty comes from the fact that the evaluation of the function is complex and only a small number of evaluations is possible. The developed method is most suitable for low dimensional problems in cases when only a low number of test function evaluations is possible.