The Genetic algorithm is a heuristic search algorithm. Using heuristic search algorithm for SAT problems is more effective than the traditional methods. However, simply use genetic algorithm for solving SAT problems can easily fall into local optimum. This paper presents a parallel genetic algorithm framework which based on coarse-grained model for solving SAT problems. The parallel mechanism can improve the solving speed and the coarse-grained model make it possible for that each compute node independently evolved, to ensure the diversity of the population.
展开▼
