Lardeux Frédéric, Saubion Frédéric, Hao Jin-Kao
LERIA, University of Angers, F-49045 Angers Cedex, France.
Evol Comput. 2006 Summer;14(2):223-53. doi: 10.1162/evco.2006.14.2.223.
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.
本文介绍了GASAT,一种用于可满足性问题(SAT)的混合算法。GASAT的主要特点是它包括一个基于特定交叉的重组阶段和一个禁忌搜索阶段。我们进行了实验,以评估GASAT的不同组件,并将其整体性能与最先进的SAT算法进行比较。这些实验表明,GASAT提供了非常有竞争力的结果。