关键词: 配送中心选址, 区域划分, 最小权顶点覆盖, 优先队列分支限界算法

Abstract: The location and regional division of distribution centers play a crucial role in the logistics and distribution process, directly affecting the time and cost of distribution. Especially in the current field of e-commerce, this link is particularly important. Based on the minimum right coverage of domestic e-commerce, this paper discusses the optimization research of distribution center siting and regional coverage. The research significance of this paper is to provide a theoretical basis for pharmaceutical e-commerce logistics management, optimize the logistics management of pharmaceutical e-commerce enterprises, improve customer service and promote the development of pharmaceutical e-commerce market.
The article establishes a corresponding integer planning model based on the data of a head pharmaceutical e-commerce company in China. By establishing an integer planning model for the distribution center location problem in the pharmaceutical e-commerce industry, the distribution center is restricted to deliver only to adjacent demand areas and incorporates the delivery time. The problem is described by the minimum power vertex covering method, and the model is solved using the priority queue branch limit algorithm to obtain the optimal siting result. Finally, according to the principle of minimum freight cost, the possible repeated coverage of the region is subdivided to obtain the final distribution center location and regional division scheme. In this paper, considering the special characteristics of pharmaceuticals, the improved siting scheme proposes to retain the original distribution center and determine new peripheral siting points to reduce the interference of the existing network and better meet the requirements for rapid distribution of pharmaceuticals. The location of the new site is calculated based on the sales volume and logistics data, combined with the minimum power vertex coverage method. The re-siting scheme proposes to re-site all the nodes of the demand node to rationally plan the whole network and improve the distribution efficiency, and solves the integer planning model using the priority queue branching limit algorithm to obtain the optimization results. In addition, the real data of pharmaceutical e-commerce enterprises are also used to verify the effectiveness of the model, and the results show that this paper effectively saves the efficiency of order delivery time while optimizing the operating cost of the distribution center.
The empirical study confirms that for the upcoming self-built logistics network of pharmaceutical e-commerce enterprises, re-node distribution center location and regional division in the warehouse leasing and distribution of time-sensitive are a better option. For enterprises that already have a distribution center, on the basis of the original distribution center, a new distribution center for the party to maximize the benefits is added to them. This paper proposes the distribution center site selection and regional division of the program for pharmaceutical e-commerce logistics network planning to provide theoretical and practical guidance to improve the enterprise’s logistics efficiency, service quality and market competitiveness, and also in line with national and local government policy guidance, to achieve the refinement of the management of the important significance. Pharmaceutical e-commerce distribution center site selection and regional coverage optimization issues in the future also need to be in the field of intelligent technology, environmental sustainability, cross-border e-commerce development, the construction of same-city distribution network and other areas of more detailed conditions of application, so as to promote the sustainable development of the entire industry.

Key words: distribution center location, allocation problem, minimum weight vertex cover, priority queue branch and bound algorithm