GASAT: A Genetic Local Search Algorithm for the Satisfiability Problem

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-ofthe-art SAT algorithms. These experiments show that GASAT provides very competitive results. Keywords SAT, evolutionary algorithms, tabu search, recombination operators.

• Type: Journal
• Year: 2006
• Where: EC
• Authors: Frédéric Lardeux, Frédéric Saubion, Jin-Kao Hao
• Keywords: Algorithms, EC 2006, ECommerce, Tabu Search, Tabu Search Stage