AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (2.6 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Multi-objective optimization via hybrid exhaustive search with intelligent mutation for major 2 satisfiability in Discrete Hopfield Neural Networks

Alyaa Alway1Mohd Shareduwan Mohd Kasihmuddin2Mohd. Asyraf Mansor1( )Nur Ezlin Zamri3Yueling Guo4Siti Zulaikha Mohd Jamaludin2Azleena Mohd Kassim5
School of Distance Education, Universiti Sains Malaysia, 11800 USM, Pulau Pinang, Malaysia
School of Mathematical Sciences, Universiti Sains Malaysia, 11800 USM, Pulau Pinang, Malaysia
Department of Mathematics and Statistics, Faculty of Science, Universiti Putra Malaysia, 43400 UPM Serdang, Selangor, Malaysia
School of Science, Hunan Institute of Technology, Hengyang 421002, China
School of Computer Sciences, Universiti Sains Malaysia, 11800 USM, Pulau Pinang, Malaysia
Show Author Information

Abstract

The diversification of retrieved final neuron states through non-systematic satisfiability logical representation is pivotal to ensuring the optimality and functionality of Discrete Hopfield Neural Networks (DHNN) under varying neuron complexities. However, DHNN learning frameworks are predominantly designed for single-objective optimization, which often leads to repetitive neuron state patterns, overfitting, and limited storage capacity, particularly under increasing neuron complexity. These limitations indicate the need for a learning mechanism that can simultaneously enhance solution optimality and diversity. Motivated by this gap, we proposed a multi-objective DHNN framework based on a non-systematic Major 2 Satisfiability (MAJ2SAT) logical representation integrated with a Hybrid Exhaustive Search (HES) learning algorithm enhanced by an intelligent mutation operator. The proposed framework jointly optimized neuron fitness and neuron state diversity, enabling the systematic generation of high-quality and diversified neuron states. Unlike conventional exhaustive or heuristic search methods, the intelligent mutation operator selectively modified neuron states associated with unsatisfied clauses, thereby improving exploration efficiency while preserving solution feasibility. To further enhance the learning capability of DHNN, the proposed model introduced the concept of power strings, which facilitated the construction of multiple content addressable memories and effectively expanded the storage capacity of the network. Extensive experiments conducted on simulated datasets demonstrated that the proposed approach consistently I outperforms several state-of-the-art learning algorithms across problem sizes. The results showed reduced learning error in neuron diversity, increased total neuron variation, and a higher global minimum attainment ratio under varying clause configurations. Overall, the proposed multi-objective DHNN–MAJ2HES framework establishes a robust and scalable learning paradigm that enhances solution quality and diversity, with strong potential for extension to other logic-based neural optimization problems.

References

【1】
【1】
 
 
AIMS Mathematics
Pages 15074-15119

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Alway A, Kasihmuddin MSM, Mansor MA, et al. Multi-objective optimization via hybrid exhaustive search with intelligent mutation for major 2 satisfiability in Discrete Hopfield Neural Networks. AIMS Mathematics, 2026, 11(5): 15074-15119. https://doi.org/10.3934/math.2026621

213

Views

19

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 25 August 2025
Revised: 03 January 2026
Accepted: 13 January 2026
Published: 15 May 2026
©2026 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)