A dual neural network for shortest-path routing

J. Wang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The shortest path problem is a classical combinatorial optimization problem arising in numerous planning and designing contexts. This paper presents a recurrent neural network for solving the shortest path problem. Based on the dual problem formulation, the recurrent neural network called the dual routing network has much simpler architecture than the one based on the primal problem formulation. The dynamics and architecture of the dual routing network are defined and the operating characteristics are demonstrated via simulation.

Original languageEnglish
Title of host publication1997 IEEE International Conference on Neural Networks, ICNN 1997
Pages1295-1298
Number of pages4
DOIs
Publication statusPublished - 1997
Externally publishedYes
Event1997 IEEE International Conference on Neural Networks, ICNN 1997 - Houston, TX, United States
Duration: 9 Jun 199712 Jun 1997

Publication series

NameIEEE International Conference on Neural Networks - Conference Proceedings
Volume2
ISSN (Print)1098-7576

Conference

Conference1997 IEEE International Conference on Neural Networks, ICNN 1997
Country/TerritoryUnited States
CityHouston, TX
Period9/06/9712/06/97

Fingerprint

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

Cite this