Vehicle Routing for Dynamic Road Network Based on Travel Time Reliability

Vehicle path selection follows the shortest path principle, while taking the shortest travel time as the optimization goal. In the real road network, affected by signal control, the travel time of the vehicle path has significant uncertainty. The shortest path algorithm with static road indicators as the weights has obvious defects in path selection. In order to solve this problem, according to the theory of distributed wave, the operating state of the vehicle under the influence of the downstream signal control is classified. The travel time of the vehicle on the road segment is classified and predicted, and the travel time prediction value set is further transformed into the travel time reliability. For the vehicle route selection of a dynamic road network, the path travel time reliability determined by the product of the road segment travel time reliability is logarithmically converted, and the Dijkstra algorithm is used to find the most reliable path as the target solution. Then, a simulation model is constructed to verify the validity of the algorithm. The experimental results prove that using the reliability of travel time as the weight of path selection and solving by Dijkstra algorithm can reflect the actual vehicle path selection more accurately. This method is a beneficial improvement to the problem of static path selection.