Answers are grounded in this paper and cite their sources.
Bio–inspired algorithms, through imitating the regular pattern of life forms, often produce unexpected results. A novel global optimisation algorithm, Cuckoo Search (CS), is an example that simulates the brood behaviour of some species of cuckoos. By using Lévy distribution, the flying pattern of cuckoos is also imitated. However, the potential of cuckoo's search pattern is not fully discovered in CS algorithm. In this article, we introduce the CS algorithm and associated Lévy flights. A Modified Adaptive Cuckoo Search (MACS) is then proposed by introducing grouping, parallel, incentive, adaptive and information–sharing characteristics. Also, the formal descriptions of improving strategies are given. The proposed algorithm improves the basic CS algorithm without losing the characteristic of high–efficiency search of Lévy flights. Experiment results show that MACS outperforms basic CS algorithm on most test problems and possesses application potential for real–world problems.
No takes yet. Share an insight, caveat, or question.
Zhang et al. (2012) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: