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

Youshen Xia, Jun Wang

Research output: Contribution to journalArticlepeer-review

30 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)2129-2134
Number of pages6
JournalIEEE Transactions on Automatic Control
Volume45
Issue number11
DOIs
Publication statusPublished - 2000
Externally publishedYes

Keywords

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

Fingerprint

Dive into the research topics of 'A discrete-time recurrent neural network for shortest-path routing'. Together they form a unique fingerprint.

Cite this