Efficient algorithm for shortest-path searching in ITS
Hongzhong Chen · Computer Engineering and Applications Journal · 2007
An efficient algorithm designed for shortest-path search in ITS environment is introduced.Based on Dijkstra's algorithm,it speeds up the progressing by significantly reducing the search space according to the preprocessing result. Experimental study shows that this algorithm can reduce the search space by 94.8% and speed the computation up to 26 times while simultaneously preserves the optimum.