GASAT: a genetic local search algorithm for the satisfiability problem

  • Authors:
  • Frédéric Lardeux;Frédéric Saubion;Jin-Kao Hao

  • Affiliations:
  • LERIA, University of Angers, Angers Cedex, FRANCE;LERIA, University of Angers, Angers Cedex, FRANCE;LERIA, University of Angers, Angers Cedex, FRANCE

  • Venue:
  • Evolutionary Computation
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.