A Collaborative Neurodynamic Algorithm for Quadratic Unconstrained Binary Optimization

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

View graph of relations

Detail(s)

Original languageEnglish
Number of pages12
Journal / PublicationIEEE Transactions on Emerging Topics in Computational Intelligence
Online published3 Jun 2024
Publication statusOnline published - 3 Jun 2024

Abstract

Quadratic unconstrained binary optimization (QUBO) is a typical combinatorial optimization problem with widespread applications in science, engineering, and business. As QUBO problems are usually NP-hard, conventional QUBO algorithms are very time-consuming for solving large-scale QUBO problems. In this paper, we present a collaborative neurodynamic optimization algorithm for QUBO. In the proposed algorithm, multiple discrete Hopfield networks, Boltzmann machines, or their variants are employed for scattered searches, and a particle swarm optimization rule is used to re-initialize neuronal states repeatedly toward global optima. With extensive experimental results on four classic combinatorial optimization problems, we demonstrate the efficacy and potency of the algorithm against several prevailing exact and meta-heuristic algorithms.

© 2024 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.

Research Area(s)

  • Approximation algorithms, Boltzmann machine, Collaboration, collaborative neurodynamic optimization, combinatorial optimization, Convergence, discrete Hopfield network, Linear programming, Neurodynamics, Neurons, Optimization, Quadratic unconstrained binary optimization (QUBO)

Bibliographic Note

Publisher Copyright: IEEE