Finding the Shortest Path in Dynamic Network using Labeling Algorithm
Sahar Abbasi, Sadoullah Ebrahimnejad, Rajaee Shahr · 2011
This study concerns the problem of finding shortest paths from one node to all other nodes in networks for which arc costs can vary with time, each arc has a transit time and parking with a corresponding time-varying cost is allowed at the nodes. it show that this problem is equivalent to a classical shortest path problem in a timeexpanded network. The label correcting algorithm is used for finding shortest paths.