A recurrent neural-network for solving the shortest-path problem

A recurrent neural-network for solving the shortest-path problem

0.00 Avg rating0 Votes
Article ID: iaor19981329
Country: United States
Volume: 43
Issue: 6
Start Page Number: 482
End Page Number: 486
Publication Date: Jun 1996
Journal: IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications
Authors:
Keywords: neural networks
Abstract:

The shortest path problem is the classical combinatorial optimization problem arising in numerous planning and designing contexts. In this paper, a recurrent neural network for solving the shortest path problem is presented. The recurrent neural network is able to generate optimal solutions to the shortest path problem. The performance of the recurrent neural network is demonstrated by means of three illustrative examples. The recurrent neural network is shown to be capable of generating the shortest path and suitable for electronic implementation.

Reviews

Required fields are marked *. Your email address will not be published.