针对经典Dijkstra算法时间复杂度问题，提出双向Dijkstra搜索算法解决智能交通路径规划问题，并通过仿真实验验证了算法的可行性和有效性(英文版资料)-Typical shortest path is Dijkstra algorithm, its time complexity is O (n 2 ). A map of the

city’s road network has many nodes, if we use the Dijkstra algorithm, the time complexity of the

algorithm is too high and the speed of resolution this problem is slow. In order to change this

situation, we are discussed　the aspects of algorithm design, puts forward the improved

bidirectional search algorithm. Practice has proved that, the improved algorithm can improve the

search speed and it suitable for intelligent transportation system.