Neural Networks for Dynamic Shortest Path Routing Problems - A Survey

Details Neural Networks for Dynamic Shortest Path Routing Problems - A Survey Neural Networks for Dynamic Shortest Path Routing Problems - A Survey

2009-11-15

arxiv.org/abs/0911.2865v2

CiiT International Journal of Artificial Intelligent Systems and Machine Learning, Vol. 1, No. 2, pp. 31-34, May 2009

Computer Science

Neural and Evolutionary Computing

This article has been withdrawn by the authors. Misplaced equation 1

Scientific paper

This paper reviews the overview of the dynamic shortest path routing problem and the various neural networks to solve it. Different shortest path optimization problems can be solved by using various neural networks algorithms. The routing in packet switched multi-hop networks can be described as a classical combinatorial optimization problem i.e. a shortest path routing problem in graphs. The survey shows that the neural networks are the best candidates for the optimization of dynamic shortest path routing problems due to their fastness in computation comparing to other softcomputing and metaheuristics algorithms

Affiliated with

Also associated with

No associations

Rating

Neural Networks for Dynamic Shortest Path Routing Problems - A Survey does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Neural Networks for Dynamic Shortest Path Routing Problems - A Survey, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Neural Networks for Dynamic Shortest Path Routing Problems - A Survey will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-323897