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.
OPTIMAL PATH DETERMINATION IN A GRAPH BY HOPFIELD NEURAL-NETWORK
CAVALIERI, Salvatore
;DI STEFANO, Antonella;MIRABELLA, Orazio
1994-01-01
Abstract
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.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
NeuralNetworks94.pdf
solo gestori archivio
Tipologia:
Versione Editoriale (PDF)
Dimensione
8.36 MB
Formato
Adobe PDF
|
8.36 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.