Lévy flight artificial bee colony algorithm

Sharma, Harish, Bansal, Jagdish Chand, Arya, K. V. and Yang, Xin-She ORCID: https://orcid.org/0000-0001-8231-5556 (2016) Lévy flight artificial bee colony algorithm. International Journal of Systems Science, 47 (11). pp. 2652-2670. ISSN 0020-7721

Full text is not in this repository.

Abstract

Artificial bee colony (ABC) optimisation algorithm is a relatively simple and recent population-based probabilistic approach for global optimisation. The solution search equation of ABC is significantly influenced by a random quantity which helps in exploration at the cost of exploitation of the search space. In the ABC, there is a high chance to skip the true solution due to its large step sizes. In order to balance between diversity and convergence in the ABC, a Lévy flight inspired search strategy is proposed and integrated with ABC. The proposed strategy is named as Lévy Flight ABC (LFABC) has both the local and global search capability simultaneously and can be achieved by tuning the Lévy flight parameters and thus automatically tuning the step sizes. In the LFABC, new solutions are generated around the best solution and it helps to enhance the exploitation capability of ABC. Furthermore, to improve the exploration capability, the numbers of scout bees are increased. The experiments on 20 test problems of different complexities and five real-world engineering optimisation problems show that the proposed strategy outperforms the basic ABC and recent variants of ABC, namely, Gbest-guided ABC, best-so-far ABC and modified ABC in most of the experiments.

Item Type: Article
Additional Information: Published online: 17 Mar 2015
Research Areas: A. > School of Science and Technology > Design Engineering and Mathematics
Item ID: 19462
Useful Links:
Depositing User: Xin-She Yang
Date Deposited: 21 Apr 2016 11:02
Last Modified: 10 Jun 2019 13:07
URI: https://eprints.mdx.ac.uk/id/eprint/19462

Actions (login required)

Edit Item Edit Item