Study Of Vehicle Routing Problem Of Distribution Center

With the development of manufactory and E-business, logistic is attracting more and more attentions and there is a wide market in this field. As a typical logistic problem, VRP (Vehicle Routing Problem) is one of the hot topics and also essential to the satisfactory of the distribution service.This paper uses the optimization technology to study the Vehicle Scheduling Problem in distribution center. By establishing mathematic model, we can solve the static and dynamic scheduling problem.We first discuss the basic static VRP which has no limitations such as the capacity and time limits. This model is quite simple and cannot meet the various needs of a delivery center. Then we add other constrains and limitations, including the capacity limits and time window, to establish more complicate model that satisfy the limitations of daily operation. By setting different parameters accordingly, especially the punish parameters, our model can solve static scheduling problem and provide solutions that meet the requirements and limits of distribution center.To handle the emergencies and changes that occur in the process of the delivery, we discuss the dynamic scheduling model. We focus on the generating a better delivery plan according to the changes that cost lest or satisfy the constraints best, rather than finding the best route between two points. Emergencies and changes mostly refer to the order quantity and arrive time. Thus we set relevant models accordingly to resolve the problem and realize dynamic scheduling.We compare several sets of results and find that dynamic scheduling can re-generate the delivery plan according to the update status and performance better than the static scheduling when changes occur.