Binary ant colony optimization algorithm in learning random satisfiability logic for discrete hopfield neural network

• Main Authors: Gao, Yuan, Mohd Kasihmuddin, Mohd Shareduwan, Chen, Ju, Zheng, Chengfeng, Romli, Nurul Atiqah, Mansor, Mohd. Asyraf, Zamri, Nur Ezlin
• 格式: Article
• 語言: English
• 出版: Elsevier 2024
• 在線閱讀: http://psasir.upm.edu.my/id/eprint/114433/1/114433.pdf; http://psasir.upm.edu.my/id/eprint/114433/; https://linkinghub.elsevier.com/retrieve/pii/S1568494624009669

This study introduced a novel ant colony optimization algorithm that implements the population selection strategy of the Estimation of Distribution Algorithm and a new pheromone updating formula. It aimed to optimize the performance of G-type random high-order satisfiability logic structures embedded in Discrete Hopfield Neural Networks, thereby enhancing the efficiency of the Hopfield Neural Network learning algorithm. Through comparative analysis with other metaheuristic algorithms, our model demonstrated superior performance in terms of global convergence, time complexity, and algorithm complexity. Additionally, we evaluated the learning phase, retrieval phase, and similarity analysis using various ratios of literals and clauses. It was shown that our proposed model exhibits stronger search ability compared to other metaheuristic algorithms and Exhaustive Search. Our model enhanced the efficiency of the learning phase, resulting in the number of global solutions accounting for 100 %, and significantly improved the global solution diversity. These advancements contributed to the efficiency of the model in convergence, rendering it applicable to a wide range of nonlinear classification and prediction problems.