摘要: Modelling the behavior of social insects has attracted much research recently. Although honey– bees exhibit many features that encourage their use as models for intelligent behavior, up to our knowledge, no attempt using honey-bees a basis optimization been made in literature. Some distinguish honey–bees are division labor, communication on individual and group level, cooperative behavior. This paper presents novel search algorithm inspired by marriage process honey–bees. The is applied special class propositional satisfiability problems (SAT) known 3–SAT, where each clause contains exactly three literals. Two versions proposed algorithm, which incorporate well heuristic SAT, developed. two heuristics employed version GSAT random walk. objective this scrutinize compare its 3–SAT against both alone. analysis undertaken parameters gleaned from biological concepts; these are, colony size amount time devoted brood–care.