Improved Dijkstra algorithm for shortest path in urban traffic net
Wang Hua · Cehui kexue · 2013
The paper proposed a bidirectional search improved Dijkstra algorithm based on the characteristic of the urban road network and Dijkstra algorithm.Result showed that the improved Dijkstra algorithm could reduce the searching range by 15% ～ 25%,the more the nodes are,the more obvious the reduction.The improved algorithm could improve the real-time in path searching.