Solving the 3-SAT problem using genetic algorithms

The goal of the article is to compare efficiency of solving a problem of determining satisfiability of logical formulas SAT (3-SAT), which belongs to a class of NP-complete problems, either by using simple genetic algorithms or using genetic algorithms with suggested modified mechanism of stepwise adaptation of weights (SAW). Two possible ways of dealing with constraint - either based on a penalization or based on a remuneration are compared here. It is shown, on the basis of repeated and evaluated experiments, that a genetic algorithm with suggested mechanism of stepwise adaptation of weights (SAW) is much more efficient for solving the 3-SAT problem.