With Delivery Vehicles Under The Conditions Of Integration Path Optimization Problem

Vehicle Routing Problem is a very pivotal process in the Vehicle Scheduling. It can help to improve logistics economic benefit and realize scientific logistics.Along with the development of the specialized level of logistics in China, distribution industry has developed fast During the distribution activity, the vehicle routing is the core problem of distribution rationalization, and is also very important to improve the service level, reduce logistics cost and increase economic benefit. Vehicle routing problem with pickups and deliveries combines the pickups problem with the deliveries problem and gives an overall consideration,which can achieve the goal of the minimum logistics cost and the maximum economic benefits.So unitizing the activities of pickups and delieveries will be the trend. It is of theoretical and practical senses to some extents to study the vehicle routing problem.Directing towards the lacking of the traditional heuristic algorithm and the number's of the vehicle influence to the logistics cost,the object of this paper analyzes the mathematic model of vehicle routing with repeatability first, limit the number of the vehicle according the busload,which changes the tradional way that a dot only can be passed by a vehicle.We also set up a variable parameter in order to decide which dot should be passed repeatly.By this way we propose the solution successfully. On the basis of the solution, we perfect the mathematic model of the unitizing the activities of pickup and delievery with time window.And we make the time window and the balance of the pickups and deliveries be variable parameter in the routing process. Through the example of the model, we take research from two sides as the fixed time window and the transformable time window. The paper designs a heuristic algorithm being fit for the problem.In the algorithm, the paper thinks the time and the balance of the pickup and delivery as logistic cost,as a part of the total cost.According to the different priority and the thought of saving algorithm, the routing which has the least cost is the one we want to get. In the end case prove that the method can solve the problem sucessfully.