The path solved by A* algorithms will go through some unnecessary nodes and increase the length of the path. In order to improve this drawback, when expanding nodes, the location of specific expanding ...

In road networks with time-dependent paths, computation of point-to-point shortest paths is of great practical importance. However, there are few papers that describe efficient algorithms. We ...