Research on Neighborhood Search Strategy of Artificial Bee Colony Algorithm for Satisfiability Problems

The neighborhood search process plays an important role in artificial bee colony algorithm. Aiming at the problems caused by ignoring the characteristics of a given problem, the neighborhood search strategy for satisfiability problems is studied. To balance the ability of global exploration and local search, the BIR and RIB neighborhood selection strategies are proposed, and four new solution generation strategies are compared and studied. The experimental results show that, compared with the original method, the proposed strategies have improved in varying degrees in performance for stochastic SAT problems.