A hybrid many-objective cuckoo search algorithm

Cuckoo search (CS) is an excellent population-based algorithm and has shown promising performance in dealing with single- and multi-objective optimization problems. However, for many-objective optimization problems (MaOPs), CS cannot be directly employed. So far, few paper have been reported to use CS to solve MaOPs. In this paper, we try to propose a hybrid many-objective cuckoo search (HMaOCS) for MaOPs. In HMaOCS, the standard CS is firstly modified to effectively deal with MaOPs. Then, non-dominated sorting and the strategy of reference points are employed to ensure the convergence and diversity. In order to verify the performance of HMaOCS, DTLZ and WFG benchmark sets are utilized in the experiments. Experimental results show that HMaOCS can achieve promising performance compared with five other well-known many-objective optimization algorithms.