The aim of multimodal optimisation is to find significant optima of a multimodal objective function including its global optimum. Many real-world applications are multimodal optimisation problems requiring multiple optimal solutions. The Bees Algorithm is a global optimisation procedure inspired by the foraging behaviour of honeybees. In this paper, several procedures are introduced to enhance the algorithm’s capability to find multiple optima in multimodal optimisation problems. In the proposed Bees Algorithm for multimodal optimisation, dynamic colony size is permitted to automatically adapt the search effort to different objective functions. A local search approach called balanced search technique is also proposed to speed up the algorithm. In addition, two procedures of radius estimation and optima elitism are added, to respectively enhance the Bees Algorithm’s ability to locate unevenly distributed optima, and eliminate insignificant local optima. The performance of the modified Bees Algorithm is evaluated on well-known benchmark problems, and the results are compared with those obtained by several other state-of-the-art algorithms. The results indicate that the proposed algorithm inherits excellent properties from the standard Bees Algorithm, obtaining notable efficiency for solving multimodal optimisation problems due to the introduced modifications.
|Journal||Institution of Mechanical Engineers. Proceedings. Part C: Journal of Mechanical Engineering Science|
|Early online date||12 Mar 2015|
|Publication status||E-pub ahead of print - 12 Mar 2015|