.png){kind=icon}
.png){kind=icon}
Return
A hybrid many-objective cuckoo search algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-019-04004-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Cuckoo search
Many-objective optimization problems
Non-dominated sorting
Reference points
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W
View more organizations