One of common algorithms in solving shortest path problem is Dijkstra's algorithm. In this paper, Dijkstra's algorithm has been redesigned to handle the case in which most of parameters of a network ...

Then, mirror-symmetrical Dijkstras algorithm (MSDA) is proposed to solve the reformulated model in linear time and extract advanced features from the stochastic information.