摘要:To solve the problem of slow convergence rate before reaching the global optimum in the conventional Cuckoo Search algorithm (CS). This study presents an enhanced CS algorithm called CH-EOBCCS, where elite members are introduced to generate their opposite solutions by elite opposition-based learning. Some excellent members will carry over to the next generations from the current solutions and the opposite solutions. This mechanism is helpful to enhance the ability of global optimum for CS algorithm and to expand the search area. At the same time, in order to expand diversity of the population, CH-EOBCCS algorithm introduces the chaotic disturbance to nest location in the iteration to improve the convergence speed. The experiments are conducted on 8 classic benchmark functions and the results show that the elite opposition-based learning and chaotic disturbance strategy has much better search performance than the generalized opposition-based learning strategy. The novel CH-EOBCCS algorithms improve the ability of CS to jump out of the local optima.