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

Abstract

-The restricted Maximum k-Satisfiability MAXkSAT 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.

Editor's Note

“…Kasihmuddin et al [9] face the constraint optimization well-known problem MAX-kSAT with a method based on combining the use of a Hopfield network and a genetic algorithm. Their experimental results show that their solution outperforms conventional methods that are based only on Hopfield networks.…”