Binary neurons with analog communication links for solving large-scale optimization problems

Yoon Pin Simon Foo, Yoshiyasu Takefuji, Harold Szu

Research output: Contribution to journalConference article

5 Citations (Scopus)

Abstract

We explore the applications of binary neurons with analog conductance or communication links in solving large-scale NP-complete optimization problems such as the classical traveling salesperson problems (TSP) and job-shop scheduling. In particular, the energy function of J.J. Hopfield and D.W. Tank neural network model is reformulated so that the network is likely to converge to a proportional number of valid solutions as the size of problem scales up. G.V. Wilson and G.S. Pawley identified the reasons for failure on the Hopfield and Tank computation algorithm in their attempts to solve a 10-city TSP. K. Sheff and H. Szu proposed a necessary and sufficient condition based on binary neurons and traceless energy for a Hopfield and Tank network to converge to stable states. In this paper, we study the effectiveness of this fast neural network convergent scheme through two case studies: an n-job m-machine job-shop problem and an N-city TSP.

Original languageEnglish
Number of pages1
JournalNeural Networks
Volume1
Issue number1 SUPPL
DOIs
Publication statusPublished - 1988 Jan 1
Externally publishedYes
EventInternational Neural Network Society 1988 First Annual Meeting - Boston, MA, USA
Duration: 1988 Sep 61988 Sep 10

ASJC Scopus subject areas

  • Cognitive Neuroscience
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Binary neurons with analog communication links for solving large-scale optimization problems'. Together they form a unique fingerprint.

  • Cite this