A recurrent neural network for solving the shortest path problem

Jun Wang

doi:10.1109/81.503260

A recurrent neural network for solving the shortest path problem

Jun Wang

Research output: Journal Publications and Reviews › RGC 22 - Publication in policy or professional journal

52 Citations (Scopus)

Abstract

The shortest path problem is the classical combinatorial optimization problem arising in numerous planning and designing contexts. In this paper, a recurrent neural network for solving the shortest path problem is presented. The recurrent neural network is able to generate optimal solutions to the shortest path problem. The performance of the recurrent neural network is demonstrated by means of three illustrative examples. The recurrent neural network is shown to be capable of generating the shortest path and suitable for electronic implementation. © 1996 IEEE.

Original language	English
Pages (from-to)	482-486
Journal	IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
Volume	43
Issue number	6
DOIs	https://doi.org/10.1109/81.503260
Publication status	Published - 1996
Externally published	Yes

Access Output

10.1109/81.503260

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{c1743b04c5b34004a06fc77c25192020,

title = "A recurrent neural network for solving the shortest path problem",

abstract = "The shortest path problem is the classical combinatorial optimization problem arising in numerous planning and designing contexts. In this paper, a recurrent neural network for solving the shortest path problem is presented. The recurrent neural network is able to generate optimal solutions to the shortest path problem. The performance of the recurrent neural network is demonstrated by means of three illustrative examples. The recurrent neural network is shown to be capable of generating the shortest path and suitable for electronic implementation. {\textcopyright} 1996 IEEE.",

author = "Jun Wang",

year = "1996",

doi = "10.1109/81.503260",

language = "English",

volume = "43",

pages = "482--486",

journal = "IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications",

issn = "1057-7122",

publisher = "IEEE",

number = "6",

}

TY - JOUR

T1 - A recurrent neural network for solving the shortest path problem

AU - Wang, Jun

PY - 1996

Y1 - 1996

N2 - The shortest path problem is the classical combinatorial optimization problem arising in numerous planning and designing contexts. In this paper, a recurrent neural network for solving the shortest path problem is presented. The recurrent neural network is able to generate optimal solutions to the shortest path problem. The performance of the recurrent neural network is demonstrated by means of three illustrative examples. The recurrent neural network is shown to be capable of generating the shortest path and suitable for electronic implementation. © 1996 IEEE.

AB - The shortest path problem is the classical combinatorial optimization problem arising in numerous planning and designing contexts. In this paper, a recurrent neural network for solving the shortest path problem is presented. The recurrent neural network is able to generate optimal solutions to the shortest path problem. The performance of the recurrent neural network is demonstrated by means of three illustrative examples. The recurrent neural network is shown to be capable of generating the shortest path and suitable for electronic implementation. © 1996 IEEE.

UR - https://www.scopus.com/pages/publications/0030164663

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0030164663&origin=recordpage

U2 - 10.1109/81.503260

DO - 10.1109/81.503260

M3 - RGC 22 - Publication in policy or professional journal

SN - 1057-7122

VL - 43

SP - 482

EP - 486

JO - IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications

JF - IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications

IS - 6

ER -

A recurrent neural network for solving the shortest path problem

Abstract

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this