The Study Of Open-dynamic Vehicle Routing Problem In Multi-distribution Center

With the development of economy and technology, the logistics industry has gradually become "the third profit source", and gets more and more people’s attention. Vehicle Routing Problem is not only considered as a core part in the logistics system, but also the focus of logistics companies and related scholars" research.Previous research on Vehicle Routing Problem is based on two assumptions: First, before scheduling, all the information about Vehicle Routing Problem is known and remains constant. Namely the problem is static. Second, according to the routes, the distribution vehicles starting from the distribution center, then completes the customer’s delivery service and returns to the distribution center. The distribution path is a closed loop. However, in real life, due to the customer conditions, road conditions, and weather conditions, etc, Distribution Department need to adjust distribution routes in time to adapt to the new situation, thus making it Dynamic Vehicle Routing Problem. Meanwhile, in a similar distribution such as delivering newspapers, logistics companies in order to reduce the cost, does not require distribution vehicles immediately return to the original distribution centre, but only return to the nearest neighboring distribution center. Therefore, form Open Vehicle Routing Problem. In recent years, there are a number of independent studies of these two types of problems, but the two together are studied less. In addition, with the development of Geographic Information System, GIS is widely used in the field of logistics, so this paper will research on Open-Dynamic Vehicle Routing System under multi-depot, and using GIS technology to establish Vehicle Routing System, in order to support logistics companies for vehicle scheduling decisions.Firstly, this paper introduces the concept and research course of Open Vehicle Routing Problem, and Dynamic Vehicle Problem as well as Geographic Information System, and also determines the research content of this article.Secondly, through the specific analysis of Open-Dynamic Vehicle Routing Problem’s key and difficult parts, gets ideas to solve the overall problem, and determines a solution.Thirdly, this paper establishes the mathematical model of the Open Vehicle Routing Problem, and selects Ant Colony Algorithm to solve the problem. By analyzing the advantages, disadvantages, and solo principles of Ant Colony Algorithm, Improved Ant Colony Algorithm is designed for Open Vehicle Routing System.Finally, this paper designs a Vehicle Routing System based on ArcGIS, successfully makes the system integrated with Improved Ant Colony Algorithm, and through the example verifies the feasibility and applicability of the algorithm, as well as realize the visualization of vehicle routing.