Solving 3-SAT by GAs adapting constraint weights

Handling NP complete problems with GAs is a great challenge. In particular the presence of constraints makes finding solutions hard for a GA. In this paper we present a problem independent constraint handling mechanism, Stepwise Adaptation of Weights (SAW), and apply it for solving the 3-SAT problem. Our experiments prove that the SAW mechanism substantially increases GA performance. Furthermore, we compare our SAW-ing GA with the best heuristic technique we could trace, WGSAT, and conclude that the GA is superior to the heuristic method.

[1]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[2]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[3]  Gunar E. Liepins,et al.  Some Guidelines for Genetic Algorithms with Penalty Functions , 1989, ICGA.

[4]  Kenneth A. De Jong,et al.  Using Genetic Algorithms to Solve NP-Complete Problems , 1989, ICGA.

[5]  Raymond Reiter,et al.  A Logical Framework for Depiction and Image Interpretation , 1989, Artif. Intell..

[6]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[7]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[8]  Ian P. Gent,et al.  The Enigma of SAT Hill-climbing Procedures , 1992 .

[9]  Hector J. Levesque,et al.  Hard and Easy Distributions of SAT Problems , 1992, AAAI.

[10]  Toby Walsh,et al.  Towards an Understanding of Hill-Climbing Procedures for SAT , 1993, AAAI.

[11]  Bart Selman,et al.  Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .

[12]  A. E. Eiben,et al.  Genetic algorithms with multi-parent recombination , 1994, PPSN.

[13]  Ian P. Gent,et al.  Unsatisfied Variables in Local Search , 1995 .

[14]  Jin-Kao Hao,et al.  A Clausal Genetic Representation and its Evolutionary Procedures for Satisfiability Problems , 1995, ICANNGA.

[15]  A. E. Eiben,et al.  Self-adaptivity for constraint satisfaction: learning penalty functions , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[16]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[17]  A. Eiben.  Graph Coloring with Adaptive Genetic AlgorithmsA , 1996 .

[18]  Jeremy Frank,et al.  Weighting for Godot: Learning Heuristics for GSAT , 1996, AAAI/IAAI, Vol. 1.

[19]  Jeremy Frank.  Learning Short-Term Weights for GSAT , 1997, IJCAI.

[20]  Fred Glover,et al.  Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .