Is the Bee Colony Optimisation algorithm suitable for continuous numerical optimisation?. (2017)

• Record Type: Journal Article
• Authors: Simić, MiloÅ¡
• Is Part Of: International journal of metaheuristics. Volume 6:Number 4(2017)
• Page Start: 279
• Page End: 308
• Publication Date: 2017
• Subjects: bees foraging principles -- nature-inspired metaheuristics -- numerical optimisation -- optimisation problems -- swarm intelligence; Heuristic algorithms -- Periodicals; 006.3105
• Languages: English
• ISSNs: 1755-2176

Abstract

Bee colony optimisation (BCO) is a nature-inspired swarm metaheuristic for solving hard optimisation problems. It has successfully been applied to various areas of science, industry, and engineering. However, all those cases belong to the field of combinatorial optimisation. This paper is among the first to test BCO's capacities for solving continuous numerical optimisation problems. We found that the performance of the algorithm depended on the settings of its parameters and characteristics of the optimisation problems to which it was applied. We examined for which types of numerical functions our implementation of improvement-based BCO, known as BCOi, performed well and which classes it was not able to handle successfully. Also, following the design of experiments (DoE) approach, we analysed how the parameters of the algorithm affected its performance and provided some useful explanations that might hold for other applications of our version and other variants of BCO.