Logistics distribution path planning method, device, computer equipment and storage medium

Abstract

The present application relates to a logistics distribution path planning method, device, computer equipment and storage medium. The method includes: obtaining the logistics flow direction of the logistics orders of each warehouse in the target area, determining the destination transfer yard corresponding to the logistics flow direction, screening out the first type of logistics flow direction whose destination transfer yard belongs to the target area, and planning the warehouse path with the timeliness requirement from the warehouse to the destination transfer yard corresponding to the first type of logistics flow direction as a constraint condition to obtain the first type of distribution path, and determining the second type of logistics flow direction to be planned according to the planned logistics flow direction corresponding to the first type of distribution path, obtaining the starting transfer yard corresponding to the second type of logistics flow direction, and planning the warehouse path with the timeliness requirement from the warehouse to the starting transfer yard corresponding to the second type of logistics flow direction as a constraint condition to obtain the second type of distribution path, and the logistics distribution path planning results are obtained by aggregation. The timeliness requirements are met, and the number of transfers in the logistics distribution process is reduced, and the probability of damage to goods in the logistics distribution process is reduced.

Description

Technical Field

[0001] The present application relates to the field of logistics technology, and in particular to a logistics distribution path planning method, device, computer equipment and storage medium. Background Art

[0002] With the development of the logistics industry, each logistics company now has its own large network routes for each flow direction across the country, so that goods can be delivered from the origin to the destination in a more economical and faster manner. Large network routes are usually composed of trunk lines and branch lines. Trunk line transportation refers to the collection and packaging of goods in the same flow direction at the origin transfer station, and unified transportation to the destination transfer station. Considering its economic and time factors, from the origin transfer station to the destination transfer station, it usually passes through multiple transfer stations in the middle; branch line transportation refers to the process of goods from the transfer station to the destination delivery outlet or from the collection and delivery outlet to the origin transfer station.

[0003] The optimization of logistics distribution routes in the existing technology usually includes two categories: the first category is to find the most suitable shifts for delivery time in each direction in the large network trunk route. Since the delivery time of each shift in the transfer yard is different, logistics companies usually choose the most suitable shift for delivery time in each direction of the large network route when optimizing transportation time, so as to meet the customer's time efficiency requirements. The second category is to seek path optimization methods for branch line distribution. However, these two types of path optimization have not changed the transportation mode of the large network route in the trunk process. Since the more times a single ticket of goods passes through the transfer yard during the logistics distribution process, the greater the probability of damage to the goods during the logistics distribution process. Summary of the invention

[0004] Based on this, it is necessary to provide a logistics distribution path planning method, device, computer equipment and storage medium that can reduce the damage rate of goods during the logistics distribution process in order to address the above technical problems.

[0005] A logistics distribution path planning method, the method comprising:

[0006] Obtain the logistics flow direction of logistics orders of each warehouse in the target area, determine the destination transfer yard corresponding to the logistics flow direction, and filter out the first-class logistics flow direction whose destination transfer yard belongs to the target area;

[0007] Taking the time efficiency requirement from the warehouse to the destination transfer yard corresponding to the first-class logistics flow as the constraint condition, the warehouse-connected path planning is performed for the first-class logistics flow to obtain the first-class distribution path;

[0008] According to the planned logistics flow direction corresponding to the first type of distribution path, determine the second type of logistics flow direction to be planned;

[0009] Obtain the originating transfer yard corresponding to the second-category logistics flow direction, and plan the warehouse-to-warehouse path for the second-category logistics flow direction based on the timeliness requirement from the warehouse corresponding to the second-category logistics flow direction to the originating transfer yard, and obtain the second-category distribution path;

[0010] The first-category distribution paths and the second-category distribution paths are aggregated to obtain the logistics distribution path planning results.

[0011] In one embodiment, taking the time efficiency requirement from the warehouse to the destination transfer yard corresponding to the first-class logistics flow direction as a constraint condition, a warehouse-connected path planning is performed for the first-class logistics flow direction, and the first-class distribution path obtained includes:

[0012] Taking the time efficiency requirement from the warehouse to the destination transfer yard corresponding to the first-class logistics flow as the constraint condition, the warehouse-connected path planning is performed for the first-class logistics flow to obtain the first-class initial planning path;

[0013] Obtain the weight of the parcels in the logistics flow direction corresponding to the first type of initial planning route, and obtain the total weight of the parcels corresponding to the first type of initial planning path;

[0014] According to the preset threshold of the number of first-category routes, the first-category initially planned routes are screened according to the total weight of the tickets to determine the first-category delivery route.

[0015] In one embodiment, before obtaining the weight of the parcels corresponding to each logistics flow direction of the first type of initial planned route and obtaining the total weight of the parcels corresponding to the first type of initial planned route, the method further includes:

[0016] Obtain the planned shifts of the first type of initial planned routes, and mark the planned shift with the latest departure time from the originating warehouse as the delivery shift corresponding to the first type of initial planned routes;

[0017] Determine the collection time of the first type of initial planning route based on the delivery shifts, the timeliness requirements of the logistics flow of each warehouse and the required delivery time;

[0018] Obtain the weight of the parcels corresponding to the logistics flow direction of the first type of initial planning route, and obtain the total weight of the parcels corresponding to the first type of initial planning path, including:

[0019] According to the collection time, determine the logistics flow direction corresponding to the first type of initial planning route;

[0020] The weight of the items in the logistics flow direction corresponding to the first type of initial planned route is obtained, and the total weight of the items corresponding to the first type of initial planned path is obtained by adding up the weights.

[0021] In one embodiment, taking the time efficiency requirement from the warehouse to the destination transfer yard corresponding to the first-class logistics flow direction as a constraint condition, a warehouse-connected path planning is performed for the first-class logistics flow direction, and the first-class distribution path obtained includes:

[0022] Obtain the distance matrix and time matrix with each warehouse and each destination transfer station as the starting and ending points, the timeliness requirements between the starting and ending points, and the time data corresponding to each warehouse and each destination transfer station;

[0023] Taking the time efficiency requirement from the warehouse to the destination transfer yard corresponding to the first-class logistics flow as the constraint condition, the warehouse connection path planning is carried out based on the distance matrix, time matrix and time data to obtain the first-class distribution path.

[0024] In one embodiment, the time efficiency requirement from the warehouse corresponding to the first-class logistics flow to the destination transfer yard is used as a constraint condition, and the warehouse connection path planning is performed based on the distance matrix, the time matrix and the time data, and the first-class distribution path is obtained, including:

[0025] Taking the time efficiency requirement from the warehouse to the destination transfer yard corresponding to the first-class logistics flow as the constraint condition, with the minimum total number of routes as the main optimization goal and the shortest total time as the secondary optimization goal, the warehouse string path planning is carried out based on the distance matrix, time matrix and time data to obtain the first-class distribution path.

[0026] In one embodiment, taking the time efficiency requirement from the warehouse to the originating transfer yard corresponding to the second-type logistics flow as a constraint condition, a warehouse-connected path planning is performed for the second-type logistics flow, and the second-type distribution path obtained includes:

[0027] Taking the time efficiency requirement from the warehouse to the originating transfer yard corresponding to the second-category logistics flow as the constraint condition, the warehouse-connected path planning is performed for the second-category logistics flow to obtain the second-category initial planning path;

[0028] Obtain the weight of each item of the second type of initial planning route corresponding to each logistics flow direction, and obtain the total weight of the items of the second type of initial planning path;

[0029] According to the preset second-category route quantity threshold, the second-category initial planned routes are screened according to the total weight of the tickets to determine the second-category distribution routes.

[0030] In one embodiment, the first type of distribution path and the second type of distribution path are aggregated to obtain a logistics distribution path planning result including:

[0031] Determine the third type of logistics flow to be planned according to the planned logistics flow corresponding to the first type of distribution path and the planned logistics flow corresponding to the second type of distribution path;

[0032] Obtain large network routing data, perform path planning for the third-category logistics flow direction based on the large network routing data, and obtain the third-category distribution path corresponding to the third-category logistics flow direction;

[0033] The first-category distribution paths, the second-category distribution paths, and the third-category distribution paths are aggregated to obtain the logistics distribution path planning results.

[0034] A logistics distribution path planning device, the device comprising:

[0035] The first type of logistics flow screening module is used to obtain the logistics flow of each warehouse in the target area, determine the destination transfer yard corresponding to the logistics flow, and screen out the first type of logistics flow whose destination transfer yard belongs to the target area;

[0036] The first type of distribution path planning module is used to plan the warehouse path of the first type of logistics flow direction based on the time efficiency requirement from the warehouse to the destination transfer yard corresponding to the first type of logistics flow direction as a constraint condition to obtain the first type of distribution path;

[0037] A second-category logistics flow direction determination module, used to determine the second-category logistics flow direction to be planned according to the planned logistics flow direction corresponding to the first-category distribution path;

[0038] The second type of distribution path planning module is used to obtain the origin transfer site corresponding to the second type of logistics flow, and to perform warehouse-connected path planning on the second type of logistics flow with the time efficiency requirement from the warehouse corresponding to the second type of logistics flow to the origin transfer site as a constraint condition to obtain the second type of distribution path;

[0039] The logistics distribution path planning result determination module is used to collect the first-category distribution paths and the second-category distribution paths to obtain the logistics distribution path planning results.

[0040] A computer device includes a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the following steps are implemented:

[0041] Obtain the logistics flow direction of logistics orders of each warehouse in the target area, determine the destination transfer yard corresponding to the logistics flow direction, and filter out the first-class logistics flow direction whose destination transfer yard belongs to the target area;

[0042] Taking the time efficiency requirement from the warehouse to the destination transfer yard corresponding to the first-class logistics flow as the constraint condition, the warehouse-connected path planning is performed for the first-class logistics flow to obtain the first-class distribution path;

[0043] According to the planned logistics flow direction corresponding to the first type of distribution path, determine the second type of logistics flow direction to be planned;

[0044] Obtain the originating transfer yard corresponding to the second-category logistics flow direction, and plan the warehouse-to-warehouse path for the second-category logistics flow direction based on the timeliness requirement from the warehouse corresponding to the second-category logistics flow direction to the originating transfer yard, and obtain the second-category distribution path;

[0045] The first-category distribution paths and the second-category distribution paths are aggregated to obtain the logistics distribution path planning results.

[0046] A computer-readable storage medium stores a computer program, which, when executed by a processor, implements the following steps:

[0047] Obtain the logistics flow direction of logistics orders of each warehouse in the target area, determine the destination transfer yard corresponding to the logistics flow direction, and filter out the first-class logistics flow direction whose destination transfer yard belongs to the target area;

[0048] Taking the time efficiency requirement from the warehouse to the destination transfer yard corresponding to the first-class logistics flow as the constraint condition, the warehouse-connected path planning is performed for the first-class logistics flow to obtain the first-class distribution path;

[0049] According to the planned logistics flow direction corresponding to the first type of distribution path, determine the second type of logistics flow direction to be planned;

[0050] Obtain the originating transfer yard corresponding to the second-category logistics flow direction, and plan the warehouse-to-warehouse path for the second-category logistics flow direction based on the timeliness requirement from the warehouse corresponding to the second-category logistics flow direction to the originating transfer yard, and obtain the second-category distribution path;

[0051] The first-category distribution paths and the second-category distribution paths are aggregated to obtain the logistics distribution path planning results.

[0052] The above-mentioned logistics distribution path planning method, device, computer equipment and storage medium screen out the first type of logistics flow to be planned according to whether the destination transfer yard belongs to the target area based on the logistics flow of each warehouse in the target area, and perform warehouse-connected path planning on the first type of logistics flow to obtain a first type of distribution path that meets the time requirements of the warehouse to the destination transfer yard. Then, based on the second type of logistics flow to be planned obtained after the first type of distribution path is confirmed, the second type of logistics flow is performed warehouse-connected path planning to obtain a second type of distribution path that meets the time requirements of the warehouse to the starting transfer yard. By planning the first type of distribution path that directly sends the goods from the warehouse to the destination transfer yard through warehouse connection, and the second type of distribution path that first sends the goods from the warehouse to the starting transfer yard and then sends the goods from the starting transfer yard to the destination transfer yard through warehouse connection, the time requirements can be met while minimizing the number of times the tickets pass through the transfer yard during the logistics distribution process, thereby reducing the probability of damage to the goods during the logistics distribution process. BRIEF DESCRIPTION OF THE DRAWINGS

[0053] Figure 1 An application environment diagram of a logistics distribution path planning method in one embodiment;

[0054] Figure 2 A schematic diagram of a flow chart of a logistics distribution path planning method in one embodiment;

[0055] Figure 3 A schematic diagram of a flow chart of a logistics distribution path planning method in another embodiment;

[0056] Figure 4 A schematic diagram of a flow chart of a logistics distribution path planning method in yet another embodiment;

[0057] Figure 5 It is a flowchart of a logistics distribution path planning method in another embodiment;

[0058] Figure 6 A schematic diagram of a scenario of a logistics distribution path planning method in an embodiment;

[0059] Figure 7 A flow chart of a logistics distribution path planning method in one embodiment;

[0060] Figure 8 A flowchart of a logistics distribution path planning method in another embodiment;

[0061] Fig. 9 It is a structural block diagram of a logistics distribution path planning device in one embodiment;

[0062] Fig.10 FIG. 4 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0063] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0064] The logistics distribution path planning method provided in this application can be applied to Figure 1In the application environment shown. Among them, the terminal 102 communicates with the server 104 through the network. The server 104 obtains the logistics flow direction of each warehouse in the target area uploaded by the terminal 102, determines the destination transfer yard corresponding to the logistics flow direction, screens out the first type of logistics flow direction whose destination transfer yard belongs to the target area, takes the timeliness requirement from the warehouse to the destination transfer yard corresponding to the first type of logistics flow direction as a constraint condition, performs warehouse path planning for the first type of logistics flow direction, obtains the first type of distribution path, determines the second type of logistics flow direction to be planned according to the planned logistics flow direction corresponding to the first type of distribution path, obtains the originating transfer yard corresponding to the second type of logistics flow direction, takes the timeliness requirement from the warehouse to the originating transfer yard corresponding to the second type of logistics flow direction as a constraint condition, performs warehouse path planning for the second type of logistics flow direction, obtains the second type of distribution path, aggregates the first type of distribution path and the second type of distribution path, obtains the logistics distribution path planning result, and feeds back to the terminal 102. Among them, the terminal 102 can be, but is not limited to, various personal computers, laptops, smart phones, tablet computers and portable wearable devices, and the server 104 can be implemented by an independent server or a server cluster composed of multiple servers.

[0065] In one embodiment, Figure 2 As shown in FIG, a logistics distribution path planning method is provided, and the method is applied to Figure 1 Taking the server in as an example, the method includes the following steps 202 to 210.

[0066] Step 202, obtaining the logistics flow direction of the logistics orders of each warehouse in the target area, determining the destination transfer yard corresponding to the logistics flow direction, and screening out the first type of logistics flow direction whose destination transfer yard belongs to the target area.

[0067] The target area refers to a pre-determined designated area, which includes multiple warehouses for warehousing, where goods to be delivered are stored. Each warehouse corresponds to the logistics flow of goods to be delivered, which includes item parameter information (such as item weight, volume), delivery time requirements, delivery destination, etc.

[0068] The transit yard is a logistics processing method in the logistics distribution of large network routes. Specifically, large network routes are usually composed of trunk transportation and branch transportation. Trunk transportation refers to the collection and packaging of goods in the same flow direction at the origin transit yard and unified transportation to the destination transit yard; branch transportation refers to the process of express delivery from the transit yard to the destination delivery outlet or from the delivery outlet to the origin transit yard. The transit yard has different delivery shifts every day. In addition to intra-city express delivery, the existing large network routes usually pass through at least two transit yards: the origin transit yard and the destination transit yard. In order to consider factors such as economy and timeliness when planning large network routes, some flows will pass through 3 or more transit yards.

[0069] The destination transfer yard is the last transfer yard in the trunk transportation. When the logistics arrive at the destination transfer yard, it will be dispatched to the corresponding distribution destination by the destination transfer yard. The first type of logistics flow is used to screen out the flow that meets the requirements of direct delivery from warehouses to destination transfer yards in the region. The transportation scenario of direct delivery from warehouses to destination transfer yards in the region means that the express delivery to different directions in the region will be sorted and packaged in each warehouse, and then the trucks going to different directions will go to each warehouse in turn every day to load the express delivery to the corresponding destination transfer yard. After loading, the goods will be directly transported to the destination transfer yard. After the express delivery is unpacked and sorted at the destination transfer yard, it will be delivered to each customer by the branch line according to the destination. According to the destination transfer yard corresponding to the logistics flow, the first type of logistics flow of the destination transfer yard belonging to the target area is screened out to filter the cross-regional flow, perform simple classification of the logistics flow, and facilitate the data processing efficiency of the planning process of the first type of distribution path.

[0070] In an embodiment, before obtaining the logistics flow direction of the logistics orders of each warehouse in the target area, determining the destination transfer yard corresponding to the logistics flow direction, and screening out the first type of logistics flow whose destination transfer yard belongs to the target area, that is, before step 202, it also includes dividing the area involved in logistics distribution into multiple areas based on the warehouse network coverage relationship.

[0071] For example, considering economic efficiency and feasibility, the country (i.e., the area involved in logistics distribution) can be divided into regions. This division method can be combined with the customer's warehouse network coverage. For example, if a customer's warehouses in Hangzhou and Shanghai cover the needs of Jiangsu, Zhejiang, Shanghai, and Anhui, and the warehouses in Zhongshan and Fuzhou cover the entire cities in South China, Jiangsu, Zhejiang, Shanghai, and Anhui can be divided into the same region, and the cities in South China can be divided into the same region. Through regional division, it is convenient to plan the logistics flow and distribution path for the transportation scenario of direct shipment from warehouses to the destination transfer station within the region.

[0072] Step 204, taking the time efficiency requirement from the warehouse corresponding to the first-category logistics flow to the destination transfer yard as a constraint condition, perform warehouse connection path planning for the first-category logistics flow to obtain a first-category distribution path.

[0073] With the destination transfer yard as the planning end point, the planning of the distribution route is realized from the various warehouses in the target area to the destination transfer yard after being connected. The time efficiency requirement from the warehouse corresponding to the first-category logistics flow to the destination transfer yard corresponding to the first-category logistics flow can be the longest available time determined according to the time efficiency requirement of the logistics flow and the time required for the destination transfer yard to deliver to the customer, or it can be the time efficiency requirement from the pre-planned warehouse to the destination transfer yard. Specifically, the time required for delivery from the destination transfer yard to the customer and the time efficiency requirement from the pre-planned warehouse to the destination transfer yard can be obtained through the existing large-scale network routing data. The large-scale network routing data is obtained through statistical induction based on the time data of the distribution process of the historical logistics flow.

[0074] Warehouse chaining refers to connecting as many warehouses in the target area in series as possible. During the transportation process, trucks go to each warehouse in sequence in the order of chain connection to collect goods.

[0075] In an embodiment, the warehouse connection route planning needs to be based on the time efficiency requirement from the warehouse corresponding to the first-class logistics flow to the destination transfer yard corresponding to the first-class logistics flow as a constraint condition, and planning is carried out with the optimization goal of connecting as many warehouses as possible on a single route, that is, the minimum number of routes, and the first-class distribution route is obtained through planning processing.

[0076] Step 206, determining the second type of logistics flow to be planned according to the planned logistics flow corresponding to the first type of distribution path.

[0077] In the embodiment, the first type of distribution route can be obtained from the initial planned route, so that the logistics flow direction corresponding to the distribution route is determined to be the planned logistics flow direction, and these logistics flows can be distributed based on the planned route. For all logistics flows of warehouses in the target area, except for the planned logistics flow directions, the remaining logistics flows are the second type of logistics flows to be planned.

[0078] In the embodiment, the first type of distribution path can be obtained from the initial planning path, and specifically, the initial planning path can be used as the distribution route. Alternatively, after the initial planning path is determined, the initial planning path can be selected based on actual needs, and some routes can be selected as distribution routes according to the weight of the collected goods on each route, so as to maximize the economic benefits in the logistics distribution process.

[0079] Step 208, obtain the originating transfer yard corresponding to the second-category logistics flow, and use the time efficiency requirement from the warehouse corresponding to the second-category logistics flow to the originating transfer yard as a constraint condition to plan the warehouse-to-warehouse path for the second-category logistics flow to obtain the second-category distribution path.

[0080] The second category of logistics flows includes cross-regional logistics flows. In an embodiment, the second category of logistics flows may also include logistics flows that have not been determined as planned logistics flows in the first category of logistics flows, for example, when the planned first category of distribution routes are abandoned, the logistics flows corresponding to the distribution routes. For example, in the process of string warehouse route planning, the logistics flows are abandoned because direct shipment does not meet the timeliness requirements.

[0081] The main difference between the warehouse-to-warehouse path planning of the second type of logistics flow and the warehouse-to-warehouse path planning of the first type of logistics flow lies in the difference in the destination of the planned route. The warehouse-to-warehouse path planning of the first type of logistics flow takes the destination transfer yard as the destination of the planned route, and the warehouse-to-warehouse path planning of the second type of logistics flow takes the origin transfer yard as the destination of the planned route. Among them, the origin transfer yard and the destination transfer yard can be determined based on the large network routing. For example, the origin transfer yard can be the transfer yard closest to the warehouse, and the destination transfer yard can be the transfer yard closest to the distribution destination. In an embodiment, the timeliness requirement from the warehouse corresponding to the second type of logistics flow to the origin transfer yard corresponding to the second type of logistics flow can be the longest available time determined based on the timeliness requirement of the customer flow, the time from the origin transfer yard to the destination transfer yard, and the time from the destination transfer yard to the customer.

[0082] Step 210, collect the first type of distribution paths and the second type of distribution paths to obtain a logistics distribution path planning result.

[0083] For logistics flows that do not meet the first type of distribution path, that is, direct delivery from warehouses within the region to the destination transfer yard, the second type of distribution path, that is, direct delivery from warehouses within the region to a certain origin transfer yard, is used to process the scenario. Based on the planning of different distribution paths, the trunk line optimization in the large network routing is realized to obtain the logistics distribution path planning result. In one embodiment, conditions can also be set for the second type of distribution path. For logistics flows that do not meet the conditions, the original large network routing method is used to determine its distribution path.

[0084] The above-mentioned logistics distribution path planning method selects the first type of logistics flow to be planned according to whether the destination transfer yard belongs to the target area based on the logistics flow of each warehouse in the target area, and performs warehouse-connected path planning for the first type of logistics flow to obtain a first type of distribution path that meets the time requirements of the warehouse to the destination transfer yard. Then, based on the second type of logistics flow to be planned obtained after the first type of distribution path is confirmed, the second type of logistics flow is performed warehouse-connected path planning to obtain a second type of distribution path that meets the time requirements of the warehouse to the originating transfer yard. By planning the first type of distribution path that directly sends goods from the warehouse to the destination transfer yard through warehouse connection, and the second type of distribution path that first sends goods from the warehouse to the originating transfer yard and then from the originating transfer yard to the destination transfer yard through warehouse connection, the time requirements can be met while minimizing the number of times the tickets pass through the transfer yard during the logistics distribution process, thereby reducing the probability of damage to the goods during the logistics distribution process.

[0085] In one embodiment, Figure 3 As shown, taking the time efficiency requirement from the warehouse to the destination transfer yard corresponding to the first-class logistics flow as a constraint condition, the first-class logistics flow is planned for a warehouse-connected path, and the first-class distribution path includes steps 302 to 306.

[0086] Step 302, taking the time efficiency requirement from the warehouse to the destination transfer yard corresponding to the first-category logistics flow as a constraint condition, perform warehouse-connected path planning for the first-category logistics flow to obtain a first-category initial planned path.

[0087] Step 304, obtaining the weight of the tickets in the logistics flow direction corresponding to the first type of initial planned route, and obtaining the total weight of the tickets corresponding to the first type of initial planned path.

[0088] Step 306, based on the preset first category route quantity threshold, the first category initial planned routes are screened according to the total weight of the tickets to determine the first category delivery route.

[0089] The results obtained from the warehouse-connected path planning are theoretical results. In actual application, the first type of initial planned paths also need to be optimized in combination with the cargo collection conditions of each route. Specifically, the cargo collection conditions of each route are determined by obtaining the weight of the tickets for each logistics flow direction of the planned route, summarizing the ticket weight data, and obtaining the total weight of the tickets corresponding to the first type of initial planned path. Then, the planned routes are sorted by the total weight of the tickets, and a preset number of planned routes with the highest total weight of the tickets are selected as delivery routes. The setting of the threshold for the number of first-category routes can be based on statistical analysis of historical data, or it can be determined based on existing delivery conditions and delivery requirements, and is not limited here.

[0090] It should be noted that, among the first-category initial planning paths, except for the other initial planning paths that are screened and determined as the first-category distribution paths, their corresponding logistics flows will be re-planned as the second-category logistics flows to be planned.

[0091] In one embodiment, Figure 4 As shown, before obtaining the ticket weights of each logistics flow direction corresponding to the first type of initial planned routes and obtaining the total ticket weights corresponding to the first type of initial planned routes, steps 402 to 404 are also included.

[0092] Step 402, obtaining each planned shift of the first type of initial planned path, and marking the planned shift with the latest departure time from the originating warehouse as the delivery shift corresponding to the first type of initial planned path.

[0093] Step 404, determining the collection time of the first type of initial planned route according to the delivery shifts, the timeliness requirements of the logistics flow of each warehouse and the required delivery time.

[0094] Obtaining the weight of the tickets in the logistics flow direction corresponding to the first type of initial planned route and obtaining the total weight of the tickets corresponding to the first type of initial planned path includes steps 406 to 408.

[0095] Step 406, determining the logistics flow direction corresponding to the first type of initial planned route according to the collection time.

[0096] Step 408, obtaining the weight of the tickets in the logistics flow direction corresponding to the first type of initial planned route, and obtaining the total weight of the tickets corresponding to the first type of initial planned route by adding up the weights.

[0097] Since each transfer station has multiple shifts, the same route will also have multiple shifts after planning. In order to load as much cargo as possible on each route, the latest departure time of the departure warehouse will be selected as the delivery shift for the same route. At the same time, for each route, it will be considered whether the cargo can be collected, that is, it can be sent once every few days, so as to reduce the number of transportation trips and costs. The number of days for collecting cargo on each route needs to be determined according to the delivery time of each warehouse and the transportation time requirements of each customer. Take the destination area as Central China and the destination transfer yard as Changsha transfer yard, and plan a route from Central China to Changsha transfer yard: Zhengzhou warehouse-Wuhan warehouse 1-Wuhan warehouse 2-Changsha warehouse-Changsha transfer yard. The timeliness requirement of each customer on this route is to complete the delivery within 48 hours. In the end, the delivery time of Zhengzhou warehouse, Wuhan warehouse 1, Wuhan warehouse 2 and Changsha warehouse is 28.17 hours, 15 hours, 13 hours and 5 hours respectively. Therefore, the number of days for collecting goods at Zhengzhou warehouse is rounded up to (48-28.17) / 24, that is, 1 day. Similarly, the number of days for collecting goods at Wuhan warehouse 1, Wuhan warehouse 2 and Changsha warehouse is 2 days. According to the barrel law, this route can only collect goods for 1 day to ensure the timeliness of express delivery at each warehouse, thus determining the collection time of the planned route. After determining the number of collection days for the route, the number of pieces that can be loaded on each departure of each route within a period of time and the weight of the pieces of the logistics order corresponding to the logistics flow during the collection time are calculated based on the number of collection days to obtain the total weight of the pieces corresponding to the initial planned route.

[0098] In one embodiment, taking the time efficiency requirement from the warehouse corresponding to the first-class logistics flow direction to the destination transfer yard corresponding to the first-class logistics flow direction as a constraint condition, performing warehouse-connected path planning for the first-class logistics flow direction, and obtaining the first-class distribution path includes: obtaining the distance matrix and time matrix with each warehouse and each destination transfer yard as the starting and ending points, the time efficiency requirement between the starting and ending points, and the time data corresponding to each warehouse and each destination transfer yard. Taking the time efficiency requirement from the warehouse corresponding to the first-class logistics flow direction to the destination transfer yard as a constraint condition, performing warehouse-connected path planning based on the distance matrix, time matrix and time data, and obtaining the first-class distribution path.

[0099] Before planning the route of warehouse linkage, data preprocessing is required to prepare the data input required for the entire route planning. Specifically, it includes: the timeliness requirements of the flow from each warehouse to each transfer yard, the distance matrix and time matrix between each warehouse and each city transfer yard, the working hours of each warehouse, the dispatch shift time and delivery duration of each destination transfer yard in the large network route planning, and the customer's daily order data. For warehouses in the same area, the distance matrix, time matrix, working hours of each warehouse, loading time, dispatch shift time of each destination transfer yard, etc. are used as inputs, and the timeliness requirements of each flow direction are used as constraints for route planning, and the order and time of each route arriving at each warehouse and the destination transfer yard are obtained.

[0100] In one embodiment, the time efficiency requirement from the warehouse to the destination transfer yard corresponding to the first type of logistics flow is used as a constraint condition, and based on the distance matrix, time matrix and time data, warehouse-connected path planning is performed to obtain a first type of distribution path, including: taking the time efficiency requirement from the warehouse to the destination transfer yard corresponding to the first type of logistics flow as a constraint condition, with the minimum total number of routes as the main optimization goal and the shortest total time as the secondary optimization goal, warehouse-connected path planning is performed based on the distance matrix, time matrix and time data to obtain a first type of distribution path.

[0101] In one embodiment, each warehouse (starting point) has goods going to different transfer stations (end points), and the truck collects goods from warehouses going to the same transfer station. The route optimization model needs to decide the total number of routes required and the order of warehouses passed by each route. The main goal of the model is to connect warehouses as much as possible on a single route, that is, the number of routes is the least; the secondary goal is to minimize the time spent on the route. The following are the specific matters related to the model:

[0102] The meanings of model related parameters are as follows:

[0103] T: A set of numbers of possible routes t after planning

[0104] N: the set of all warehouse points

[0105] O: Virtual starting point

[0106] D: Destination (destination transfer station) collection

[0107] A: A set of arcs, including ON, NN, ND

[0108] T ij : The time matrix from node i to node j, where (i,j)∈A

[0109] LT: loading time of each warehouse

[0110] DT j : The delivery time of m at the destination transfer station, where j∈D

[0111] SLA: Maximum allowed travel time

[0112] Model decision variables:

[0113]

[0114]

[0115]

[0116] Model objectives:

[0117] (1) The minimum number of routes

[0118] Min∑ t∈T (w t ) [1]

[0119] (2) The total journey time is shortest

[0120]

[0121] Model constraints:

[0122]

[0123]

[0124]

[0125]

[0126] Among them, constraint [3] means that each warehouse is assigned to only one route. Constraint [4] means that each node of each route t is only passed once. Constraint [5] indicates the relationship between inflow and outflow of each node. For the virtual starting point, there is only outflow; for each warehouse node, inflow equals outflow; for the end point (destination transfer station), there is only inflow. Constraint [6] means that the time taken for the entire journey should not exceed the agreed time limit.

[0127] In one embodiment, Figure 5 As shown, the starting transfer yard corresponding to the second-category logistics flow is obtained, and the time efficiency requirement from the warehouse corresponding to the second-category logistics flow to the starting transfer yard is used as a constraint condition to perform warehouse connection path planning for the second-category logistics flow, and the second-category distribution path obtained includes steps 502 to 506.

[0128] Step 502, obtain the starting transfer yard corresponding to the second-category logistics flow, and plan the warehouse-connecting path for the second-category logistics flow based on the time efficiency requirement from the warehouse corresponding to the second-category logistics flow to the starting transfer yard to obtain the second-category initial planned path.

[0129] Step 504, obtaining the weight of the tickets corresponding to each logistics flow direction of the second type of initial planned route, and obtaining the total weight of the tickets corresponding to the second type of initial planned route.

[0130] Step 506, based on the preset second category route quantity threshold, the second category initial planned routes are screened according to the total weight of the tickets to determine the second category delivery routes.

[0131] In the embodiment, in combination with the feasibility and economy of actual operation, the relevant operation management personnel will determine that the reasonable number of routes for opening direct first-class distribution routes is X. According to the statistical weight of tickets of each route, the route with the ticket weight of the reserved route in the top X is selected as the first-class distribution route. After determining the first-class distribution route, it is necessary to determine the second-class logistics flow to be planned, that is, to collect and sort out the flow that needs to be carried out by the second-class distribution route, including cross-regional flow, flow from the warehouse directly to the destination transfer station city exceeding the customer's given time limit, and the flow of the ticket weight of the first-class initial planning route is not in the top X routes. By obtaining the collection shift time and the corresponding delivery time of the departure transfer station of each flow direction in the large network route planning, similar to the warehouse route planning of the first-class logistics flow direction, the distance matrix, the working hours of each warehouse, the loading time, the delivery shift time and the delivery time of each departure transfer station are used as inputs, and the time limit requirements of each flow direction are used as constraints to perform route planning, and the order and time of each route arriving at each warehouse and the departure transfer station are obtained. The specific path optimization model is similar to the warehouse-linking route planning model of the first type of logistics flow, except that the terminal node in this scenario is the starting transfer yard. For example, taking the logistics flow of warehouses in Chengdu to the Guiyang transfer yard as an example, warehouses in various regions of Chengdu, such as Chengdu Warehouse 1, Chengdu Warehouse 2, and Chengdu Warehouse 3, are processed through warehouse-linking and first transported to the Chengdu transfer yard. The Chengdu transfer yard is used as the starting transfer yard for docking and collection, and then shipped from the Chengdu transfer yard to the Guiyang transfer yard.

[0132] In one embodiment, the first-class distribution path and the second-class distribution path are aggregated to obtain the logistics distribution path planning result, including: determining the third-class logistics flow direction to be planned according to the planned logistics flow direction corresponding to the first-class distribution path and the planned logistics flow direction corresponding to the second-class distribution path. Obtaining the large network routing data, planning the path of the third-class logistics flow direction according to the large network routing data, and obtaining the third-class distribution path corresponding to the third-class logistics flow direction. The first-class distribution path, the second-class distribution path, and the third-class distribution path are aggregated to obtain the logistics distribution path planning result.

[0133] In the embodiment, in combination with the feasibility and economy of actual operation, the relevant operation management personnel will determine the reasonable number of routes for opening the second type of direct delivery route as Y, and by counting the weight of each route of the second type of initial planning route, select the routes with the ticket weight in the first Y as the second type of delivery routes. For the logistics flow that is not in the first type of delivery route and the second type of delivery route, the transportation mode of its current large network route will be retained, and its specific route details will be screened from the large network route to determine its delivery route, and the route details include the overall delivery time and the number of transit stations passed, etc.

[0134] In the embodiment, by integrating the flow routes of the three scenarios, the logistics distribution path planning results are obtained. The final timeliness of all ticket quantities and the number of transfers saved can also be counted to achieve data analysis and integration, and configure reasonable line quantity thresholds for the first type of distribution path and the second type of distribution path.

[0135] The above-mentioned logistics distribution path planning method proposes a new transportation mode of combining string warehouses and large network routes within the region, which can effectively save the transit costs of express delivery through transit yards during trunk transportation and reduce the overall transportation cost. The customer's agreed time limit is used as a constraint in the path optimization process, which can ensure the achievement rate of the customer's time limit; since the damage rate is directly proportional to the number of transfers, reducing the number of transfers on the trunk line can effectively reduce the damage rate.

[0136] In a specific embodiment, the logistics distribution path planning method is described by taking the logistics flow in the target area as three types of scenarios. Figure 6 , including: Scenario 1, direct shipment from warehouses within a region to the destination transfer yard; Scenario 2, direct shipment from warehouses within a region to a certain originating transfer yard; Scenario 3, current large network routing.

[0137] Specifically, scenario 1 means that express deliveries to different directions will be sorted and packaged in each warehouse, and then trucks to different directions will go to each warehouse in turn every day to load express deliveries to the corresponding destinations. After loading, the goods will be directly delivered to the destination city transfer yard. After the express deliveries are unpacked and sorted at the destination city transfer yard, they will be delivered to each customer by branch lines. This transportation scenario only passes through one transfer yard throughout the entire process, that is, each express delivery is only charged one transfer fee, but because it is necessary to ensure the economy of long-distance truck transportation and the full load rate of the truck, it is only applicable to certain directions with a large number of tickets.

[0138] In scenario 2, due to the economic efficiency of transportation, the express delivery volume from each warehouse to certain destination cities is not enough to meet the cargo volume requirements on the highway after being gathered. Therefore, for some goods with less volume than scenario 1, after sorting and packing in each warehouse, trucks will go to each warehouse in turn to load and gather, and then transport them to a certain origin transfer yard, and then go to the destination transfer yard via a large network route. Since the express delivery in this transportation scenario has been sorted and packed in each warehouse in advance, except for unpacking and sorting at the destination transfer yard, the transfer yard on the way is just a stopover operation, so each express delivery is only charged a transfer fee once during the entire process.

[0139] Scenario 3: For flows with very small volumes other than Scenario 1 and Scenario 2, the original mode of transportation via the large network will be maintained, that is, the express deliveries from each warehouse will be gathered at the corresponding originating transit yard, and then sorted and packaged at the originating transit yard, and then sent directly to the destination transit yard after passing through several transit yards.

[0140] The selection process of delivery route planning in different scenarios can be found in Figure 7 First, scenario 1 is used to plan the routes of all flows in the target area, that is, all logistics flows. Based on the planned initial path, statistics are made on whether the tickets of each route after planning are in the top X in weight order. If so, logistics flow distribution is carried out according to scenario 1. If not, scenario 2 is used to plan the routes of the screened flow directions to be planned. Then, based on the planned initial path, statistics are made on whether the tickets of each route after planning are in the top Y in weight order. If so, logistics flow distribution is carried out according to scenario 2. If not, the corresponding large network route is determined, and logistics flow distribution is carried out according to scenario 3.

[0141] Since scenario 1 replans the transportation route based on the time limit given by the customer when planning the route, it can meet the delivery time limit given by the customer as much as possible and reduce the transit costs during the transportation process to a large extent. Therefore, when selecting the transportation mode scenarios for each flow direction, it is first assumed that all flows can meet the transportation scenario of scenario 1 for route planning, and then the collection analysis of each route is performed according to the results of the path optimization model. The number of tickets collected by each route through the string warehouse every day is counted, and the appropriate number of direct delivery routes X is set in combination with the truck full load rate requirements, and then the flow direction in the route with the ticket weight in the top X is selected as the flow direction of scenario 1. Similar to the flow direction selection of scenario 1, the route planning of scenario 2 is performed for all flows after scenario 1 is screened, and then the collection analysis of each route is performed according to the results of the path optimization model. By setting the appropriate number of routes in scenario 2 Y, the flow direction in the route with the ticket weight in the top Y is selected as the flow direction of scenario 2. Scenario 1 and Scenario 2 flows are screened out from all flows, and the remaining flows are all flows with a smaller volume of tickets. This part of the flow maintains the current large network trunk route transportation method to reach the destination transfer yard.

[0142] Specifically, the data processing process of logistics distribution path planning is as follows: Figure 8As shown in the figure, first, the data of all flows in the target area is preprocessed to prepare the data input required for the entire route planning. Then, based on the regional division, the flow direction in the target area is selected, and the route pre-planning of scenario 1 is performed to obtain the initial planned route. Then, through the departure schedule planning and the measurement of the number of collected goods, the routes with the ticket weight ranking in the top X are screened out from the initial planned routes to determine the flow direction of scenario 1. Then, the screened cross-regional flows, the direct delivery timeout flows in the process of route pre-planning of scenario 1, and the flows with the ticket weight ranking after X are summarized. The destination of the route planning of the starting transfer yard and warehouse of the summarized flows is also preprocessed and route pre-planning of scenario 2 is performed. According to the departure schedule planning and the measurement of the number of collected goods, the routes with the ticket weight ranking in the top Y are screened out from the initial planned routes to determine the flow direction of scenario 2. For the routes with the ticket weight ranking after Y, the distribution path is determined based on the large network routing.

[0143] It should be understood that although Figure 2-5 The steps in the flowchart are shown in sequence as indicated by the arrows, but these steps are not necessarily executed in the order indicated by the arrows. Unless otherwise specified in this document, there is no strict order restriction for the execution of these steps, and these steps can be executed in other orders. Moreover, Figure 2-5 At least part of the steps may include multiple steps or multiple stages. These steps or stages are not necessarily performed at the same time, but can be performed at different times. The execution order of these steps or stages is not necessarily sequential, but can be performed in turn or alternately with other steps or at least part of the steps or stages in other steps.

[0144] In one embodiment, Fig. 9 As shown, a logistics distribution path planning device is provided, including: a first-type logistics flow direction screening module 902, a first-type distribution path planning module 904, a second-type logistics flow direction determination module 906, a second-type distribution path planning module 908 and a logistics distribution path planning result determination module 910, wherein:

[0145] The first type logistics flow screening module 902 is used to obtain the logistics flow of logistics orders of each warehouse in the target area, determine the destination transfer yard corresponding to the logistics flow, and screen out the first type of logistics flow whose destination transfer yard belongs to the target area;

[0146] The first distribution path planning module 904 is used to perform warehouse-connected path planning for the first-type logistics flow direction based on the time efficiency requirement from the warehouse to the destination transfer yard corresponding to the first-type logistics flow direction as a constraint condition to obtain the first-type distribution path;

[0147] The second-category logistics flow direction determination module 906 is used to determine the second-category logistics flow direction to be planned according to the planned logistics flow direction corresponding to the first-category distribution path;

[0148] The second type of distribution path planning module 908 is used to obtain the origin transfer site corresponding to the second type of logistics flow, and perform warehouse path planning for the second type of logistics flow based on the time efficiency requirement from the warehouse corresponding to the second type of logistics flow to the origin transfer site, so as to obtain the second type of distribution path;

[0149] The logistics distribution path planning result determination module 910 is used to collect the first type of distribution paths and the second type of distribution paths to obtain the logistics distribution path planning result.

[0150] In one embodiment, the first-class distribution path planning module is also used to perform warehouse-to-warehouse path planning for the first-class logistics flow direction with the time efficiency requirement from the warehouse to the destination transfer yard corresponding to the first-class logistics flow direction as a constraint condition, and obtain the first-class initial planned path; obtain the ticket weight of the logistics flow direction corresponding to the first-class initial planned route, and obtain the total ticket weight corresponding to the first-class initial planned path; according to the preset first-class line quantity threshold, the first-class initial planned path is screened according to the total ticket weight to determine the first-class distribution path.

[0151] In one embodiment, the first-class distribution path planning module is also used to obtain the planned shifts of the first-class initial planned path, and mark the planned shift with the latest departure time from the originating warehouse as the delivery shift corresponding to the first-class initial planned path; determine the collection time of the first-class initial planned path according to the delivery shifts, the timeliness requirements of the logistics flow directions of each warehouse and the required delivery time; determine the logistics flow direction corresponding to the first-class initial planned route according to the collection time; obtain the ticket weight of the logistics flow direction corresponding to the first-class initial planned route, and obtain the total ticket weight corresponding to the first-class initial planned path by adding up the weights.

[0152] In one embodiment, the first-class distribution path planning module is also used to obtain the distance matrix and time matrix with each warehouse and each destination transfer yard as the starting and ending points, the time requirements between the starting and ending points, and the time data corresponding to each warehouse and each destination transfer yard; using the time requirements from the warehouse to the destination transfer yard corresponding to the first-class logistics flow as constraints, based on the distance matrix, time matrix and time data, a string warehouse path planning is performed to obtain the first-class distribution path.

[0153] In one embodiment, the first-class distribution path planning module is also used to use the time efficiency requirement from the warehouse corresponding to the first-class logistics flow to the destination transfer yard as a constraint condition, with the minimum total number of routes as the main optimization goal and the shortest total time as the secondary optimization goal, to perform warehouse string path planning based on the distance matrix, time matrix and time data to obtain the first-class distribution path.

[0154] In one embodiment, the second-category distribution path planning module is also used to perform warehouse-connected path planning for the second-category logistics flow with the time efficiency requirement from the warehouse to the starting transfer yard corresponding to the second-category logistics flow as a constraint condition, and obtain a second-category initial planned path; obtain the ticket weight of each logistics flow corresponding to the second-category initial planned route, and obtain the total ticket weight corresponding to the second-category initial planned path; according to a preset second-category line quantity threshold, the second-category initial planned path is screened according to the total ticket weight to determine the second-category distribution path.

[0155] In one embodiment, the logistics distribution path planning result determination module is also used to determine the third type of logistics flow to be planned based on the planned logistics flow corresponding to the first type of distribution path and the planned logistics flow corresponding to the second type of distribution path; obtain the large network routing data, and plan the path of the third type of logistics flow according to the large network routing data to obtain the third type of distribution path corresponding to the third type of logistics flow; collect the first type of distribution path, the second type of distribution path and the third type of distribution path to obtain the logistics distribution path planning result.

[0156] The above-mentioned logistics distribution path planning device selects the first type of logistics flow to be planned according to whether the destination transfer yard belongs to the target area based on the logistics flow of each warehouse in the target area, and performs warehouse-connecting path planning for the first type of logistics flow to obtain a first type of distribution path that meets the time requirements of the warehouse to the destination transfer yard, and then performs warehouse-connecting path planning for the second type of logistics flow based on the second type of logistics flow to be planned obtained after the first type of distribution path is confirmed, to obtain a second type of distribution path that meets the time requirements of the warehouse to the originating transfer yard, by planning the first type of distribution path that directly sends the goods from the warehouse to the destination transfer yard through warehouse connection, and the second type of distribution path that first sends the goods from the warehouse to the originating transfer yard through warehouse connection and then sends the goods from the originating transfer yard to the destination transfer yard, it is possible to reduce the number of times the tickets pass through the transfer yard during the logistics distribution process as much as possible while meeting the time requirements, thereby reducing the probability of damage to the goods during the logistics distribution process.

[0157] For the specific definition of the logistics distribution path planning device, please refer to the definition of the logistics distribution path planning method above, which will not be repeated here. Each module in the above-mentioned logistics distribution path planning device can be implemented in whole or in part by software, hardware and their combination. The above-mentioned modules can be embedded in or independent of the processor in the computer device in the form of hardware, or can be stored in the memory of the computer device in the form of software, so that the processor can call and execute the operations corresponding to the above modules.

[0158] In one embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as follows: Fig.10As shown. The computer device includes a processor, a memory and a network interface connected through a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store path planning data. The network interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a logistics distribution path planning method is implemented.

[0159] Those skilled in the art will understand that Fig.10 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0160] In one embodiment, a computer device is further provided, including a memory and a processor, wherein a computer program is stored in the memory, and the processor implements the steps in the above method embodiments when executing the computer program.

[0161] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the steps in the above-mentioned method embodiments are implemented.

[0162] Those of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided in this application can include at least one of non-volatile and volatile memory. Non-volatile memory may include read-only memory (ROM), magnetic tape, floppy disk, flash memory or optical memory, etc. Volatile memory may include random access memory (RAM) or external cache memory. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM).

[0163] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0164] The above embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the invention patent. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the patent of the present application shall be subject to the attached claims.

Claims

1. A logistics distribution path planning method, characterized in that: The method comprises: Obtain the logistics flow direction of the logistics orders of each warehouse in the target area, determine the destination transfer yard corresponding to the logistics flow direction, and filter out the first type of logistics flow direction whose destination transfer yard belongs to the target area; the first type of logistics flow direction is used to filter out the flow direction that meets the requirements of direct shipment from warehouses to destination transfer yards in the region; Taking the time efficiency requirement from the warehouse to the destination transfer yard corresponding to the first-category logistics flow direction as a constraint condition, a warehouse-connected path planning is performed for the first-category logistics flow direction to obtain a first-category distribution path; the first-category distribution path refers to a distribution path that connects warehouses in a region and directly sends to the destination transfer yard; Determine a second type of logistics flow direction to be planned according to the planned logistics flow direction corresponding to the first type of distribution path; the second type of logistics flow direction refers to all logistics flows in the target area except the planned logistics flow direction; Obtain the originating transfer yard corresponding to the second-category logistics flow direction, and plan the warehouse-to-warehouse path for the second-category logistics flow direction with the time efficiency requirement from the warehouse corresponding to the second-category logistics flow direction to the originating transfer yard as a constraint condition to obtain the second-category distribution path; the second-category distribution path refers to the distribution path that directly sends from warehouses to the originating transfer yard in the region; The first type of distribution path and the second type of distribution path are aggregated to obtain a logistics distribution path planning result; the aggregation refers to integrating the first type of distribution path and the second type of distribution path.

2. The method according to claim 1, characterized in that Taking the time efficiency requirement from the warehouse to the destination transfer yard corresponding to the first-type logistics flow direction as a constraint condition, performing warehouse-connected path planning for the first-type logistics flow direction, and obtaining the first-type distribution path includes: Taking the time efficiency requirement from the warehouse to the destination transfer yard corresponding to the first-category logistics flow direction as a constraint condition, performing warehouse-connected path planning for the first-category logistics flow direction to obtain a first-category initial planning path; Obtain the weight of the parcels in the logistics flow direction corresponding to the first type of initial planned path, and obtain the total weight of the parcels corresponding to the first type of initial planned path; According to the preset threshold value of the number of first-category routes, the first-category initially planned routes are screened according to the total weight of the tickets to determine the first-category delivery routes.

3. The method according to claim 2, characterized in that Before obtaining the weight of the tickets in the logistics flow direction corresponding to the first type of initial planned path and obtaining the total weight of the tickets corresponding to the first type of initial planned path, the method further includes: Obtain each planned shift of the first type of initial planned route, and mark the planned shift with the latest departure time from the originating warehouse as the delivery shift corresponding to the first type of initial planned route; Determine the collection time of the first type of initial planned route according to the delivery shifts, the timeliness requirements of the logistics flow of each warehouse and the required delivery time; The step of obtaining the weight of the items in the logistics flow direction corresponding to the first type of initial planned path to obtain the total weight of the items corresponding to the first type of initial planned path includes: Determine the logistics flow direction corresponding to the first type of initial planned path according to the collection time; The weight of the tickets in the logistics flow direction corresponding to the first type of initial planned path is obtained, and the total weight of the tickets corresponding to the first type of initial planned path is obtained by adding up the weights.

4. The method according to claim 1, characterized in that: Taking the time efficiency requirement from the warehouse to the destination transfer yard corresponding to the first-type logistics flow direction as a constraint condition, performing warehouse-connected path planning for the first-type logistics flow direction, and obtaining the first-type distribution path includes: Obtain the distance matrix and time matrix with each warehouse and each destination transfer station as the starting and ending points, the timeliness requirements between the starting and ending points, and the time data corresponding to each warehouse and each destination transfer station; Taking the time efficiency requirement from the warehouse corresponding to the first type of logistics flow to the destination transfer yard as a constraint condition, based on the distance matrix, the time matrix and the time data, a warehouse chain path planning is performed to obtain a first type of distribution path.

5. The method according to claim 4, characterized in that The time efficiency requirement from the warehouse to the destination transfer yard corresponding to the first type of logistics flow is used as a constraint condition, and based on the distance matrix, the time matrix and the time data, a warehouse-connected path planning is performed to obtain the first type of distribution path, which includes: Taking the time efficiency requirement from the warehouse to the destination transfer yard corresponding to the first type of logistics flow as the constraint condition, with the minimum total number of routes as the main optimization goal and the shortest total time as the secondary optimization goal, based on the distance matrix, the time matrix and the time data, the warehouse string path planning is carried out to obtain the first type of distribution path.

6. The method according to any one of claims 1 to 5, characterized in that: The second type of distribution path is obtained by performing warehouse-to-warehouse path planning on the second type of logistics flow direction with the time efficiency requirement from the warehouse to the originating transfer yard corresponding to the second type of logistics flow direction as a constraint condition, and includes: Taking the time efficiency requirement from the warehouse to the originating transfer yard corresponding to the second-type logistics flow direction as a constraint condition, perform warehouse-connected path planning for the second-type logistics flow direction to obtain the second-type initial planning path; Obtain the weight of each item of the second type of initial planning path corresponding to each logistics flow direction, and obtain the total weight of the items of the second type of initial planning path; According to the preset second category route quantity threshold, the second category initial planned routes are screened according to the total weight of the tickets to determine the second category delivery routes.

7. The method according to claim 6, characterized in that The collecting of the first type of distribution path and the second type of distribution path to obtain a logistics distribution path planning result includes: Determine a third type of logistics flow direction to be planned according to the planned logistics flow direction corresponding to the first type of distribution path and the planned logistics flow direction corresponding to the second type of distribution path; Obtaining large network routing data, performing path planning for the third-category logistics flow direction according to the large network routing data, and obtaining a third-category distribution path corresponding to the third-category logistics flow direction; The first type of distribution path, the second type of distribution path and the third type of distribution path are aggregated to obtain a logistics distribution path planning result.

8. A logistics distribution path planning device, characterized in that: The device comprises: The first type of logistics order screening module is used to obtain the logistics flow direction of the logistics orders of each warehouse in the target area, determine the destination transfer yard corresponding to the logistics flow direction, and screen out the first type of logistics flow direction whose destination transfer yard belongs to the target area; the first type of logistics flow direction is used to screen out the flow direction that meets the requirements of direct shipment from warehouses to destination transfer yards in the region; The first type of distribution path planning module is used to plan the warehouse-to-destination transfer yard path for the first type of logistics flow direction based on the timeliness requirement from the warehouse to the destination transfer yard corresponding to the first type of logistics flow direction as a constraint condition to obtain the first type of distribution path; the first type of distribution path refers to the distribution path that directly sends from warehouses to destination transfer yards within the region; A second-category logistics flow direction determination module is used to determine a second-category logistics flow direction to be planned according to the planned logistics flow direction corresponding to the first-category distribution path; the second-category logistics flow direction refers to all logistics flows in the target area, except for the planned logistics flow direction; The second type of distribution path planning module is used to obtain the originating transfer yard corresponding to the second type of logistics flow direction, and to plan the warehouse-to-warehouse path for the second type of logistics flow direction based on the time efficiency requirement from the warehouse corresponding to the second type of logistics flow direction to the originating transfer yard, so as to obtain the second type of distribution path; the second type of distribution path refers to the distribution path that directly sends from warehouses to the originating transfer yard in the region; The logistics distribution path planning result determination module is used to aggregate the first category of distribution paths and the second category of distribution paths to obtain a logistics distribution path planning result; the aggregation refers to integrating the first category of distribution paths and the second category of distribution paths.

9. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 7 are implemented.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.

Images