Combinatorial optimization with Gaussian machines
- 1 January 1989
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 220, 533-540 vol.1
- https://doi.org/10.1109/ijcnn.1989.118630
Abstract
An artificial neuron model, called the Gaussian machine, is introduced. Gaussian machines have graded output responses, as well as stochastic behavior caused by random noise added to the input of each neuron. The Gaussian machine model includes the McCulloch-Pitts model, the Hopfield machine, and the Boltzmann machine as special cases. To demonstrate the efficiency of Gaussian machines, a solution of the traveling salesperson problem (TSP) is presented. Gaussian machines show an ability to solve combinatorial optimization problems better than either Hopfield or Boltzmann machines. The excellent performance of this model is also confirmed for the n-Queen's problem and the polyamino puzzle.Keywords
This publication has 7 references indexed in Scilit:
- On the stability of the Travelling Salesman Problem algorithm of Hopfield and TankBiological Cybernetics, 1988
- Fast simulated annealingPhysics Letters A, 1987
- “Neural” computation of decisions in optimization problemsBiological Cybernetics, 1985
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of ImagesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1984
- Neurons with graded response have collective computational properties like those of two-state neurons.Proceedings of the National Academy of Sciences, 1984
- Optimization by Simulated AnnealingScience, 1983
- A logical calculus of the ideas immanent in nervous activityBulletin of Mathematical Biology, 1943