By Topic

An optimal neural routing algorithm

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
$31 $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

1 Author(s)
Dixon, M. ; Sch. of Math. & Phys. Sci., Murdoch Univ., WA, Australia

This paper describes a routing algorithm that uses the Hopfield neural algorithm. This algorithm takes into account the shortest path and link capacity and calculates the connections and weights of the neural network which will provide an optimum transmission path from source node to destination node. The minimization procedure is implemented using a modification of the neural network travelling salesman algorithm

Published in:

Networks, 1993. International Conference on Information Engineering '93. 'Communications and Networks for the Year 2000', Proceedings of IEEE Singapore International Conference on  (Volume:2 )

Date of Conference:

6-11 Sep 1993