Computation method of the dynamic shortest path based on improved-Dijkstra algorithm

Firstly,the paper divides the working hours into several time intervals and defines some different speed patterns based on historical data.Then one improved-Dijkstra algorithm with non-passing property is suggested,which can compute the paths with the shortest traveling time from any single-source node to all the other nodes.Sequentially,we divide travelers into three types which imply the existence of passing behavior,and the corresponding shortest paths algorithm is given.Finally,numerical examples are presented to validate the feasibility and efficiency of the preceding algorithm.