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

  • Shareduwan Bin Mohd Kasihmuddin M
  • Mansor M
  • Sathasivam S
N/ACitations
Citations of this article
10Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Shareduwan Bin Mohd Kasihmuddin, M., Mansor, M. A. B., & Sathasivam, S. (2016). Genetic Algorithm for Restricted Maximum k-Satisfiability in the Hopfield Network. International Journal of Interactive Multimedia and Artificial Intelligence, 4(2), 52. https://doi.org/10.9781/ijimai.2016.429

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free