Distribution capacity scheduling method and device

Abstract

The embodiment of the invention provides a distribution transport capacity dispatching method and device, and the method comprises the steps: obtaining historical distribution data in a to-be-dispatched region, and determining the total estimated demand of commodities and the estimated demand of sold commodities in a preset time period according to the historical distribution data, determining a first transport capacity demand quantity required by the sales goods according to the estimated demand quantity of the sales goods; under the condition that the first transport capacity demand quantity exceeds a first transport capacity threshold value, determining a second transport capacity demand quantity required by non-marketable goods according to the total estimated demand quantity of the goods and the first transport capacity demand quantity required by the marketable goods; and under the condition that the second transport capacity demand quantity does not exceed a second transport capacity threshold value, updating the first transport capacity demand quantity, and generating a transport capacity scheduling plan of the to-be-scheduled area in a preset time period according to the updated first transport capacity demand quantity, the estimated demand quantity of the sales goods and the point location information in the to-be-scheduled area. The transport capacity scheduling plan can be generated in advance, and large allocation pressure caused by too large received order quantity is avoided.

Description

Technical Field

[0001] The embodiments of this specification relate to the field of logistics technology, and more particularly to a distribution capacity scheduling method and device. Background Art

[0002] With the advancement of technology, online shopping not only saves time, but also provides a wider range of products, and is gradually gaining widespread favor among consumers. However, since some products have high requirements for storage conditions, if merchants do not transfer products between warehouses in a timely or accurate manner, it will lead to excessive inventory and corruption, or consumers will not be able to receive the goods in time, thus affecting consumers' shopping experience. For merchants, the transfer time of these products is limited, and the order volume of users is uncontrollable. The increase in order volume will lead to an increase in the workload of regional distribution centers, and thus the transfer and delivery of goods cannot be completed efficiently.

[0003] Therefore, how to improve the efficiency of cargo distribution while effectively controlling the cost of cargo distribution has become an urgent problem to be solved. Summary of the invention

[0004] In view of this, an embodiment of this specification provides a method for dispatching a distribution capacity. One or more embodiments of this specification also relate to a distribution capacity dispatching device, a computing device, a computer-readable storage medium and a computer program to solve the technical defects existing in the prior art.

[0005] According to a first aspect of an embodiment of this specification, a distribution capacity scheduling method is provided, including: Acquire historical delivery data in the area to be dispatched, determine the total estimated demand for goods and the estimated demand for best-selling products within a preset time period according to the historical delivery data, and determine the first transportation capacity required for the best-selling products according to the estimated demand for the best-selling products; When the first transportation capacity demand exceeds the first transportation capacity threshold, determining the second transportation capacity demand required for the non-best-selling product according to the total estimated demand for the product and the first transportation capacity demand required for the best-selling product; When the second capacity demand does not exceed the second capacity threshold, the first capacity demand is updated, and a capacity scheduling plan for the area to be scheduled within the preset time period is generated based on the updated first capacity demand, the estimated demand for the best-selling products, and the point information in the area to be scheduled.

[0006] Optionally, determining the total estimated demand for goods within a preset time period according to the historical delivery data includes: Filtering out the completed historical orders within the historical time period corresponding to the preset time period from the historical delivery data, wherein the completed historical orders refer to the orders actually received and completed within the historical time period; The total estimated demand for the commodity within the preset time period is determined according to the historical demand for the commodity in the historical completed orders.

[0007] Optionally, the area to be dispatched includes at least two delivery points; Determining the estimated demand for best-selling products within a preset time period based on the historical orders includes: Determine the vehicle type information of the area to be dispatched; Determine the historical demand for at least two types of goods corresponding to each of the delivery points according to the historical orders, and predict the estimated demand for at least two types of goods corresponding to the delivery points according to the historical demand for at least two types of goods; sorting the estimated demand for at least two types of goods at each location; Determine the estimated demand for the best-selling product at each delivery point according to the sorting result and the first preset rule; The estimated demand for the best-selling product at each of the distribution points is combined to obtain the estimated demand for the best-selling product.

[0008] Optionally, determining the first transportation capacity requirement required for the best-selling product according to the estimated demand for the best-selling product includes: Determining a demand scaling factor and vehicle type information of the area to be scheduled, wherein the demand scaling factor is used to indicate the accuracy of the estimated demand for the commodity relative to the actual demand; Calculate the estimated volume of the best-selling product according to the scaling factor and the estimated demand of the best-selling product; The first transportation capacity requirement is determined based on the estimated volume of the best-selling product and the vehicle model information.

[0009] Optionally, determining the demand scaling factor of the area to be scheduled includes: Filtering the historical orders completed within the historical time period corresponding to the preset time period from the historical delivery data; Determine the actual historical demand for the commodity in the historical order, and the historical forecast demand for the commodity corresponding to the historical time period, wherein the historical forecast demand for the commodity is a past forecast result of the demand for the commodity within the historical time period; The demand scaling factor is determined according to the historical actual demand for the commodity and the historical predicted demand for the commodity.

[0010] Optionally, determining the second transportation capacity requirement required for the non-best-selling product according to the total estimated demand for the product and the first transportation capacity requirement required for the best-selling product includes: Determine the vehicle type information of the area to be dispatched, and determine the total transportation capacity demand according to the total estimated demand for the goods and the vehicle type information; The second transportation capacity requirement required for the non-best-selling product is calculated based on the total transportation capacity requirement and the first transportation capacity requirement.

[0011] Optionally, the method further includes: When the second transportation capacity demand exceeds the second transportation capacity threshold, a transportation capacity scheduling plan for the area to be scheduled within the preset time period is generated based on the first transportation capacity demand, the estimated demand for the best-selling product and the point information in the area to be scheduled.

[0012] Optionally, before updating the first transport capacity demand, the method further includes: Determining whether the first transport capacity demand is greater than or equal to a third transport capacity threshold; If yes, then executing the step of updating the first transport capacity requirement; If not, a transportation capacity dispatch plan for the area to be dispatched within the preset time period is generated according to the first transportation capacity demand, the estimated demand for the best-selling product and the point information in the area to be dispatched.

[0013] Optionally, the method also includes: when the first capacity demand does not exceed the first capacity threshold, generating a capacity scheduling plan for the area to be scheduled within the preset time period based on the first capacity demand, the estimated demand for the best-selling product and the point information in the area to be scheduled.

[0014] Optionally, generating a transportation capacity dispatch plan for the area to be dispatched within the preset time period according to the updated first transportation capacity demand, the estimated demand for the best-selling product, and the point information in the area to be dispatched includes: Determine at least two combined routes based on the updated first transport capacity demand, the estimated demand for the best-selling product, and the location information, and determine a target combined route from the at least two combined routes according to the location information, wherein the target combined route includes at least two branch routes; Determine the delivery order of at least two branch routes according to the target combined route and the route delivery distance; The transportation capacity scheduling plan is generated based on the point information and the delivery sequence.

[0015] Optionally, generating the transport capacity scheduling plan based on the point information and the delivery sequence includes: Determine the total delivery time according to the point information in at least two of the branch routes and the delivery sequence; Determine a first target delivery person according to the total delivery time and the delivery person's preset working hours; The transportation capacity scheduling plan is generated based on the delivery sequence of at least two branch routes, the point information and the first target delivery personnel.

[0016] Optionally, generating a transportation capacity dispatch plan for the area to be dispatched within the preset time period according to the first transportation capacity demand, the estimated demand for the best-selling product, and the point information in the area to be dispatched includes: Determine at least two combined routes based on the first transport capacity demand, the estimated demand for the best-selling product, and the location information, and determine a target combined route from the at least two combined routes according to the location information, wherein the target combined route includes at least two branch routes; Determine the delivery order of at least two branch routes according to the target combined route and the route delivery distance; The transportation capacity scheduling plan is generated based on the point information and the delivery sequence.

[0017] Optionally, generating the transport capacity scheduling plan based on the point information and the delivery sequence includes: Determine the total delivery time according to the point information in at least two of the branch routes and the delivery sequence; Determine a second target delivery person according to the total delivery time and the delivery person's preset working hours; The transportation capacity scheduling plan is generated based on the delivery sequence of at least two branch routes, the point information and the second target delivery personnel.

[0018] According to a second aspect of the embodiments of this specification, a distribution capacity scheduling device is provided, including: A first transport capacity calculation module is configured to obtain historical delivery data in the area to be dispatched, determine the total estimated demand for goods and the estimated demand for best-selling products within a preset time period according to the historical delivery data, and determine the first transport capacity required for the best-selling products according to the estimated demand for the best-selling products; A second transportation capacity calculation module is configured to determine a second transportation capacity requirement required for a non-best-selling product based on the total estimated demand for the product and the first transportation capacity requirement required for the best-selling product when the first transportation capacity requirement exceeds a first transportation capacity threshold; The scheduling plan generation module is configured to update the first capacity demand when the second capacity demand does not exceed the second capacity threshold, and generate a capacity scheduling plan for the area to be scheduled within the preset time period based on the updated first capacity demand, the estimated demand for the best-selling products and the point information in the area to be scheduled.

[0019] According to a third aspect of an embodiment of this specification, a computing device is provided, including: Memory and processor; The memory is used to store computer-executable instructions, and the processor is used to execute the computer-executable instructions. When the computer-executable instructions are executed by the processor, the steps of the above-mentioned distribution capacity scheduling method are implemented.

[0020] According to a fourth aspect of the embodiments of this specification, a computer-readable storage medium is provided, which stores computer-executable instructions, and when the instructions are executed by a processor, the steps of the above-mentioned distribution capacity scheduling method are implemented.

[0021] According to a fifth aspect of the embodiments of this specification, a computer program product is provided, wherein when the computer program is executed in a computer, the computer is caused to execute the steps of the above-mentioned distribution capacity scheduling method.

[0022] One embodiment of the present specification predicts the total estimated demand quantity of goods and the estimated demand quantity of best-selling products through historical distribution data, and pre-estimates the first number of transportation tools required to transport best-selling products and the second number of transportation tools required to transport non-best-selling products, and determines in advance whether it is necessary to allocate transportation tools in advance. When the first transportation capacity demand exceeds the first transportation capacity threshold, it means that more transportation tools are required to transport best-selling products and they need to be allocated in advance. However, considering that there are still non-best-selling products, the second transportation capacity demand required for non-best-selling products may affect the first transportation capacity demand required for best-selling products. Therefore, it is necessary to update the first transportation capacity demand when the second transportation capacity demand does not exceed the second transportation capacity threshold, so that the final first transportation capacity demand is more accurate. Since the demand base of best-selling products is larger, a transportation capacity scheduling plan for the area to be scheduled within a preset time period is generated according to the first transportation capacity demand, the estimated demand for best-selling products and the point information in the area to be scheduled, so that the transportation capacity scheduling plan is more accurate. It realizes the prediction of commodity demand in advance, the prediction of the required transportation capacity in advance, and the generation of transportation capacity scheduling plan, so that after receiving orders in the preset time period, they can be quickly delivered according to the pre-generated transportation capacity scheduling plan, to prevent too many orders received in real time, resulting in excessive allocation pressure, affecting the accuracy of allocation, and thus affecting the distribution efficiency. In addition, the final generated transportation capacity scheduling plan corresponds to the area to be dispatched and the preset time period, that is, the goods within a specific time and geographical range are concentrated for distribution, which can effectively reduce the distribution cost. BRIEF DESCRIPTION OF THE DRAWINGS

[0023] Figure 1 is a flow chart of a distribution capacity scheduling method provided by an embodiment of this specification; Figure 2-1 This is the first part of a processing flow chart of a distribution capacity scheduling method in a fresh food distribution scenario provided by an embodiment of this specification; Figure 2-2 This is the second part of a processing flow chart of a distribution capacity scheduling method in a fresh food distribution scenario provided by an embodiment of this specification; Figure 3 It is a structural schematic diagram of a distribution capacity scheduling device provided by an embodiment of this specification; Figure 4 It is a structural block diagram of a computing device provided by an embodiment of this specification. DETAILED DESCRIPTION

[0024] Many specific details are described in the following description to facilitate a full understanding of this specification. However, this specification can be implemented in many other ways than those described herein, and those skilled in the art can make similar generalizations without violating the connotation of this specification, so this specification is not limited to the specific implementation disclosed below.

[0025] The terms used in one or more embodiments of this specification are only for the purpose of describing specific embodiments, and are not intended to limit one or more embodiments of this specification. The singular forms of "a", "said" and "the" used in one or more embodiments of this specification and the appended claims are also intended to include plural forms, unless the context clearly indicates other meanings. It should also be understood that the term "and / or" used in one or more embodiments of this specification refers to and includes any or all possible combinations of one or more associated listed items.

[0026] It should be understood that although the terms first, second, etc. may be used to describe various information in one or more embodiments of this specification, this information should not be limited to these terms. These terms are only used to distinguish the same type of information from each other. For example, without departing from the scope of one or more embodiments of this specification, the first may also be referred to as the second, and similarly, the second may also be referred to as the first. Depending on the context, the word "if" as used herein may be interpreted as "at the time of" or "when" or "in response to determining".

[0027] In addition, it should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in one or more embodiments of this specification are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data must comply with the relevant laws, regulations and standards of the relevant countries and regions, and provide corresponding operation entrances for users to choose to authorize or refuse.

[0028] First, the terms involved in one or more embodiments of this specification are explained.

[0029] SKU: SKU (Stock Keeping Unit) is a stock keeping unit, also known as a stock control unit. It is a unique code used to identify and manage each unique product in the inventory.

[0030] In this specification, a distribution capacity scheduling method is provided. This specification also involves a distribution capacity scheduling device, a computing device, a computer-readable storage medium, and a computer program product, which are described in detail one by one in the following embodiments.

[0031] In the field of fresh food e-commerce logistics, goods usually have high requirements for storage conditions, but downstream distribution centers lack sufficient space and suitable storage conditions for long-term storage of goods. Therefore, in order to reduce losses and reverse logistics risks caused by excess inventory, it is particularly important to accurately allocate goods. However, the time for allocating goods is limited. In the case of a sudden increase in order volume, it will bring huge pressure to the production rhythm and distribution operations of the regional distribution center, which may lead to the inability to accurately complete the allocation of goods.

[0032] See also Figure 1 , Figure 1 A flow chart of a distribution capacity scheduling method provided according to an embodiment of the present specification is shown, which specifically includes the following steps.

[0033] Step 102: Obtain historical distribution data in the area to be dispatched, determine the total estimated demand for goods and the estimated demand for best-selling products within a preset time period based on the historical distribution data, and determine the first transportation capacity required for the best-selling products based on the estimated demand for the best-selling products.

[0034] Specifically, the area to be dispatched refers to the area that needs to be dispatched in advance. The area to be dispatched generally contains multiple distribution points, which can also be called downstream distribution centers. Generally, after the mall cuts off the order, the regional distribution center allocates goods to each downstream distribution center according to the demand for different goods. Historical delivery data refers to the relevant data of orders that have been delivered before the current moment. The preset time period is a period of time after the current time point, which is the time period that needs to be dispatched in advance. The total estimated demand for goods refers to the total amount of all goods that may generate purchase demand and need to be delivered in the area to be dispatched within the preset time period. Best-selling products refer to goods that are loved by consumers, that is, goods with a large demand from consumers. The estimated demand for best-selling products refers to the estimated total demand for a certain type of particularly popular goods in the area to be dispatched within the preset time period. The first transportation demand refers to the number of transportation vehicles or delivery personnel estimated to be required for the delivery of best-selling products. In the embodiment of this specification, in order to reduce the delivery cost, a vehicle can be used to run again within a limited time to complete the delivery. Therefore, the first transportation demand can also be understood as the number of times a vehicle needs to run again within a limited time to deliver best-selling products.

[0035] Based on this, in order to improve the accuracy of commodity allocation, it is necessary to predict the demand for the first transport capacity first. Therefore, it is necessary to obtain historical distribution data and conduct in-depth mining and analysis based on the historical distribution data to discover the rules and trends. Through a comprehensive analysis of these historical data, it is possible to more accurately predict the total estimated demand for commodities and the estimated demand for best-selling products in the area to be dispatched within the preset time period, and then determine the demand for the first transport capacity based on the estimated demand for best-selling products.

[0036] In one embodiment of the present specification, the distribution capacity scheduling method can be applied to a distribution capacity scheduling platform. When a user needs to generate a capacity scheduling plan, he or she can initiate a capacity scheduling plan generation request through the distribution capacity scheduling platform and input the area to be scheduled and the preset time period. The distribution capacity scheduling platform generates a capacity scheduling plan based on the information input by the user and provides feedback to the user.

[0037] In another embodiment of the present specification, the user can configure the distribution capacity scheduling platform in advance according to the needs, so that the distribution capacity scheduling platform can automatically generate a capacity scheduling plan. The user can initiate a configuration request for automatically generating a capacity scheduling plan, and configure information such as the area to be scheduled and the preset time period, so that the capacity scheduling platform can generate a capacity scheduling plan according to the automatic generation cycle, without the user repeatedly initiating a capacity scheduling plan generation request. The automatic generation cycle, for example, is one day or one week.

[0038] Furthermore, in order to more accurately predict the total estimated demand for goods, the total estimated demand for goods within a preset time period based on the historical delivery data includes: filtering out transaction historical orders within the historical time period corresponding to the preset time period from the historical delivery data, wherein the transaction historical orders refer to orders that are actually received and completed within the historical time period; and determining the total estimated demand for goods within the preset time period based on the historical demand for goods in the transaction historical orders.

[0039] Specifically, the historical time period is the time period before the current time point and corresponding to the preset time period, wherein the historical time period and the preset time period are in different calculation cycles, and different calculation cycles have the same or similar commodity demand rules. For example, the current time point is September 10, XXXX (Tuesday), the preset time period can be September 13, XXXX (Friday), and the historical time period is September 6, XXXX (Friday) or August 30, XXXX (Friday), wherein the calculation cycle is one week. The transaction history order refers to the order-related data that is actually received and completed in the historical time period.

[0040] Based on this, historical orders completed within the historical time period are screened out from the historical delivery order data, and consumers' demand for different types of goods is determined from the historical orders completed, which is used as the historical demand for goods within the historical time period. The total estimated demand for goods within the preset time period is determined based on the historical demand for goods.

[0041] In another embodiment of the present specification, in order to further improve the accuracy of the estimated total demand for goods, historical transaction orders corresponding to at least two historical time periods can be obtained, at least two historical demands for goods corresponding to at least two historical time periods can be calculated, and the average of the at least two historical demands for goods can be taken to calculate the total estimated demand for goods within the preset time period.

[0042] In another embodiment of the present specification, transaction history orders corresponding to at least two historical time periods may be input into a pre-trained prediction model, and the prediction model may be used to output an estimated demand for the product within a preset time period.

[0043] For example, the obtained area to be scheduled is shown in Table 1.

[0044] Table 1

[0045] Taking branch line 1 as an example, branch line 1 is taken as the area to be dispatched, and the total estimated demand for goods predicted based on the historical orders completed in branch line 1 is shown in Table 2.

[0046] Table 2

[0047] The estimated order quantity refers to the estimated demand for each type of product. The total estimated demand for the product is obtained by adding up all the estimated order quantities.

[0048] To sum up, the embodiment of this specification selects historical completed orders from historical delivery data, and predicts the total estimated demand for goods based on the demand for goods in the historical completed orders, thereby effectively improving the accuracy of the prediction of the total estimated demand for goods and providing reliable data support for the subsequent generation of transportation scheduling plans.

[0049] Furthermore, since best-selling products have a large demand base, in order to accurately dispatch delivery vehicles, it is necessary to first predict the demand for best-selling products, and the area to be dispatched includes at least two delivery points; the method of determining the estimated demand for best-selling products within a preset time period based on the historical orders includes: determining the vehicle model information of the area to be dispatched; determining the historical demand for at least two types of goods corresponding to each of the delivery points based on the transaction history orders, and predicting the estimated demand for at least two types of goods corresponding to the delivery points based on the historical demand for at least two types of goods; sorting the estimated demand for at least two types of goods in each point; determining the estimated demand for best-selling products corresponding to each delivery point based on the sorting result and the first preset rule; and obtaining the estimated demand for best-selling products by combining the estimated demand for best-selling products at each of the delivery points.

[0050] Specifically, the vehicle model information includes the type of vehicle, effective loading volume, fuel consumption and other information. The vehicle model information can be configured in advance by the user for each area to be scheduled based on experience. Distribution points can be understood as different downstream distribution centers. The first preset rule can be understood as the standard for selecting popular products from a large number of products. The first preset rule can be set by the staff of the regional distribution center based on historical experience. For example, the first preset rule is based on the sorting of the demand for goods in a distribution point, and the first preset number of goods in the sorting are regarded as best-sellers, or the goods with an estimated demand quantity greater than or equal to the preset demand quantity are regarded as best-sellers. The estimated demand for point-based best-sellers refers to the estimated demand for best-sellers corresponding to any distribution point. The number of best-sellers corresponding to each distribution point can be one or more, and then the estimated demand for point-based best-sellers corresponding to each distribution point can be one or more.

[0051] Based on this, when calculating the estimated demand for best-selling products, it is necessary to first predict the demand for each type of product. Since the area to be scheduled contains multiple delivery points, predicting the overall estimated demand for best-selling products in the area to be scheduled requires analyzing the estimated demand for products in each delivery point. Therefore, it is necessary to determine the historical demand for at least two types of products corresponding to each delivery point based on historical orders, and predict the estimated demand for products of the corresponding type within a preset time period based on the historical demand for products, that is, each type of product corresponds to an estimated demand for product, thereby obtaining multiple estimated demands for products corresponding to multiple products in each delivery point. Next, sort the multiple estimated demands for products in each delivery point, and determine the best-selling products corresponding to each delivery point based on the sorting result and the first preset rule, thereby determining the estimated demand for the point-by-point best-selling products corresponding to the delivery point. Finally, add the corresponding estimated demands for the point-by-point best-selling products in each delivery point to obtain the estimated demand for best-selling products in the area to be scheduled within the preset time period.

[0052] Continuing with the above example, after determining the estimated demand for different types of goods at each location, the estimated demand for at least two types of goods at each location is calculated as shown in the estimated order quantity in Table 2. The first preset rule is to regard goods with a demand greater than or equal to 100 as best-sellers. According to the first preset rule, best-sellers are screened out from Table 2, that is, the estimated demand for best-sellers at the corresponding location is shown in Table 3.

[0053] Table 3

[0054] To summarize, the embodiments of this specification first sort the estimated demand for different types of goods at each point, determine the estimated demand for best-selling products at each distribution point in combination with the first preset rule, and finally obtain the estimated demand for best-selling products in the area to be scheduled by combining the estimated demand for best-selling products at each distribution point, thereby achieving accurate prediction of the demand for best-selling products and providing strong data support for the subsequent generation of transportation scheduling plans and logistics distribution.

[0055] Furthermore, since the demand base for best-selling products is large, in order to control the delivery cost and accurately deliver the best-selling products, it is necessary to first determine the first transportation capacity demand required for delivering the best-selling products, which can also be understood as pre-estimating the number of vehicles required for delivering the best-selling products. Therefore, the method of determining the first transportation capacity demand required for the best-selling products based on the estimated demand for the best-selling products includes: determining the demand scaling factor and vehicle type information of the area to be scheduled, wherein the demand scaling factor is used to indicate the accuracy of the estimated demand for the product relative to the actual demand; calculating the estimated volume of the best-selling products based on the scaling factor and the estimated demand for the best-selling products; and determining the first transportation capacity demand based on the estimated volume of the best-selling products and the vehicle type information.

[0056] Specifically, since there is often an error between the actual demand and the predicted demand for a product, in order to avoid the increase in distribution costs caused by the error as much as possible, the estimated demand for best-selling products can be corrected according to the demand scaling coefficient and the estimated demand for best-selling products to obtain the corrected estimated demand for best-selling products. The estimated volume of best-selling products is calculated based on the corrected estimated demand for best-selling products and the volume of a single best-selling product, and the vehicle model information includes the effective loading volume of the vehicle. Based on the estimated volume of the best-selling products and the effective loading volume of the vehicle in the vehicle model information, the first transportation capacity demand required to transport the best-selling products is calculated.

[0057] Continuing with the above example, the relevant data for calculating the first capacity demand is shown in Table 4.

[0058] Table 4

[0059] Since the estimated demand for best-selling products is obtained by combining the point distribution demand corresponding to multiple distribution points, the estimated demand for best-selling products at each point can also be queried based on the estimated demand for best-selling products. Then, the estimated demand for best-selling products at each point is corrected according to the demand scaling factor to obtain the corrected estimated demand for best-selling products at multiple points. Then, the estimated volume of best-selling products is calculated based on the volume of each single product of each best-selling product, which is 95.3m 3 , and the effective cargo volume of the preset model is 45m 3 ,Therefore, the number of vehicles required is 95.3 / 45=2.11, rounded down to get the first capacity demand = 2 vehicles.

[0060] In summary, the embodiment of this specification introduces a demand scaling factor to calculate the first transportation capacity demand required for transporting best-selling products, so that the calculation of the first transportation capacity demand is more accurate and in line with actual operating conditions, avoiding excessive allocation of the first transportation capacity demand and causing waste of resources.

[0061] Furthermore, in order to make the demand scaling coefficient more accurate, the determination of the demand scaling coefficient of the area to be scheduled includes: screening the historical transaction orders within the historical time period corresponding to the preset time period from the historical distribution data; determining the historical actual demand for the goods in the historical transaction orders, and the historical predicted demand for the goods corresponding to the historical time period, wherein the historical predicted demand for the goods is the prediction result of the demand for the goods within the historical time period in the past; and determining the demand scaling coefficient based on the historical actual demand for the goods and the historical predicted demand for the goods.

[0062] Specifically, the actual historical demand for a product refers to the actual demand for the product of the same category as the best-selling product before the current time point, and the predicted historical demand for a product refers to the estimated demand for the product of the same category as the best-selling product before the current time point.

[0063] Based on this, in order to more accurately estimate the error between the estimated demand and the actual demand for best-selling products, it is necessary to first analyze the historical delivery data, determine the historical transaction orders and the historical estimated demand for the goods from the historical delivery data, determine the historical actual demand for the goods corresponding to the preset time period based on the historical transaction orders, and calculate the demand scaling factor based on the ratio of the historical predicted demand for the goods to the historical actual demand for the goods.

[0064] In one embodiment of the present specification, in order to further improve the accuracy of the demand scaling factor, the actual historical demand for the product and the estimated historical demand for the product corresponding to at least two historical time periods can be obtained, and at least two historical time periods are in different calculation cycles. The difference between the actual historical demand for the product and the estimated historical demand for the product in each historical time period is calculated, and the ratio of the actual historical demand for the product and the estimated historical demand for the product with the largest difference is used as the demand scaling factor.

[0065] For example, the preset time period is September 13, XXXX (Friday), and the historical time periods corresponding to the preset time period are the first historical time period September 6, XXXX (Friday) and the second historical time period August 30, XXXX (Friday). It is determined from the historical distribution data that the actual historical demand for the product corresponding to September 6, XXXX (Friday) is 100, and the historical estimated demand for the product is 80, with a difference of 20. The actual historical demand for the product corresponding to August 30, XXXX (Friday) is 100, and the historical estimated demand for the product is 70, with a difference of 30. Therefore, the ratio of 0.7 corresponding to the actual historical demand for the product and the historical estimated demand for the product corresponding to the second historical time period is used as the demand scaling factor.

[0066] To sum up, the embodiments of this specification analyze historical delivery data and calculate the demand scaling factor based on the actual historical demand for goods and the estimated historical demand for goods in the historical delivery data. This can make the calculated demand scaling factor more accurate, and thus make the calculated first transportation capacity demand for best-selling products more in line with reality.

[0067] Step 104: When the first transportation capacity demand exceeds the first transportation capacity threshold, determine the second transportation capacity demand required for the non-best-selling product based on the total estimated demand for the product and the first transportation capacity demand required for the best-selling product.

[0068] Specifically, the first capacity threshold refers to one of the criteria for determining whether the first capacity demand needs to be updated, and is used to measure whether the first capacity demand is sufficient.

[0069] If the first transportation capacity demand is relatively large, it may be necessary to allocate vehicles that deliver best-selling products to deliver non-best-selling products. In other words, the value of the first transportation capacity demand may need to be updated. In order to determine whether the first transportation capacity demand needs to be updated, it is necessary to compare the first transportation capacity demand with the first transportation capacity threshold. If the comparison result is that the first transportation capacity demand exceeds the first transportation capacity threshold, it means that the first transportation capacity may need to be updated. If the comparison result is that the first transportation capacity demand does not exceed the first transportation capacity threshold, it means that the number of vehicles transporting best-selling products is too small and cannot be allocated to transport non-best-selling products. In other words, the first transportation capacity demand does not need to be updated in this case.

[0070] Based on this, when the first transportation capacity demand exceeds the first transportation capacity threshold, it only means that the first transportation capacity demand may need to be updated, and it is necessary to further determine whether it needs to be updated through the second transportation capacity demand. Therefore, it is necessary to calculate the second transportation capacity demand required for the delivery of non-best-selling products based on the total estimated demand for the goods and the first transportation capacity demand.

[0071] Using the above example, the first transportation capacity requirement is calculated to be 2 based on the estimated demand for the best-selling product, and the first transportation capacity threshold is 1. At this time, the first transportation capacity requirement exceeds the first transportation capacity threshold, so the second transportation capacity requirement can be calculated.

[0072] Furthermore, in order to ensure that the capacity scheduling plan can be successfully generated without updating the first capacity demand, when the first capacity demand does not exceed the first capacity threshold, the capacity scheduling plan for the area to be scheduled within the preset time period is generated based on the first capacity demand, the estimated demand for the best-selling products and the point information in the area to be scheduled.

[0073] For example, assuming that the calculation result of the first transportation capacity demand is 1 and the first transportation capacity threshold is 2, then the judgment result is that the first transportation capacity demand is less than the first transportation capacity threshold. At this time, only one vehicle is needed to deliver the best-selling product. Therefore, there is no need to transfer vehicles from the first transportation capacity demand, that is, there is no need to update the first transportation capacity demand. The transportation scheduling plan can be directly generated based on the first transportation capacity demand, the estimated demand for best-selling products and the point information.

[0074] In another embodiment of the present specification, when the first transportation capacity demand is less than the first transportation capacity threshold, it means that few vehicles are needed to deliver the best-selling products, and a transportation capacity scheduling plan can be directly generated based on the orders received in real time.

[0075] To summarize, in the embodiment of the present specification, when it is determined that the first capacity demand is less than the first capacity threshold, a capacity scheduling plan can be directly generated based on the first capacity demand, the estimated demand for best-selling products and the location information, without the need for subsequent capacity demand judgments, thereby reducing additional data processing and being able to quickly respond to market changes.

[0076] Furthermore, in order to determine whether it is necessary to allocate special vehicles for delivery of non-best-selling products in advance, the number of delivery vehicles required for the non-best-selling products is needed first, and the second transportation capacity requirement required for the non-best-selling products is determined based on the total estimated demand for the products and the first transportation capacity requirement required for the best-selling products, including: determining the vehicle model information of the area to be dispatched, determining the total transportation capacity requirement based on the total estimated demand for the products and the vehicle model information; and calculating the second transportation capacity requirement required for the non-best-selling products based on the total transportation capacity requirement and the first transportation capacity requirement.

[0077] Specifically, the total transportation capacity demand refers to the number of vehicles required to deliver all goods.

[0078] Based on this, the total transportation capacity demand is determined according to the estimated total demand for goods and the vehicle's effective cargo volume in the vehicle model information, and the difference between the total transportation capacity demand and the first transportation capacity demand is used as the second transportation capacity demand.

[0079] Continuing with the above example, the estimated demand for each commodity has been calculated in Table 2, and the volume of each commodity needs to be determined, as shown in Table 5.

[0080] Table 5

[0081] According to the volume of a single commodity and the estimated demand for commodities, the total estimated volume of commodities can be calculated as 177.69. According to the ratio of the total estimated volume of commodities and the effective cargo volume of the vehicle of 45, the second transportation capacity demand can be calculated as 1.95 vehicles.

[0082] In summary, the embodiments of this specification can achieve reasonable allocation and efficient use of vehicle resources by pre-calculating the second transportation capacity requirement required for non-best-selling products, and provide data support for subsequent judgment on whether the first transportation capacity requirement needs to be further updated.

[0083] Step 106: When the second capacity demand does not exceed the second capacity threshold, the first capacity demand is updated, and a capacity scheduling plan for the area to be scheduled within the preset time period is generated based on the updated first capacity demand, the estimated demand for the best-selling product, and the point information in the area to be scheduled.

[0084] Specifically, the second capacity threshold refers to another criterion for determining whether the first capacity demand needs to be updated, and is used to measure whether the second capacity demand is sufficient. Point information refers to the relevant information of the distribution points contained in the area to be dispatched, including the location information of the distribution points, the distance between any two distribution points, and the distance between any distribution point and the regional distribution center.

[0085] Based on this, since the base of non-best-selling products is generally small, in order to reduce the delivery cost, it is not necessary to allocate vehicles specifically for non-best-selling products. Instead, vehicles for delivering best-selling products can be allocated to deliver non-best-selling products. Therefore, it is necessary to determine whether the second transportation capacity demand for delivering non-best-selling products exceeds the second transportation capacity threshold. If it does not exceed, the first transportation capacity demand is updated, and then the transportation capacity dispatch plan for the area to be dispatched within the preset time period is generated based on the first transportation capacity demand, the estimated demand for best-selling products and the point information.

[0086] For example, the calculation result of the second transportation capacity requirement is 0.7, and the second transportation capacity threshold is 0.8. The second transportation capacity requirement does not exceed the second transportation capacity threshold, which means that if the non-best-selling products are delivered by one vehicle, there is still a large amount of remaining space in the vehicle, which will cause waste of resources and increase delivery costs. Therefore, a vehicle can be allocated from the delivery vehicles of best-selling products to deliver non-best-selling products, and the first transportation capacity requirement needs to be updated.

[0087] Furthermore, when the second transportation capacity demand is large enough, the transportation demand cannot be met only by allocating vehicles from the vehicles required for the distribution of best-selling products to transport non-best-selling products. Therefore, non-best-selling products need to be allocated special delivery vehicles for delivery. At this time, the quantity of the first transportation capacity does not need to be updated. Therefore, when the second transportation capacity demand exceeds the second transportation capacity threshold, a transportation capacity scheduling plan for the area to be scheduled within the preset time period is generated based on the first transportation capacity demand, the estimated demand for best-selling products and the point information in the area to be scheduled.

[0088] Continuing with the above example, the second capacity demand is 1.95, and the second capacity threshold is 0.8. The second capacity demand exceeds the second capacity threshold. Therefore, there is no need to update the first capacity demand. The capacity scheduling plan for the area to be scheduled within the preset time period can be directly generated based on the original first capacity demand, the estimated demand for best-selling products and the point information. In summary, the embodiments of this specification determine whether an update is required by judging the relationship between the second capacity demand and the second capacity threshold, thereby achieving a more accurate prediction of the first capacity demand, and further making the capacity scheduling plan ultimately generated based on the first capacity demand more accurate.

[0089] Furthermore, if vehicles are transferred from vehicles transporting best-selling products to transport best-selling products, then in order to ensure that the vehicles can be transferred smoothly, it is also necessary to determine whether the quantity of the first transportation capacity demand is sufficient. Therefore, before updating the first transportation capacity demand, it also includes: determining whether the first transportation capacity demand is greater than or equal to the third transportation capacity threshold; if so, executing the step of updating the first transportation capacity demand; if not, generating a transportation capacity scheduling plan for the area to be scheduled within the preset time period based on the first transportation capacity demand, the estimated demand for the best-selling products and the point information in the area to be scheduled.

[0090] Specifically, the third capacity threshold refers to another criterion for determining whether the first capacity demand needs to be updated, and is used to measure whether the first capacity demand is allowed to be adjusted out.

[0091] Based on this, when it is judged that the first transportation capacity demand is greater than or equal to the third transportation capacity threshold, the step of updating the first transportation capacity demand is performed, and the updating of the first transportation capacity demand can be to reduce the first transportation capacity demand, and the specific amount of reduction can be set according to the actual situation. When it is judged that the first transportation capacity demand is less than the third transportation capacity threshold, the first transportation capacity demand is not updated, indicating that there are relatively few vehicles used to transport best-selling products and they cannot be dispatched. Therefore, the transportation capacity dispatch plan for the area to be dispatched within the preset time period is generated based on the original first transportation capacity demand, the estimated demand for best-selling products and the point information in the area to be dispatched.

[0092] For example, assuming that the calculated first capacity demand is 3 and the first capacity threshold is 1, then according to the judgment result, the first capacity demand exceeds the first capacity threshold, so it is necessary to continue to calculate the second capacity demand. Suppose that the calculated second capacity demand is 0.7 and the second capacity threshold is 0.8, then according to the judgment result, the second capacity demand does not exceed the second capacity threshold. Therefore, it is necessary to continue to judge whether the first capacity demand can be adjusted out. The third capacity threshold is 2. Then according to the judgment result, the first capacity threshold is greater than or equal to 2, which means that the first capacity demand can be adjusted out, that is, the first capacity demand needs to be updated. The specific method of updating is to lower the first capacity demand. The threshold for reduction is preset to 1. Therefore, the first capacity demand is lowered to 2, and the original first capacity demand 3 is updated with 2. The final updated first capacity demand is 2.

[0093] In summary, the embodiment of this specification updates the first capacity threshold when it is determined that the first capacity demand is greater than the third capacity threshold, thereby ensuring that the amount of capacity for transporting best-selling products is sufficient, thereby ensuring the accuracy of the capacity scheduling plan.

[0094] Further, according to the judgment results in the previous embodiments, when the first transportation capacity demand needs to be updated, it is necessary to generate a transportation capacity scheduling plan based on the updated first transportation capacity demand, and the goods delivery vehicles can deliver goods in an unmanned manner. Therefore, the driver's working hours can be ignored when generating the transportation capacity scheduling plan. The transportation capacity scheduling plan for the area to be scheduled within the preset time period is generated based on the updated first transportation capacity demand, the estimated demand for the best-selling products, and the point information in the area to be scheduled, including: determining at least two combined routes based on the updated first transportation capacity demand, the estimated demand for the best-selling products, and the point information, determining a target combined route from the at least two combined routes based on the point information, wherein the target combined route includes at least two branch routes; determining the delivery order of at least two branch routes based on the target combined route and the route delivery distance; and generating the transportation capacity scheduling plan based on the point information and the delivery order.

[0095] Specifically, in order to reduce the delivery cost, best-selling products are delivered by one vehicle. At this time, the first transportation demand represents the number of vehicles required to deliver the best-selling products. It can be understood that it takes several deliveries to deliver all the best-selling products by one vehicle, and the route of each delivery is different. Therefore, each delivery will correspond to a branch route, and each combined route contains at least two branch routes.

[0096] Based on this, after updating the first capacity demand, in order to ensure the efficiency and effect of capacity scheduling, it is necessary to further select the optimal distribution path. In this case, in order to ensure that the updated first demand can complete the distribution, it is also necessary to subtract the point with the least estimated demand for the best-selling product from all the distribution points. After that, the capacity scheduling plan is generated according to the remaining distribution points and the updated first capacity demand. First, based on the updated first capacity demand, the estimated demand for the best-selling product, and the point information in the area to be scheduled, a preset algorithm is used to generate a variety of possible combination routes. These combination routes are designed to maximize vehicle utilization, reduce empty driving rate, and minimize overall delivery time. Next, according to the point information, including the location information of each distribution point, the distance between any two distribution points, and the distance between any distribution point and the regional distribution center, the generated combination routes are screened to determine the optimal target combination route. The target combination route not only takes into account the transportation cost, but also takes into account the delivery timeliness and customer service quality. It may include multiple branch routes, each branch route serving a specific area or customer group.

[0097] After determining the target combined route, it is necessary to further plan the delivery sequence of each branch route. This is usually based on a comprehensive consideration of multiple factors such as route delivery distance, traffic conditions, and the urgency of customer needs. This can ensure that the delivery sequence is optimized while complying with traffic regulations and customer time windows, thereby reducing waiting time and driving distance and improving delivery efficiency.

[0098] Finally, based on the point information and the optimized delivery sequence, a detailed capacity dispatch plan will be generated. The plan specifies key information such as the delivery task, start time, driving route, stop point, and estimated arrival time of each vehicle. At the same time, the system will also make dynamic adjustments based on real-time road conditions and vehicle status to ensure the flexibility and response speed of capacity dispatch.

[0099] For example, based on the estimated demand for best-selling products, the single warehouse volume of each distribution point (downstream distribution center) in the area to be scheduled can be calculated. Assuming that the original range to be scheduled also includes the downstream distribution center D, since the first transportation capacity demand is reduced, the distribution points need to be reduced accordingly. Therefore, it is necessary to redetermine the effective distribution points based on the point information, and take the remaining downstream distribution center A, downstream distribution center B, and downstream distribution center C as effective distribution points, as shown in Table 6.

[0100] Table 6

[0101] Assume that the final updated result of the first transport demand is 2, which means that one vehicle needs to deliver all the best-selling products twice, and the vehicle's effective cargo volume is 45m 3According to the volume of a single warehouse and the effective cargo volume of the vehicle, the delivery volume of a vehicle can meet the volume of a single warehouse (that is, the demand) of a delivery point at one time, but it cannot meet the demand of two delivery points at the same time. Therefore, one of the delivery points needs to be delivered in two times.

[0102] This is a linear equality constraint problem that can be solved by a linear programming solver: 1. Define variables: A: Estimated demand for best-selling products (cubic meters).

[0103] B: Effective cargo volume of a single vehicle (cubic meters).

[0104] n: The number of delivery points.

[0105] di: The demand for the i-th distribution point.

[0106] M: The number of dispatched vehicles is known, M=A / B.

[0107] Xij: The load of the i-th delivery point in the j-th delivery (Xij≤B).

[0108] 2. Constraints: The demand for each distribution point must be fully met: .

[0109] The load volume of each delivery cannot exceed the effective cargo volume of a single vehicle: .

[0110] Load allocations must be non-negative: .

[0111] 3. Mathematical formula: The load allocation problem can be expressed as .

[0112] In the case of 2-car loading + few points, there are the following combination routes, as shown in Table 7.

[0113] Table 7

[0114] Among them, "district" represents the regional distribution center, "A" represents the downstream distribution center A, "B" represents the downstream distribution center B, and "C" represents the downstream distribution center C. Regional distribution center A, regional distribution center B or regional distribution center C is equivalent to multiple distribution points in the area to be dispatched. Full quantity refers to the full demand for best-selling products in the corresponding distribution point, and part refers to part of the demand for best-selling products in the distribution point. For example, (full quantity of A + part of B) + (part of B + full quantity of C) means that the first distribution can be loaded with the best-selling products of the downstream distribution center A and the best-selling products of the downstream distribution center B in one vehicle, and the second distribution can be loaded with the best-selling products of the downstream distribution center C and the best-selling products of the downstream distribution center B in one vehicle.

[0115] Next, you can define the following variables: i: The i-th branch line in the combined line.

[0116] P i : The number of delivery points on the i-th section of the combined route.

[0117] D i : The distance of the i-th branch line in the combined line.

[0118] Define an optimization function to select the optimal target combination route. This optimization function can calculate the average delivery distance between the delivery points in each combination route: K=min(∑D i / P i ), the goal of this optimization function is to find i / P i The smallest combined route, that is, the average distance between every two delivery points is the smallest. This can be explained as giving priority to the combination route when the number of points is small, and giving priority to the combination route with the smaller average distance between every two delivery points when the number of points is the same.

[0119] The content included in the point information is shown in Table 8.

[0120] Table 8

[0121] The average distance between every two delivery points is calculated according to the above optimization function as shown in Table 9.

[0122] Table 9

[0123] According to the calculation results, the combination route with sequence number 6 is taken as the target combination route, and the combination route with sequence number 6 contains two branch routes, "District AB" and "District AC". Therefore, it is necessary to further determine the delivery order of these two branch routes based on the route delivery distance, because the distance of "District AB" = (28+8) kilometers, and the distance of "District AC" = (28+100) kilometers; that is, the "District AC" branch route with a longer distance is delivered first, and then the "District AB" branch route with a shorter distance is delivered.

[0124] Finally, the capacity dispatch plan generated according to the point information and distribution sequence is: Capacity dispatch plan A, regional distribution center - downstream distribution center A - downstream distribution center B - regional distribution center - downstream distribution center A - downstream distribution center C.

[0125] To summarize, the embodiment of this specification determines the change in the first transportation capacity demand, and generates a transportation scheduling plan based on the updated demand and point information, which includes key information such as detailed delivery routes, delivery sequences, and estimated completion times, and comprehensively considers multiple factors to make the final transportation scheduling plan more accurate. The multiple key information included makes it easy for users to understand the transportation scheduling plan and makes it easier to apply. By pre-generating a transportation scheduling plan, the plan can be directly applied for allocation within a preset time period, thereby improving allocation efficiency.

[0126] In another embodiment of the present specification, the combined route may not include branch routes. In this case, one vehicle can deliver all the best-selling products, that is, the final first transportation capacity demand is 1, and only one route is required. Therefore, the corresponding vehicle model information, best-selling product estimated demand and point information can be directly output as a transportation capacity scheduling plan.

[0127] Furthermore, in another embodiment of the present specification, a driver may be required to drive the vehicle to deliver the goods. In this case, the transport scheduling plan is generated based on the point information and the delivery sequence, including: determining the total delivery time based on the point information in at least two of the branch routes and the delivery sequence; determining the first target delivery personnel based on the total delivery time and the preset working hours of the delivery personnel; generating the transport scheduling plan based on the delivery sequence of at least two branch routes, the point information and the first target delivery personnel.

[0128] Specifically, the total delivery time refers to the total time required to deliver best-selling products in the area to be dispatched according to the target combination route. The preset working hours of the delivery personnel refer to the working hours of the delivery personnel in a working day. The first target delivery personnel refers to the driver who is finally determined to deliver goods in the area to be dispatched when the first transportation capacity demand is updated. The number of the first target delivery personnel can be one or more.

[0129] Based on this, according to the branch routes, point information and delivery sequence in the target combined route, the total delivery time of the target combined route can be calculated, and the first target delivery personnel for driving the vehicle can be determined based on the total delivery time and the preset working hours of the delivery personnel. Finally, the capacity scheduling plan is generated based on the delivery sequence, point information, the first target delivery personnel and other information.

[0130] Using the above example, the preset working hours of the delivery personnel are set to 8-12 hours a day, and the rest time can be set to 0.5 hours for every 4 hours. The vehicle speed included in the pre-configured vehicle model information corresponding to the dispatch area is 70 kilometers per hour. The total delivery time can be calculated as: the time it takes for the vehicle to reach each delivery point + the time it takes to load and unload the vehicle at each delivery point, for example: Zone AC (28+100) kilometers, 3 points (including regional distribution center), estimated one-way time = (28+100) / 70+3*1=4.83 hours. Since it exceeds 4 hours, rest time is required, so 4.83+0.5=5.33 hours.

[0131] Area AB (28+8) kilometers, 3 points (including regional distribution center), estimated one-way time = (28+8) / 70+3*1=3.52 hours.

[0132] The total one-way time of the two routes = 5.33 hours + 3.52 hours = 8.87 hours, which does not exceed the driver's maximum working time of 12 hours. Calculate whether a driver can complete the entire delivery process: For example, if we consider the return trip of the first route = 1.3 hours (area AC, as in the previous data, the return trip from downstream distribution center C to the regional distribution center is 90 kilometers, 90 / 70=1.3); The total one-way time of the two routes is 8.87 hours + 1.3 hours for the return trip of the first route + an extra 0.5 hour break (the return trip and the second trip take more than 4 hours) = 10.2 hours After considering the round trip, the time taken to reach the last downstream distribution center does not exceed the driver's maximum working time of 12 hours. This means that within the combined route, these two routes can be run again, which means that one driver can deliver. And if it exceeds 8 hours, no other work can be added.

[0133] It should be noted that if it is estimated that the driver’s workload will not be saturated (not exceeding 8 hours) after completing the delivery according to the target combined route, other branch routes can be manually arranged based on the driver’s familiarity and workload.

[0134] In summary, the embodiments of this specification make the capacity scheduling process more flexible by comprehensively considering the delivery efficiency and the driver's workload, and can meet the delivery tasks in any situation while keeping the workload of the delivery personnel reasonable.

[0135] Furthermore, when the first transportation capacity demand has not been updated, a transportation capacity scheduling plan can be directly generated based on the originally calculated first transportation capacity demand, and the transportation capacity scheduling plan for the area to be scheduled within the preset time period is generated based on the first transportation capacity demand, the estimated demand for the best-selling product and the point information in the area to be scheduled, including: determining at least two combination routes based on the first transportation capacity demand, the estimated demand for the best-selling product and the point information, and determining a target combination route from the at least two combination routes based on the point information, wherein the target combination route includes at least two branch routes; determining a delivery order of at least two branch routes based on the target combination route and the route delivery distance; and generating the transportation scheduling plan based on the point information and the delivery order.

[0136] Specifically, the first capacity demand has not been updated.

[0137] The embodiments of this specification realize the final generation of a transportation scheduling plan based on the unupdated first transportation demand and point information. The transportation scheduling plan includes key information such as detailed delivery routes, delivery sequences, and estimated completion times, and comprehensively considers multiple factors to make the final transportation scheduling plan more accurate. The multiple key information included makes it easy for users to understand the transportation scheduling plan and makes it easier to apply. By pre-generating a transportation scheduling plan, the plan can be directly applied to allocate transportation capacity and goods within a preset time period, thereby improving allocation efficiency.

[0138] Furthermore, the transport scheduling plan is generated based on the point information and the delivery sequence, including: determining the total delivery time based on the point information in at least two of the branch routes and the delivery sequence; determining the second target delivery personnel based on the total delivery time and the preset working hours of the delivery personnel; generating the transport scheduling plan based on the delivery sequence of at least two branch routes, the point information and the second target delivery personnel.

[0139] Specifically, the second target delivery personnel refers to the drivers who are finally determined to deliver goods in the area to be dispatched when the first transportation capacity demand is not updated. The number of the second target delivery personnel can be one or more.

[0140] It should be noted that when the first transportation demand is not updated, except for the updating method of the first transportation demand and the determination method of the distribution points, the subsequent process of generating a transportation scheduling plan is the same as the process of generating a transportation scheduling plan when the first transportation demand is updated. Please refer to the aforementioned embodiment and will not be repeated here.

[0141] In the embodiment of this specification, when the first transport demand is not updated, the transport dispatch plan can be directly generated based on the first transport demand, realizing efficient transport resource allocation for different situations and ensuring the stability and continuity of logistics operations. And by comprehensively considering the delivery efficiency and the driver's workload, the transport dispatch process is more flexible, which can meet the delivery tasks in any situation, while keeping the workload of the delivery personnel reasonable.

[0142] The following combination Figure 2-1 and Figure 2-2 Taking the application of the distribution capacity scheduling method provided in this specification in the fresh food distribution scenario as an example, the distribution capacity scheduling method is further explained. Figure 2-1 This is steps 202 to 220 of a processing flow chart of a distribution capacity scheduling method in a fresh food distribution scenario provided by an embodiment of this specification. Figure 2-2 It is steps 222 to 236 of a processing flow chart of a distribution capacity scheduling method in a fresh food distribution scenario provided by an embodiment of this specification, which specifically includes the following steps.

[0143] Step 202: Obtain historical delivery data in the area to be dispatched.

[0144] Step 204: Filter out the completed historical orders within the historical time period corresponding to the preset time period from the historical delivery data, wherein the completed historical orders refer to the orders actually received and completed within the historical time period.

[0145] Step 206: Determine the total estimated demand for the product within the preset time period based on the historical demand for the product in the historical completed orders.

[0146] Step 208: Determine the vehicle type information of the area to be dispatched.

[0147] Step 210: The area to be dispatched includes at least two delivery points. The historical demand for at least two types of goods corresponding to each delivery point is determined based on the historical transaction orders. Based on the historical demand for at least two types of goods, the estimated demand for at least two types of goods corresponding to the delivery point is predicted.

[0148] Step 212: sort the estimated demand quantities of at least two types of commodities in each distribution point, and determine the estimated demand quantity of the best-selling commodities corresponding to each distribution point according to the sorting result and the first preset rule.

[0149] Step 214: The estimated demand for the best-selling product at each of the distribution points is combined to obtain the estimated demand for the best-selling product.

[0150] Step 216: Determine the demand scaling factor and vehicle type information of the area to be scheduled, wherein the demand scaling factor is used to indicate the accuracy of the estimated demand for the product relative to the actual demand.

[0151] Step 218: Calculate the estimated volume of the best-selling product according to the scaling factor and the estimated demand for the best-selling product, and determine the first transportation capacity demand based on the estimated volume of the best-selling product and the vehicle type information.

[0152] Step 220: Determine whether the first capacity demand exceeds the first capacity threshold, if so, execute step 222, if not, execute step 234.

[0153] Step 222: Determine the vehicle type information of the area to be dispatched, determine the total transportation capacity demand based on the total estimated demand for the goods and the vehicle type information, and calculate the second transportation capacity demand required for the non-best-selling product based on the total transportation capacity demand and the first transportation capacity demand.

[0154] Step 224: Determine whether the second capacity demand exceeds the second capacity threshold, if so, execute step 226, if not, execute step 234.

[0155] Step 226: Determine whether the first capacity demand is greater than or equal to the third capacity threshold. If so, execute step 228; if not, execute step 238.

[0156] Step 228: Update the first transport capacity requirement.

[0157] Step 230: Determine at least two combined routes based on the updated first transportation capacity demand, the estimated demand for the best-selling product and the location information, and determine a target combined route from the at least two combined routes according to the location information, wherein the target combined route includes at least two branch routes.

[0158] Step 232: Determine the delivery order of at least two of the branch routes according to the target combined route and the route delivery distance, and generate the transportation capacity scheduling plan based on the point information and the delivery order.

[0159] Step 234: Determine at least two combined routes based on the first transport capacity demand, the estimated demand for the best-selling product and the location information, and determine a target combined route from the at least two combined routes according to the location information, wherein the target combined route includes at least two branch routes.

[0160] Step 236: Determine the delivery order of at least two of the branch routes according to the target combined route and the route delivery distance, and generate the transportation capacity scheduling plan based on the point information and the delivery order.

[0161] It should be noted that the judgment method for the first capacity demand in the embodiment of this specification is not limited to the judgment method listed in the above embodiment, and whether to retain the judgment process in step 226 can be determined according to actual needs. For example, when the first capacity threshold is greater than or equal to the third capacity threshold, after executing step 224, step 226 may not be executed, and step 228 and subsequent steps may be directly executed, wherein the first capacity threshold, the second capacity threshold and / or the third capacity threshold may be set or adjusted by the user according to actual needs.

[0162] The embodiments of this specification use historical distribution data to predict the total estimated demand quantity of goods and the estimated demand quantity of best-selling products, and pre-estimate the first number of transportation tools required to transport best-selling products and the second number of transportation tools required to transport non-best-selling products, and determine in advance whether it is necessary to allocate transportation tools in advance. When the first transportation capacity demand exceeds the first transportation capacity threshold, it means that more transportation tools are required to transport best-selling products and they need to be allocated in advance. However, considering that there are still non-best-selling products, the second transportation capacity demand required for non-best-selling products may affect the first transportation capacity demand required for best-selling products. Therefore, it is necessary to update the first transportation capacity demand when the second transportation capacity demand does not exceed the second transportation capacity threshold, so that the final first transportation capacity demand is more accurate. Since the demand base of best-selling products is larger, a transportation capacity scheduling plan for the area to be scheduled within a preset time period is generated according to the first transportation capacity demand, the estimated demand for best-selling products and the point information in the area to be scheduled, so that the transportation capacity scheduling plan is more accurate. It realizes the prediction of commodity demand in advance, the prediction of the required transportation capacity in advance, and the generation of transportation capacity scheduling plan, so that after receiving orders in the preset time period, they can be quickly delivered according to the pre-generated transportation capacity scheduling plan, to prevent too many orders received in real time, resulting in excessive allocation pressure, affecting the accuracy of allocation, and thus affecting the distribution efficiency. In addition, the final generated transportation capacity scheduling plan corresponds to the area to be dispatched and the preset time period, that is, the goods within a specific time and geographical range are concentrated for distribution, which can effectively reduce the distribution cost.

[0163] Corresponding to the above method embodiment, this specification also provides a distribution capacity scheduling device embodiment, Figure 3 FIG. 1 shows a schematic diagram of a distribution capacity scheduling device provided by an embodiment of the present specification. Figure 3 As shown, the device comprises: The first transport capacity calculation module 302 is configured to obtain historical delivery data in the area to be dispatched, determine the total estimated demand for goods and the estimated demand for best-selling products within a preset time period according to the historical delivery data, and determine the first transport capacity required for the best-selling products according to the estimated demand for the best-selling products; The second transport capacity calculation module 304 is configured to determine the second transport capacity requirement required for the non-best-selling product according to the total estimated demand for the product and the first transport capacity requirement required for the best-selling product when the first transport capacity requirement exceeds the first transport capacity threshold; The scheduling plan generation module 306 is configured to update the first capacity demand when the second capacity demand does not exceed the second capacity threshold, and generate a capacity scheduling plan for the area to be scheduled within the preset time period based on the updated first capacity demand, the estimated demand for the best-selling products and the point information in the area to be scheduled.

[0164] Optionally, the first capacity calculation module 302 includes: The commodity total demand calculation submodule is configured to filter out the transaction history orders within the historical time period corresponding to the preset time period from the historical delivery data, wherein the transaction history orders refer to the orders actually received and completed within the historical time period; The total estimated demand for the commodity within the preset time period is determined according to the historical demand for the commodity in the historical completed orders.

[0165] Optionally, the area to be scheduled includes at least two delivery points; the first transport capacity calculation module 302 includes: The best-selling product demand calculation submodule is configured to determine the vehicle model information of the area to be dispatched; Determine the historical demand for at least two types of goods corresponding to each of the delivery points according to the historical orders, and predict the estimated demand for at least two types of goods corresponding to the delivery points according to the historical demand for at least two types of goods; sorting the estimated demand for at least two types of goods at each location; Determine the estimated demand for the best-selling product at each delivery point according to the sorting result and the first preset rule; The estimated demand for the best-selling product at each of the distribution points is combined to obtain the estimated demand for the best-selling product.

[0166] Optionally, the first capacity calculation module 302 includes: A first calculation parameter acquisition submodule is configured to determine a demand scaling factor and vehicle type information of the to-be-scheduled area, wherein the demand scaling factor is used to indicate the accuracy of the estimated demand for the commodity relative to the actual demand; A volume calculation submodule, configured to calculate the estimated volume of the best-selling product according to the scaling factor and the estimated demand for the best-selling product; The first transportation capacity requirement calculation submodule is configured to determine the first transportation capacity requirement based on the estimated volume of the best-selling product and the vehicle model information.

[0167] Optionally, the first calculation parameter acquisition submodule includes: A historical data acquisition submodule is configured to filter the historical orders completed within the historical time period corresponding to the preset time period from the historical delivery data; The historical data screening submodule is configured to determine the actual historical demand for the commodity in the historical order and the historical forecast demand for the commodity corresponding to the historical time period, wherein the historical forecast demand for the commodity is the forecast result of the demand for the commodity in the historical time period in the past; The scaling factor calculation submodule is configured to determine the demand scaling factor according to the historical actual demand of the commodity and the historical predicted demand of the commodity.

[0168] Optionally, the second capacity calculation module 304 includes: A total transport capacity demand calculation submodule is configured to determine the vehicle type information of the to-be-dispatched area, and determine the total transport capacity demand according to the total estimated demand for the goods and the vehicle type information; The second transportation capacity requirement calculation submodule is configured to calculate the second transportation capacity requirement required for the non-best-selling product based on the total transportation capacity requirement and the first transportation capacity requirement.

[0169] Optionally, the distribution capacity scheduling device further includes: The first plan generation module is configured to generate a capacity scheduling plan for the area to be scheduled within the preset time period based on the first capacity demand, the estimated demand for the best-selling products and the point information in the area to be scheduled when the second capacity demand exceeds the second capacity threshold.

[0170] Optionally, the distribution capacity scheduling device further includes: A determination module is configured to determine whether the first transport capacity demand is greater than or equal to a third transport capacity threshold; If yes, then executing the step of updating the first transport capacity requirement; If not, a transportation capacity dispatch plan for the area to be dispatched within the preset time period is generated according to the first transportation capacity demand, the estimated demand for the best-selling product and the point information in the area to be dispatched.

[0171] Optionally, the distribution capacity scheduling device further includes: The first plan generation module is configured to generate a capacity scheduling plan for the area to be scheduled within the preset time period based on the first capacity demand, the estimated demand for the best-selling products and the point information in the area to be scheduled when the first capacity demand does not exceed the first capacity threshold.

[0172] Optionally, the scheduling plan generating module 306 includes: A first route determination submodule is configured to determine at least two combination routes based on the updated first transport capacity demand, the estimated demand for the best-selling product, and the location information, and determine a target combination route from the at least two combination routes according to the location information, wherein the target combination route includes at least two branch routes; A first order determination submodule is configured to determine the delivery order of at least two of the branch routes according to the target combined route and the route delivery distance; The dispatch plan generation submodule is configured to generate the transport dispatch plan based on the point information and the delivery sequence.

[0173] Optionally, the scheduling plan generation submodule includes: Determine the total delivery time according to the point information in at least two of the branch routes and the delivery sequence; Determine a first target delivery person according to the total delivery time and the delivery person's preset working hours; The transportation capacity scheduling plan is generated based on the delivery sequence of at least two branch routes, the point information and the first target delivery personnel.

[0174] Optionally, the first plan generating module includes: A second route determination submodule is configured to determine at least two combined routes based on the first transport capacity demand, the estimated demand for the best-selling product, and the location information, and determine a target combined route from the at least two combined routes according to the location information, wherein the target combined route includes at least two branch routes; A second time determination submodule is configured to determine the delivery order of at least two of the branch routes according to the target combined route and the route delivery distance; The first plan generation submodule is configured to generate the transportation capacity scheduling plan based on the point information and the distribution sequence.

[0175] Optionally, the first plan generation submodule includes: Determine the total delivery time according to the point information in at least two of the branch routes and the delivery sequence; Determine a second target delivery person according to the total delivery time and the delivery person's preset working hours; The transportation capacity scheduling plan is generated based on the delivery sequence of at least two branch routes, the point information and the second target delivery personnel.

[0176] The above is a schematic scheme of a distribution capacity scheduling device of this embodiment. It should be noted that the technical scheme of the distribution capacity scheduling device and the technical scheme of the distribution capacity scheduling method described above belong to the same concept, and the details not described in detail in the technical scheme of the distribution capacity scheduling device can be found in the description of the technical scheme of the distribution capacity scheduling method described above.

[0177] Figure 4 The block diagram of a computing device 400 according to one embodiment of the present specification is shown. The components of the computing device 400 include but are not limited to a memory 410 and a processor 420. The processor 420 is connected to the memory 410 via a bus 430, and the database 450 is used to store data.

[0178] The computing device 400 also includes an access device 440 that enables the computing device 400 to communicate via one or more networks 460. Examples of these networks include a public switched telephone network (PSTN), a local area network (LAN), a wide area network (WAN), a personal area network (PAN), or a combination of communication networks such as the Internet. The access device 540 may include one or more of any type of network interface (e.g., a network interface card (NIC)) that is wired or wireless, such as an IEEE 802.11 wireless local area network (WLAN) wireless interface, a world-wide interoperability for microwave access (Wi-MAX) interface, an Ethernet interface, a universal serial bus (USB) interface, a cellular network interface, a Bluetooth interface, and a near field communication (NFC).

[0179] In one embodiment of the present specification, the above components of the computing device 400 and Figure 4 Other components not shown in the figure may also be connected to each other, for example, via a bus. It should be understood that Figure 4 The computing device structure block diagram shown is only for the purpose of illustration, and is not intended to limit the scope of this specification. Those skilled in the art can add or replace other components as needed.

[0180] The computing device 400 may be any type of stationary or mobile computing device, including a mobile computer or mobile computing device (e.g., a tablet computer, a personal digital assistant, a laptop computer, a notebook computer, a netbook, etc.), a mobile phone (e.g., a smart phone), a wearable computing device (e.g., a smart watch, smart glasses, etc.), or other types of mobile devices, or a stationary computing device such as a desktop computer or a personal computer (PC). The computing device 400 may also be a mobile or stationary server.

[0181] The processor 420 is used to execute the following computer executable instructions, which, when executed by the processor, implement the steps of the above-mentioned distribution capacity scheduling method.

[0182] The above is a schematic scheme of a computing device of this embodiment. It should be noted that the technical scheme of the computing device and the technical scheme of the above-mentioned distribution capacity scheduling method belong to the same concept, and the details not described in detail in the technical scheme of the computing device can be referred to the description of the technical scheme of the above-mentioned distribution capacity scheduling method.

[0183] An embodiment of the present specification also provides a computer-readable storage medium storing computer-executable instructions, which, when executed by a processor, implement the steps of the above-mentioned distribution capacity scheduling method.

[0184] The above is a schematic scheme of a computer-readable storage medium of this embodiment. It should be noted that the technical scheme of the storage medium and the technical scheme of the above-mentioned distribution capacity scheduling method belong to the same concept, and the details not described in detail in the technical scheme of the storage medium can be referred to the description of the technical scheme of the above-mentioned distribution capacity scheduling method.

[0185] An embodiment of the present specification also provides a computer program, wherein when the computer program is executed in a computer, the computer is instructed to execute the steps of the above-mentioned distribution capacity scheduling method.

[0186] The above is a schematic scheme of a computer program of this embodiment. It should be noted that the technical scheme of the computer program and the technical scheme of the above-mentioned distribution capacity scheduling method belong to the same concept, and the details not described in detail in the technical scheme of the computer program can be referred to the description of the technical scheme of the above-mentioned distribution capacity scheduling method.

[0187] The above is a description of a specific embodiment of the specification. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recorded in the claims can be performed in an order different from that in the embodiments and still achieve the desired results. In addition, the processes depicted in the drawings do not necessarily require the specific order or continuous order shown to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0188] The computer instructions include computer program codes, which may be in source code form, object code form, executable files or some intermediate forms, etc. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, USB flash drive, mobile hard disk, magnetic disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electric carrier signal, telecommunication signal and software distribution medium, etc. It should be noted that the content contained in the computer-readable medium may be appropriately increased or decreased according to the requirements of patent practice. For example, in some regions, according to patent practice, computer-readable media do not include electric carrier signals and telecommunication signals.

[0189] It should be noted that, for the above-mentioned method embodiments, for the sake of simplicity of description, they are all expressed as a series of action combinations, but those skilled in the art should be aware that the embodiments of this specification are not limited by the order of the actions described, because according to the embodiments of this specification, some steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily required by the embodiments of this specification.

[0190] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0191] The preferred embodiments of this specification disclosed above are only used to help explain this specification. The optional embodiments do not describe all the details in detail, nor do they limit the invention to only the specific implementation methods described. Obviously, many modifications and changes can be made according to the content of the embodiments of this specification. This specification selects and specifically describes these embodiments in order to better explain the principles and practical applications of the embodiments of this specification, so that technicians in the relevant technical field can well understand and use this specification. This specification is only limited by the claims and their full scope and equivalents.

Claims

1. A method for dispatching distribution capacity, characterized in that: include: Acquire historical delivery data in the area to be dispatched, determine the total estimated demand for goods and the estimated demand for best-selling products within a preset time period according to the historical delivery data, and determine the first transportation capacity required for the best-selling products according to the estimated demand for the best-selling products; When the first transportation capacity demand exceeds the first transportation capacity threshold, determining the second transportation capacity demand required for the non-best-selling product according to the total estimated demand for the product and the first transportation capacity demand required for the best-selling product; When the second capacity demand does not exceed the second capacity threshold, the first capacity demand is updated, and a capacity scheduling plan for the area to be scheduled within the preset time period is generated based on the updated first capacity demand, the estimated demand for the best-selling products, and the point information in the area to be scheduled.

2. The method for dispatching distribution capacity according to claim 1, characterized in that: Determining the total estimated demand for goods within a preset time period according to the historical delivery data includes: Filtering out the completed historical orders within the historical time period corresponding to the preset time period from the historical delivery data, wherein the completed historical orders refer to the orders actually received and completed within the historical time period; The total estimated demand for the commodity within the preset time period is determined according to the historical demand for the commodity in the historical completed orders.

3. The method for dispatching distribution capacity according to claim 2, characterized in that: The area to be dispatched includes at least two delivery points; Determining the estimated demand for best-selling products within a preset time period based on the historical orders includes: Determine the vehicle type information of the area to be dispatched; Determine the historical demand for at least two types of goods corresponding to each of the delivery points according to the historical orders, and predict the estimated demand for at least two types of goods corresponding to the delivery points according to the historical demand for at least two types of goods; sorting the estimated demand for at least two types of commodities at each location; Determine the estimated demand for the best-selling product at each delivery point according to the sorting result and the first preset rule; The estimated demand for the best-selling product at each of the distribution points is combined to obtain the estimated demand for the best-selling product.

4. The method for dispatching distribution capacity according to claim 1, characterized in that: The determining the first transportation capacity demand required for the best-selling product according to the estimated demand for the best-selling product includes: Determining a demand scaling factor and vehicle type information of the area to be scheduled, wherein the demand scaling factor is used to indicate the accuracy of the estimated demand for the commodity relative to the actual demand; Calculate the estimated volume of the best-selling product according to the scaling factor and the estimated demand of the best-selling product; The first transportation capacity requirement is determined based on the estimated volume of the best-selling product and the vehicle model information.

5. The method for dispatching distribution capacity according to claim 4, characterized in that: The determining of the demand scaling factor of the area to be scheduled includes: Filtering the historical orders completed within the historical time period corresponding to the preset time period from the historical delivery data; Determine the actual historical demand for the commodity in the historical order and the predicted historical demand for the commodity corresponding to the historical time period, wherein the predicted historical demand for the commodity is a past prediction result of the demand for the commodity within the historical time period; The demand scaling factor is determined according to the historical actual demand for the commodity and the historical predicted demand for the commodity.

6. The method for dispatching distribution capacity according to claim 1, characterized in that: The determining the second transportation capacity requirement required for the non-best-selling product according to the total estimated demand for the product and the first transportation capacity requirement required for the best-selling product includes: Determine the vehicle type information of the area to be dispatched, and determine the total transportation capacity demand according to the total estimated demand for the goods and the vehicle type information; The second transportation capacity requirement required for the non-best-selling product is calculated based on the total transportation capacity requirement and the first transportation capacity requirement.

7. The method for dispatching distribution capacity according to claim 1, characterized in that: The method further comprises: When the second transportation capacity demand exceeds the second transportation capacity threshold, a transportation capacity scheduling plan for the area to be scheduled within the preset time period is generated based on the first transportation capacity demand, the estimated demand for the best-selling product and the point information in the area to be scheduled.

8. The method for dispatching distribution capacity according to claim 7, characterized in that: Before updating the first transport capacity requirement, the method further includes: Determining whether the first transport capacity demand is greater than or equal to a third transport capacity threshold; If yes, then executing the step of updating the first transport capacity requirement; If not, a transportation capacity dispatch plan for the area to be dispatched within the preset time period is generated according to the first transportation capacity demand, the estimated demand for the best-selling product and the point information in the area to be dispatched.

9. The method for dispatching distribution capacity according to claim 1, characterized in that: The method also includes: when the first transportation capacity demand does not exceed the first transportation capacity threshold, generating a transportation capacity scheduling plan for the area to be scheduled within the preset time period based on the first transportation capacity demand, the estimated demand for the best-selling product and the point information in the area to be scheduled.

10. The method for dispatching distribution capacity according to claim 1, characterized in that: The generating a transportation capacity dispatching plan for the area to be dispatched within the preset time period according to the updated first transportation capacity demand, the estimated demand for the best-selling product, and the point information in the area to be dispatched includes: Determine at least two combined routes based on the updated first transport capacity demand, the estimated demand for the best-selling product, and the location information, and determine a target combined route from the at least two combined routes according to the location information, wherein the target combined route includes at least two branch routes; Determine the delivery order of at least two branch routes according to the target combined route and the route delivery distance; The transportation capacity scheduling plan is generated based on the point information and the delivery sequence.

11. The method for dispatching distribution capacity according to claim 10, characterized in that: The generating the transport capacity scheduling plan based on the point information and the delivery sequence includes: Determine the total delivery time according to the point information in at least two of the branch routes and the delivery sequence; Determine a first target delivery person according to the total delivery time and the delivery person's preset working hours; The transportation capacity scheduling plan is generated based on the delivery sequence of at least two branch routes, the point information and the first target delivery personnel.

12. The method for dispatching distribution capacity according to any one of claims 7 to 9, characterized in that: The generating a transportation capacity dispatching plan for the area to be dispatched within the preset time period according to the first transportation capacity demand, the estimated demand for the best-selling product, and the point information in the area to be dispatched includes: Determine at least two combined routes based on the first transport capacity demand, the estimated demand for the best-selling product, and the location information, and determine a target combined route from the at least two combined routes according to the location information, wherein the target combined route includes at least two branch routes; Determine the delivery order of at least two branch routes according to the target combined route and the route delivery distance; The transportation capacity scheduling plan is generated based on the point information and the delivery sequence.

13. The method for dispatching distribution capacity according to claim 12, characterized in that: Generating the transport capacity scheduling plan based on the point information and the delivery sequence includes: Determine the total delivery time according to the point information in at least two of the branch routes and the delivery sequence; Determine a second target delivery person according to the total delivery time and the delivery person's preset working hours; The transportation capacity scheduling plan is generated based on the delivery sequence of at least two branch routes, the point information and the second target delivery personnel.

14. A distribution capacity dispatching device, characterized in that: include: A first transport capacity calculation module is configured to obtain historical delivery data in the area to be dispatched, determine the total estimated demand for goods and the estimated demand for best-selling products within a preset time period according to the historical delivery data, and determine the first transport capacity required for the best-selling products according to the estimated demand for the best-selling products; A second transportation capacity calculation module is configured to determine a second transportation capacity requirement required for a non-best-selling product based on the total estimated demand for the product and the first transportation capacity requirement required for the best-selling product when the first transportation capacity requirement exceeds a first transportation capacity threshold; The scheduling plan generation module is configured to update the first capacity demand when the second capacity demand does not exceed the second capacity threshold, and generate a capacity scheduling plan for the area to be scheduled within the preset time period based on the updated first capacity demand, the estimated demand for the best-selling products and the point information in the area to be scheduled.

15. A computing device, characterized in that: include: Memory and processor; The memory is used to store computer-executable instructions, and the processor is used to execute the computer-executable instructions. When the computer-executable instructions are executed by the processor, the steps of the distribution capacity scheduling method described in any one of claims 1 to 13 are implemented.

16. A computer-readable storage medium, characterized in that: It stores computer executable instructions, which, when executed by a processor, can implement the steps of the distribution capacity scheduling method described in any one of claims 1 to 13.

17. A computer program product, characterized in that When the computer program is executed in a computer, the computer is caused to execute the steps of the distribution capacity scheduling method described in any one of claims 1 to 13.

Images