Novel Genetic Bees Algorithm applied to single machine scheduling problem

Michael S. Packianather*, Baris Yuce, Ernesto Mastrocinque, Fabio Fruggiero, Duc T. Pham, Alfredo Lambiase

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

Abstract

The proposed novel Genetic Bees Algorithm (GBA) is an enhancement to the swarm-based Bees Algorithm (BA). It is called the Genetic Bees Algorithm because it has genetic operators. The structure of the GBA compared to the basic BA has two extra components namely, a Reinforced Global Search and a Jumping Function. The main advantage of adding the genetic operators to BA is that it will help the algorithm to avoid getting stuck in local optima. In this study the scheduling problem of a single machine was considered. When the basic BA was applied to solve this problem its performance was affected by its weakness in conducting global search to explore the search space. However, in most cases the proposed GBA overcame this issue due to the two new components which have been introduced.

Original languageEnglish
Title of host publicationWorld Automation Congress Proceedings
PublisherIEEE Computer Society
Pages906-911
Number of pages6
ISBN (Electronic)978-1889335490
DOIs
Publication statusPublished - 24 Oct 2014
Event2014 World Automation Congress, WAC 2014 - Waikoloa, United States
Duration: 3 Aug 20147 Aug 2014

Conference

Conference2014 World Automation Congress, WAC 2014
Country/TerritoryUnited States
CityWaikoloa
Period3/08/147/08/14

Keywords

  • Bees Algorithm (BA)
  • Genetic Bees Algorithm (GBA)
  • Single Machine Scheduling
  • Swarm Based Optimisation Technique (SBOT)

ASJC Scopus subject areas

  • Control and Systems Engineering

Fingerprint

Dive into the research topics of 'Novel Genetic Bees Algorithm applied to single machine scheduling problem'. Together they form a unique fingerprint.

Cite this