Parallel distributed implementation of the shortest path algorithm

Neural network (or parallel distributed processing) models have been shown to have some potential for solving optimisation problems. Most formulations result in NP-complete problems and solutions rely on energy based models, so there is no guarantee that the network converges to a global optimal sol...

Full description

Saved in:
Bibliographic Details
Main Authors: Songhe Zhao, Dillon, T.S.
Format: Conference Proceeding
Language:English
Subjects:
Computer architecture
Computer networks
Concurrent computing
Distributed computing
Intelligent systems
Neural networks
Neurons
NP-complete problem
Parallel processing
Shortest path problem
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Neural network (or parallel distributed processing) models have been shown to have some potential for solving optimisation problems. Most formulations result in NP-complete problems and solutions rely on energy based models, so there is no guarantee that the network converges to a global optimal solution. In this paper, we propose a non-energy based neural shortest path network based on the principle of dynamic programming and least take all network. No problem of local minima exists and it guarantees to reach the optimal solution. The network can work purely in an asynchronous mode which greatly increases the computation speed.
DOI:10.1109/IJCNN.1993.716912