Title: Power law-based local search in artificial bee colony
Authors: Harish Sharma; Jagdish Chand Bansal; K.V. Arya
Addresses: ABV-Indian Institute of Information Technology and Management Gwalior, Morena Link Road, Gwalior, Madhya Pradesh-474015, India ' ABV-Indian Institute of Information Technology and Management Gwalior, Morena Link Road, Gwalior, Madhya Pradesh-474015, India ' ABV-Indian Institute of Information Technology and Management Gwalior, Morena Link Road, Gwalior, Madhya Pradesh-474015, India
Abstract: Artificial bee colony (ABC) optimisation algorithm is relatively a simple and recent population-based probabilistic approach for global optimisation. ABC has been outperformed over some nature inspired algorithms (NIAs) when tested over benchmark as well as real world optimisation problems. 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 solution search equation of ABC, there is an enough chance to skip the true solution due to large step sizes. In order to balance the diversity and convergence capability of the ABC, in this paper, a power law-based local search strategy is proposed and integrated with ABC. The proposed strategy is named as power law-based local search in ABC (PLABC). In the PLABC, new solutions are generated around the best solution and it helps to enhance the exploitation capability of ABC. Further, to improve the exploration capability, numbers of scout bees are increased. The experiments on 24 test problems of different complexities show that the proposed strategy outperforms the basic ABC and recent variants of ABC, namely, Gbest guided ABC (GABC), best-so-far ABC (BSFABC) and modified ABC in most of the experiments.
Keywords: numerical optimisation; swarm intelligence; memetic algorithms; power law; local search; PLLS; artificial bee colony; ABC optimisation.
International Journal of Artificial Intelligence and Soft Computing, 2014 Vol.4 No.2/3, pp.164 - 194
Received: 21 Jul 2012
Accepted: 10 Sep 2012
Published online: 28 Jun 2014 *