Title: Multi-strategy artificial bee colony based on multiple population for coverage optimisation

Authors: Hui Sun; Kun Wang; Haihua Xie

Addresses: School of Information Engineering, Nanchang Institute of Technology, Nanchang 330099, China ' School of Information Engineering, Nanchang Institute of Technology, Nanchang 330099, China ' School of Information Engineering, Nanchang Institute of Technology, Nanchang 330099, China

Abstract: In order to overcome the shortcomings of weak local search ability and slow convergence speed for the standard artificial bee colony algorithm, this paper proposes an improved multi-strategy artificial bee colony algorithm based on multiple populations (IMSABC). Firstly, the employed bees are randomly divided into three subgroups, corresponding to three evolutionary strategies. If the candidate solution obtained from searching is inferior to the current honey source, the bee is randomly assigned to other subgroups and the search strategy is changed. In this way, it not only facilitates the information exchange between populations, but also balances the global search and local development capabilities of the algorithm since the three search strategies have different characteristics. Secondly, by imitating the particle swarm algorithm, the search strategy of the following bees is improved by using the abundant information contained in the current global optimal honey source and random neighbour honey source. The simulation results of twelve benchmark test functions and 28 CEC2013 functions show that the performance of this algorithm has significant advantages compared with many similar improved algorithms. In order to improve the unreasonable distribution of sensor nodes and improve the network coverage, the above algorithm is applied to optimise the coverage of wireless sensor networks and achieve better optimisation effect.

Keywords: artificial bee colony; multiple populations; random selection strategy.

DOI: 10.1504/IJWMC.2018.089975

International Journal of Wireless and Mobile Computing, 2018 Vol.14 No.1, pp.47 - 55

Received: 25 May 2017
Accepted: 18 Aug 2017
Published online: 26 Feb 2018 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article