Vehicle Routing Algorithm Based on Real-Time Information

The problem of vehicle routing is discussed in a traffic network with real-time information. Travel time on each link can be as a random variable in the traffic network, collects the Real-time traffic information and calculates the travel time before the vehicle enters the link, so we can obtain the shortest path. This paper presents an improved A * algorithm, which not only adapts to the dynamic traffic network, but also it is more efficient as it is based on point-to-point. This algorithm does not need a fixed path from original node to destination node, only to estimate the travel time from current position to destination node with real-time data and determine the next link when the vehicle arrives at some node.