MBO: marriage in honey bees optimization-a Haplometrosis polygynous swarming approach

Honey-bees are one of the most well studied social insects. They exhibit many features that distinguish their use as models for intelligent behavior. These features include division of labor, communication on the individual and group level, and cooperative behavior. In this paper, we present a unifi...

Full description

Saved in:
Bibliographic Details
Main Author: Abbass, H.A.
Format: Conference Proceeding
Language:English
Subjects:
Ant colony optimization
Australia
Biological system modeling
Computer science
Context modeling
Drives
Educational institutions
Evolution (biology)
Insects
Performance analysis
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Honey-bees are one of the most well studied social insects. They exhibit many features that distinguish their use as models for intelligent behavior. These features include division of labor, communication on the individual and group level, and cooperative behavior. In this paper, we present a unified model for the marriage in honey-bees within an optimization context. The model simulates the evolution of honey-bees starting with a solitary colony (single queen without a family) to the emergence of an eusocial colony (one or more queens with a family). From optimization point of view, the model is a committee machine approach where we evolve solutions using a committee of heuristics. The model is applied to a fifty propositional satisfiability problems (SAT) with 50 variables and 215 constraints to guarantee that the problems are centered on the phase transition of 3-SAT. Our aim in this paper is to analyze the behavior of the algorithm using biological concepts (number of queens, spermatheca size, and number of broods) rather than trying to improve the performance of the algorithm while losing the underlying biological essence. Notwithstanding, the algorithm outperformed WalkSAT, one of the state-of-the-art algorithms for SAT.
DOI:10.1109/CEC.2001.934391