Cargo Vehicle Routing Problem Under Real-time Traffic Information

Freight transportation is one of main human product activities and supports other economic activities.Nowadays,for a country,the cost of freight transportation accounts for 15%of gross domestic product.In order to protect source,improve the efficiency of freight transportation and reduce its cost,every country commences to optimize their freight transportation system.The freight transportation system refers to multiple objectives and resources and a great number of problems.According to influential period of these problems,they are usually classified into three levels:strategic problems,tactic problems,operational problems.Whichever one among them is optimized,the system would be improved a lot.In this paper,the one problem in operational level,dynamic vehicle routing problem based on real-time traffic information,is studied to explore the method to optimize the system.In this paper,the study of vehicle routing problem in the road section of the vehicle by the time of the impact of two factors:regular factors and accidental factors.Which,often caused by factors of vehicle travel time changes can be obtained through historical data fitting.This paper will not consider the occasional factors on the impact of travel time.In this paper,the traffic flow data of the previous few days are forecasted by Kalman filter,and when the travel time is calculated,the geometric line shape of the road is also determined.The impression of speed is taken into account.And the shortest travel path and the shortest travel time in the vehicle routing problem are obtained by modified Dijkstra algorithm.