A discrete-time recurrent neural network for shortest-path routing

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

26 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Pages (from-to)2129-2134
Journal / PublicationIEEE Transactions on Automatic Control
Volume45
Issue number11
Publication statusPublished - 2000
Externally publishedYes

Abstract

This paper presents a discrete-time recurrent neural network, with a fixed step parameter, for solving the shortest path problem. The proposed discrete-time recurrent neural network with a simple architecture is proven to be globally convergent to exact optimal solutions and is suitable for hardware implementation. Furthermore, an improved network with a larger step size independent of the problem size is proposed to increase its convergence rate. The performance and operating characteristicsof the proposed neural network are demonstrated by means of simulation results. © 2000 IEEE.

Research Area(s)

  • Combinatorial optimization, Discrete-time, Neural networks, Shortest-path routing