Research On Vehicle Routing Problem Based On Time Dependent

The development of social economy brings the impact of the transportationindustry. Road congestion is increasingly serious; the road congestion consumes a lotof opportunity cost. The effective measure to avoid congested roads is to designreasonable travel routes and road crowded depends on people’s travel time. Thechange of traffic flow clearly shows that crowding time and place. According to thepredictability and regularity of traffic flow, we can estimate crowding area and time.In papers, the research of time dependent vehicle routing problem (TDVRP) make fulluse of the characteristics of traffic flow to build time dependent traffic network, at thesame time using heuristic algorithm as the main solution of this problem. The researchcan help enterprises to carry out efficient and accurate transportation, enhance theenterprise competitiveness and provide some help for people’s simple fast travel.At present, the method for the time dependent vehicle routing problem is mainlywill changing the speed and constructing some crowded areas. The followingproblems are what exist in the study of time dependent network:(1) How to construct the time dependent network and find the effective way tosolve the vehicle routing problem on the basis of the time dependence network.(2)During constructing the time dependence network structure need to find the keyfactors which determine the change of network timeliness.(3)What are differences of the solution between time dependent vehicle routingproblem and the traditional vehicle routing problem.In this paper, starting from the analysis of the trend of traffic flow changing,analyze the time characteristics of traffic flow and the relationship between trafficflow and speed. Through analyzing the change of the traffic flow, estimate the timechanging of road crowded, with the basis of this theory to analyze and label thechange on each route of road net, gradually building a road network with timecharacteristics. During constructing time dependence network, this paper carefullyanalyzes the domestic and foreign research related to time dependent network andmakes full use of the effects of the trend change of traffic flow on crowding. On thisbasis construct time dependence and dynamic traffic network. The network canchange with the tendency of traffic flow changes for the target area, to make it closeto the real network environment.Time dependence network is the key to solve the TDVRP, in the course ofconstructing route will change along with the network adjustment. In order to improvethe effectiveness, select heuristic algorithm. This algorithm can effectively control thequality of the feasible solution, quickly and effectively solving the problem. In thispaper there are some algorithms including route algorithm, route optimizationalgorithm. And the paper increases service to improve the algorithm of time windowfor constructing route of TDVRP with time window. Construct the time dependencenetwork by programming, and solve the TDVRP with time window and not with timeWindows. The results show that the proposed method in paper can obtain the effectivefeasible solution. This article analyzes the time characteristics of traffic. With the mathematicalmodel closing to the reality and the precise simple method, describes the solvingprocess for TDVRP. The paper provides reference for accurate transportation intransportation industry, improving the urban environment pollution and reducing thepressure of urban traffic.