Parallel hybrid genetic algorithm for sat problems based on OpenMP

Abstract

SAT problem is the first proved NP-complete problems. Heuristic methods on solving the SAT problem although belongs to incomplete method, but it has its advantages. Genetic Algorithm (GA) as one of the heuristic algorithms, was applied to solve the SAT problem of many years, and also got some better results combine with other algorithms. However, there is still room for improvement. In this paper we combine GA with the Local Search Algorithm (LSA) and improve the sort algorithm. Using the Open MP to implement the Parallel Hybrid GA based on the Coarse-Grained Model (CGPHGA). This article describes the design and implementation of CGPHGA in detail, According to the experimental results, CGPHGA improves the success rate and efficiency.