GA Solution of 3-SAT based on Clustering Ranking Selection
Shang Xu-jing · Dalian Minzu Xueyuan xuebao · 2009
In this paper,we use clustering ranking selection method for GA,by adding crossover and mutation to solve 3-SAT.Moreover,according to the fitness function and its own characteristics,we regulate the δ to produce the new population clustering,which effectively suppresses the possibility of delayed convergence algorithm and satisfiability formula without the solution.Compared with other algorithms,great improvement has been made in regarding to the time.Finally,we give the basic solution of 3-SAT and analyze its complexity.