Lévy flights, non-local search and simulated annealing
Journal of Computational Physics
Journal of Global Optimization
International Journal of Bio-Inspired Computation
International Journal of Bio-Inspired Computation
Evolutionary algorithm for example-based painterly rendering
International Journal of Bio-Inspired Computation
ACO approach with learning for preemptive scheduling of real-time tasks
International Journal of Bio-Inspired Computation
Nature-Inspired Metaheuristic Algorithms: Second Edition
Nature-Inspired Metaheuristic Algorithms: Second Edition
A PAPR reduction method based on artificial bee colony algorithm for OFDM signals
IEEE Transactions on Wireless Communications
Using bees to solve a data-mining problem expressed as a max-sat one
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
A modified Artificial Bee Colony algorithm for real-parameter optimization
Information Sciences: an International Journal
IEEE Computational Intelligence Magazine
Hi-index | 0.00 |
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.