Solving MAX-SAT problems using a memetic evolutionary meta-heuristic

Genetic algorithms are a population-based metaheuristic. They have been successfully applied to many optimization problems. However, premature convergence is an inherent characteristic of such classical genetic algorithms that makes them incapable of searching numerous solutions of the problem domain. A memetic algorithm is an extension of the traditional genetic algorithm. It uses a hill climbing search technique to reduce the likelihood of the premature convergence. In this paper, a memetic approach is studied for the NP-Hard satisfiability problems, in particular for its optimization version namely MAX-SAT. Our evolutionary approach applies a search technique to further improve the fitness of individuals in the genetic population. Basically, the approach combines local search heuristics with crossover operators. The method is tested and various experimental results show that memetic algorithm performs better than the classical genetic algorithms for most benchmark problems.