Muhamad, Zaidi and Mahmuddin, Massudi and Nasrudin, Mohammad Faidzul and Sahran, Shahnorbanun (2011) Local search manoeuvres recruitment in the bees algorithm. In: 3rd International Conference on Computing and Informatics (ICOCI 2011), 8-9 June 2011, Bandung, Indonesia.

Preview

PDF Download (195kB) | Preview

Abstract

Swarm intelligence of honey bees had motivated many bioinspired based optimisation techniques. The Bees Algorithm (BA) was created specifically by mimicking the foraging behavior of foraging bees in searching for food sources.During the searching, the original BA ignores the possibilities of the recruits being lost during the flying.The BA algorithm can become closer to the nature foraging behavior of bees by taking account of this phenomenon.This paper proposes an enhanced BA which adds a neighbourhood search parameter which we called as the Local Search Manoeuvres (LSM) recruitment factor.The parameter controls the possibilities of a bee extends its neighbourhood searching area in certain direction.The aim of LSM recruitment is to decrease the number of searching iteration in solving optimization problems that have high dimensions.The experiment results on several benchmark functions show that the BA with LSM performs better compared to the one with basic recruitment.

Item Type:	Conference or Workshop Item (Paper)
Additional Information:	ISBN 978-983-2078-49-4 Organized by: UUM College of Arts and Sciences, Universiti Utara Malaysia.
Uncontrolled Keywords:	Bees algorithm, local search manoeuvres, recruitment strategy, neighbourhood search, benchmark test function
Subjects:	Q Science > QA Mathematics > QA76 Computer software
Divisions:	College of Arts and Sciences
Depositing User:	Dr. Massudi Mahmuddin
Date Deposited:	07 Apr 2015 04:06
Last Modified:	07 Apr 2015 04:06
URI:	https://repo.uum.edu.my/id/eprint/13604

Actions (login required)

View Item