3-SAT Problem Solving Based on Genetic and Simulated Annealing Algorithm
Satisfiability problems(SAT) is a very important core problem in computer science,whether it can quickly solve problems of the current study is one of the research hot spots.Introduces the Johnson algorithm,genetic algorithm and simulated annealing algorithm,and compares the characteristics of the three algorithms.Puts forward a hybrid genetic and simulated annealing algorithm based on the merits of the comprehensive GA,SA algorithm.Numerical results show that,compared with Johnson algorithm,using heuristic(SA,GA) algorithm can significantly improve the quality and speed of 3-SAT problem solution.