Quarterly (spring, summer, fall, winter)
176 pp. per issue
7 x 10
ISSN
1063-6560
E-ISSN
1530-9304
2014 Impact factor:
2.37

Evolutionary Computation

Summer 2006, Vol. 14, No. 2, Pages 223-253
(doi: 10.1162/evco.2006.14.2.223)
© 2006 by the Massachusetts Institute of Technology
GASAT: A Genetic Local Search Algorithm for the Satisfiability Problem
Article PDF (324.37 KB)
Abstract

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.