A hybrid artificial bee colony algorithm for satisfiability problems based on tabu search
Ying Guo, Changsheng Zhang · 2017
For satisfiability problems, a hybrid artificial bee colony algorithm named T-ABCSAT is proposed based on tabu search. It adopts the basic model of artificial bee colony algorithm, so has better balance of global search and local search. Moreover, by introducing tabu search, capability of local search is enhanced. Experimental and comparative results demonstrate that the effectiveness of T-ABCSAT is obviously better than that of the algorithm without tabu search, and T-ABCSAT has better comprehensive performance than the same kind of hybrid algorithm based on genetic algorithm.