Improvement of shortest path algorithm and its application to route optimization
最小时间路径算法的改进及在路径优化中的应用

As the time is changing,the travel time is also changing in traffic network.So shortest path search becomes consi-derably more difficult.For solve the problems,many transportation systems could be represented by networks with travel times that were time-dependent.This paper presented time-dependent networks and its theoretical foundations and analyzed the problems of reference 1].It proposed an array to note the results to improved the algorithm.The shortest path algorithm in time-dependent networks had a broad application fields.The improved algorithm is proved to be correct and efficient by experiments and practical application.