Algorithm and Simulation of Time-Dependent Shortest Paths of Urban Traffic
A delay model of at traffic junctions and an algorithm of the Traffic Light Based Shortest Paths(TLBSP) were proposed,and Dijkstra' s algorithm was improved also.The TLBSP algorithm can fit most traffic networks and traffic rules at present and can be calculated for each vehicle.The experimental results show that,the paths based on the TLBSP algorithm are more optimal than the path based on Distance Shortest Paths and TDSP with fixed delay.In addition,the algorithm can be applied to urban traffic navigation.It is beneficial to reasonable distribution of urban vehicle and alleviate urban tragic congestion.
Time-dependent shortest pathsModel of delay at traffic junctionsModel of traffic light based shortest paths
NETL
NSTL
万方数据
维普
