Share Email Print

Proceedings Paper

Synaptic Strengths For Neural Simulation Of The Traveling Salesman Problem
Author(s): W. I. Clement; R. M. Inigo; E. S. McVey
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The use of neural-like networks to solve optimization problems such as the Traveling Salesman Problem has been proposed by Hopfield and Tank. The networks are based on a standard "neuron" which can be implemented by means of voltage amplifiers. The gain of network conductances and time constants as well as the value of constants in the problem's energy function have a decisive influence on the solution provided by the network, yet Hopfield and Tank do not make clear how to determine the value of these constants for a particular problem. In this paper a method for selection of constants is proposed which gives good results for the TSP. Instead of readjusting the gains and adding terms to the energy function until good results are obtained, the gains are chosen a priori and the energy function's original form is not altered. Simulation results are presented and discussed.

Paper Details

Date Published: 29 March 1988
PDF: 9 pages
Proc. SPIE 0937, Applications of Artificial Intelligence VI, (29 March 1988); doi: 10.1117/12.946996
Show Author Affiliations
W. I. Clement, University of Virginia (United States)
R. M. Inigo, University of Virginia (United States)
E. S. McVey, University of Virginia (United States)

Published in SPIE Proceedings Vol. 0937:
Applications of Artificial Intelligence VI
Mohan M. Trivedi, Editor(s)

© SPIE. Terms of Use
Back to Top