Date Added: Jul 2011
This paper is about shortest reliable path algorithms of routing in transportation networks. Efficient management of networks requires that the shortest route from one point (node) to another is known. It is often necessary to be able to determine alternative routes through the network, in case any part of the shortest path is damaged or busy which the computation of shortest paths is one of the most fundamental problems. It also focuses in finding the shortest reliable path algorithm. The authors need to find the path distance from the source to destination which is reliable and found in an optimized way considering the network constraints.