This research focuses on swarm-based optimisation algorithms, specifically the Bees Algorithm. The Bees Algorithm was inspired by the foraging behaviour of honey bees in nature. It employs a combination of exploration and exploitation to find the solutions of optimisation problems. This thesis presents three improved versions of the Bees Algorithm aimed at speeding up its operation and facilitating the location of the global optimum. For the first improvement, an algorithm referred to as the Nelder and Mead Bees Algorithm (NMBA) was developed to provide a guiding direction during the neighbourhood search stage. The second improved algorithm, named the recombination-based Bees Algorithm (rBA), is a variant of the Bees Algorithm that utilises a recombination operator between the exploited and abandoned sites to produce new candidates closer to optimal solutions. The third improved Bees Algorithm, called the guided global best Bees Algorithm (gBA), introduces a new neighbourhood shrinking strategy based on the best solution so far for a more effective exploitation search and develops a new bee recruitment mechanism to reduce the number of parameters. The proposed algorithms were tested on a set of unconstrained numerical functions and constrained mechanical engineering design problems. The performance of the algorithms was compared with the standard Bees Algorithm and other swarm based algorithms. The results showed that the improved Bees Algorithms performed better than the standard Bees Algorithm and other algorithms on most of the problems tested. Furthermore, the algorithms also involve no additional parameters and a reduction on the number of parameters as well.
| Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:742620 |
| Date | January 2018 |
| Creators | Kamaruddin, Shafie |
| Publisher | University of Birmingham |
| Source Sets | Ethos UK |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Source | http://etheses.bham.ac.uk//id/eprint/8110/ |
Page generated in 0.002 seconds