By Topic

An embedded connectionist approach for the inverse shortest paths problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
C. W. Tong ; Dept. of Syst. Eng., Chinese Univ. of Hong Kong, Shatin, Hong Kong ; K. P. Lam

A type of connectionist network, called the binary relation inference network, has been recently applied to solve constrained optimization problems, such as the shortest path problem, assignment problem, etc. The inherently parallel operating nature of the network promises a potential speedup in solving the problems. In some situations where the problems cannot be solved directly with the network, it is possible to have the network acting as an embedded real-time engine to solve the involved subproblems. In this paper, the possibility of embedding the network to solve the inverse shortest paths problem is explored. Limitations in incorporating the network are discussed and remedies are suggested

Published in:

Neural Networks, 1994. IEEE World Congress on Computational Intelligence., 1994 IEEE International Conference on  (Volume:7 )

Date of Conference:

27 Jun-2 Jul 1994