Solving the shortest path routing problem using noisy hopfield neural networks

Wen Liu*, Lipo Wang

*Corresponding author for this work

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

13 Citations (Scopus)

Abstract

To improve neural network algorithms for the shortest path routing problem (SPRP), we propose a solution using a noisy Hopfield neural network (NHNN), i.e., by adding decaying stochastic noise to the continuous Hopfield neural network (HNN). We also modify the energy function for the SPRP. Simulation results show that our approach achieves better route optimality compared to other algorithms that employ the HNN.

Original languageEnglish
Title of host publicationProceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009
Pages299-302
Number of pages4
DOIs
Publication statusPublished - 2009
Externally publishedYes
Event2009 WRI International Conference on Communications and Mobile Computing, CMC 2009 - Kunming, Yunnan, China
Duration: 6 Jan 20098 Jan 2009

Publication series

NameProceedings - 2009 WRI International Conference on Communications and Mobile Computing, CMC 2009
Volume2

Conference

Conference2009 WRI International Conference on Communications and Mobile Computing, CMC 2009
Country/TerritoryChina
CityKunming, Yunnan
Period6/01/098/01/09

Cite this