GASAT: A genetic local search algorithm for the satisfiability problem
GASAT: A genetic local search algorithm for the satisfiability problem
复制标题
DOI：
10.1162/evco.2006.14.2.223
复制
发表时间：
2006-06-01
影响因子：
6.8
通讯作者：
Hao, Jin-Kao
中科院分区：
文献类型：
--
作者：
Lardeux, Frederic;Saubion, Frederic;Hao, Jin-Kao
本文提出了求解可满足性问题的一种混合算法——GASAT。GASAT的主要特点是包括基于特定交叉的重组阶段和禁忌搜索阶段。我们进行了实验来评估GASAT的不同组成部分，并将其整体性能与最先进的SAT算法进行比较。这些实验表明，GASAT提供了非常有竞争力的结果。
This paper presents GASAT, a hybrid algorithm for the satisfiability problem (SAT). The main feature of GASAT is that it includes a recombination stage based on a specific crossover and a tabu search stage. We have conducted experiments to evaluate the different components of GASAT and to compare its overall performance with state-of-the-art SAT algorithms. These experiments show that GASAT provides very competitive results.