Estimation of Distribution Algorithm with Discrete Hopfield Neural Network for GRAN3SAT Analysis

The Discrete Hopfield Neural Network introduces a G-Type Random 3 Satisfiability logic structure, which can improve the flexibility of the logic structure and meet the requirements of all combinatorial problems. Usually, Exhaustive Search (ES) is regarded as the basic learning algorithm to search the fitness of neurons. To improve the efficiency of the learning algorithm. In this paper, we introduce the Estimation of Distribution Algorithm (EDA) as a learning algorithm for the model. To study the learning mechanism of EDA to improve search efficiency, this study focuses on the impact of EDA on the model under different proportions of literals and evaluates the performance of the model at different phases through evaluation indicators. Analyze the effect of EDA on the synaptic weights and the global solution. From the discussion, it can be found that compared with ES, EDA has a larger search space at the same efficiency, which makes the probability of obtaining satisfactory weights higher, and the proportion of global solutions obtained is higher. Higher proportions of positive literals help to improve the model performance.