DocumentCode
1869765
Title
Solving 3-SAT by GAs adapting constraint weights
Author
Eiben, A.E. ; van der Hauw, J.K.
Author_Institution
Dept. of Comput. Sci., Leiden Univ., Netherlands
fYear
1997
fDate
13-16 Apr 1997
Firstpage
81
Lastpage
86
Abstract
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
Keywords
computability; computational complexity; constraint handling; genetic algorithms; 3-SAT problem; NP complete problems; constraint weights; problem independent constraint handling mechanism; stepwise adaptation of weights; Computer science; Degradation; Lips; Performance evaluation; Surface acoustic waves; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 1997., IEEE International Conference on
Conference_Location
Indianapolis, IN
Print_ISBN
0-7803-3949-5
Type
conf
DOI
10.1109/ICEC.1997.592273
Filename
592273
Link To Document