Recurrent stable neural networks seems to represent an interesting alternative to classical algorithms for the search for optimal paths in a graph. In this paper a Hopfield neural network is adopted to solve the problem of finding the shortest path between two nodes of a graph. The results obtained point out the validity of the solution proposed and its capability to adapt itself dynamically to the variations in the costs of the graph, acquiring an ''awareness'' of its structure.
|Titolo:||OPTIMAL PATH DETERMINATION IN A GRAPH BY HOPFIELD NEURAL-NETWORK|
|Data di pubblicazione:||1994|
|Appare nelle tipologie:||1.1 Articolo in rivista|