MTS-PRO2SAT: Hybrid Mutation Tabu Search Algorithm in Optimizing Probabilistic 2 Satisfiability in Discrete Hopfield Neural Network

Abstract

The primary objective of introducing metaheuristic algorithms into traditional systematic logic is to minimize the cost function. However, there is a lack of research on the impact of introducing metaheuristic algorithms on the cost function under different proportions of positive literals. In order to fill in this gap and improve the efficiency of the metaheuristic algorithm in systematic logic, we proposed a metaheuristic algorithm based on mutation tabu search and embedded it in probabilistic satisfiability logic in discrete Hopfield neural networks. Based on the traditional tabu search algorithm, the mutation operators of the genetic algorithm were combined to improve its global search ability during the learning phase and ensure that the cost function of the systematic logic converged to zero at different proportions of positive literals. Additionally, further optimization was carried out in the retrieval phase to enhance the diversity of solutions. Compared with nine other metaheuristic algorithms and exhaustive search algorithms, the proposed algorithm was superior to other algorithms in terms of time complexity and global convergence, and showed higher efficiency in the search solutions at the binary search space, consolidated the efficiency of systematic logic in the learning phase, and significantly improved the diversity of the global solution in the retrieval phase of systematic logic.

Keywords

• artificial neural networks
• mutation tabu search
• satisfiability logic
• metaheuristics