Genetic Algorithm for Restricted Maximum k-Satisfiability in the Hopfield Network

Author
Keywords
Abstract
The restricted Maximum k-Satisfiability MAX- kSAT is an enhanced Boolean satisfiability counterpart that has attracted numerous amount of research. Genetic algorithm has been the prominent optimization heuristic algorithm to solve constraint optimization problem. The core motivation of this paper is to introduce Hopfield network incorporated with genetic algorithm in solving MAX-kSAT problem. Genetic algorithm will be integrated with Hopfield network as a single network. The proposed method will be compared with the conventional Hopfield network. The results demonstrate that Hopfield network with genetic algorithm outperforms conventional Hopfield networks. Furthermore, the outcome had provided a solid evidence of the robustness of our proposed algorithms to be used in other satisfiability problem.
Year of Publication
2016
Journal
International Journal of Interactive Multimedia and Artificial Intelligence
Volume
4
Issue
Regular Issue
Number
2
Number of Pages
52-60
Date Published
12/2016
ISSN Number
1989-1660
Citation Key
URL
http://www.ijimai.org/journal/sites/default/files/files/2016/11/ijimai20164_2_9_pdf_33484.pdf
DOI
10.9781/ijimai.2016.429
Attachment