Study On Vehicle Routing Problem With Dynamic Traffic Jam

The traditional VRP is based on the length of the path,didn’t consider the travel time of the road network.With the development of logistics,the time requirement of distribution service is improved.Premature delivery will result in the idle of human resources,delayed delivery will result in delay costs.These have brought great challenges to the distribution businessThe distribution of the city industry and Commerce led to the difference of travel time in various passages(as well as the positive and negative direction)at different times,distribution service providers should consider the road network capacity,time cost and distance and time window.In this paper,the transit time is divided into different periods according to the degree of network congestion,considering the traffic congestion,making the total cost of distribution the lowest in the development of distribution programs as far as possible to avoid traffic congestion.The following is the main content of this paper:1.This paper defines the dynamic vehicle routing problem considering the dynamic travel time due to the dynamic characteristics of traffic flow in urban traffic.Establish the vehicle routing problem model considering vehicle type and time window in order to solve the problem.2.Most existing research on vehicle routing problem consider static space distance between two points,this paper considers the dynamic congestion,shortest path may not be the optimal path,the optimal model is established with the objective of cost optimization,and the elitist strategy is used to optimize the population,finanlly an example is given to show the feasibility and effectiveness of the proposed algorithm.