Finding shortest path in the presence of barriers: An alternate approach

This paper proposes an alternate graphical approach with an increased accuracy to compute the shortest path distance in the presence of barriers between the pair of nodes. This methodology is used to compute the curvilinear path distance in a single-step between the pair of nodes. It is not possible to compute the shortest Euclidean distance in a single-step in the presence of barriers between the pair of nodes. The rectilinear distance in a single-step or multiple steps results in the maximum length. In such cases, the proposed methodology is used to compute the curvilinear path distance. The results of the proposed methodology to compute the curvilinear path distance are compared with the existing analytical approach in the presence of barriers between the pairs of nodes for the real life problem of the urban transportation system of the Kadapa in Andhra Pradesh State, India.