VRP routing selection based on time-varying network

This paper uses saving mileage method to discuss VRP issues, solving the problem of time limit with the shortest path. It´s based on the probability of smooth and congestion in the time-varying network and the fact that the shortest path does´t necessarily bring about least time. It makes an analysis of the path selection problems which require higher reliability of time attribute, giving good path selection examples of mid-short distance transport of pickups and deliveries.