This page is under-construction

    Honey-bees exhibit many features that distinguish their use as models for intellignet behavior. These features include division of labor, communication on the individual and group level, and cooperative behavior. This research presents a novel algorithm inspired by the marriage process in honey-bees. The algorithm is applied to a special class of the propositional satisfiability problems(SAT) known as 3-SAT, where each clause contains exactly three literals. We use three parameters gleaned form biological concepts: the queen's spermatheca size, the colony size, and the amount of time devoted for brood-care. In essence, the algorithm is a committee machine approach, where we evolve solutions using a committee of seven heuristics, viz GSAT, WalkSAT, random walk, random flip, random search, one-point crossover, and two-point crossover.