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

Yoon Pin Simon Foo, Yoshiyasu Takefuji, Harold Szu

Research output: Contribution to journalArticle

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
Pages (from-to)437
Number of pages1
JournalNeural Networks
Volume1
Issue number1 SUPPL
DOIs
Publication statusPublished - 1988
Externally publishedYes

Fingerprint

Neurons
Telecommunication links
Neural networks
Neural Networks (Computer)
Job shop scheduling

ASJC Scopus subject areas

  • Artificial Intelligence
  • Neuroscience(all)

Cite this

Binary neurons with analog communication links for solving large-scale optimization problems. / Foo, Yoon Pin Simon; Takefuji, Yoshiyasu; Szu, Harold.

In: Neural Networks, Vol. 1, No. 1 SUPPL, 1988, p. 437.

Research output: Contribution to journalArticle

@article{3e31353550e3439794edeaf1ef97a145,
title = "Binary neurons with analog communication links for solving large-scale optimization problems",
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.",
author = "Foo, {Yoon Pin Simon} and Yoshiyasu Takefuji and Harold Szu",
year = "1988",
doi = "10.1016/0893-6080(88)90461-3",
language = "English",
volume = "1",
pages = "437",
journal = "Neural Networks",
issn = "0893-6080",
publisher = "Elsevier Limited",
number = "1 SUPPL",

}

TY - JOUR

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

AU - Foo, Yoon Pin Simon

AU - Takefuji, Yoshiyasu

AU - Szu, Harold

PY - 1988

Y1 - 1988

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0024173771&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024173771&partnerID=8YFLogxK

U2 - 10.1016/0893-6080(88)90461-3

DO - 10.1016/0893-6080(88)90461-3

M3 - Article

VL - 1

SP - 437

JO - Neural Networks

JF - Neural Networks

SN - 0893-6080

IS - 1 SUPPL

ER -