DOI:
关键词: Constraint (information theory) 、 Computer science 、 Heuristics 、 Artificial bee colony algorithm 、 Mathematical optimization 、 Swarm intelligence 、 Ant colony optimization algorithms 、 Satisfiability 、 Variation (game tree) 、 Metaheuristic
摘要: The marriage in honey–bees optimization (MBO) algorithm was recently proposed and showed good results for combinatorial problems. Contrary to most of the swarm intelligence algorithms (such as Ant Colony Optimization), MBO uses self-organization mix different heuristics. This paper presents a variation where colony contains single queen with multiple workers. model is used solve special class propositional satisfiability problems (SAT) known 3-SAT, each constraint exactly three variables. objective this detail analyze its behavior on 3-SAT using parameters gleaned from biological concepts: queen’s spermatheca size, amount time devoted brood-care. outperformed well heuristics SAT.