Order splitting processing method and device, computer equipment and storage medium

By converting the inventory data of the e-commerce snack industry into decimal and calculating the optimal delivery warehouse combination, the problem of inefficiency in inventory and logistics cost management caused by simple order splitting and warehouse selection is solved, and more efficient delivery and Cost management.

CN119026753AActive Publication Date: 2024-11-26HANGZHOU JIKE CLOUD NETWORK TECH CO LTD +1

Patent Information

Application Number
CN202411493173.1
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-10-24
Publication Date
2024-11-26
Estimated Expiration
2044-10-24

AI Technical Summary

Technical Problem

In the e-commerce snack industry, order splitting and warehouse selection are too simple, resulting in inefficiency in inventory management and inaccurate calculation of logistics costs, affecting delivery efficiency and cost balance.

Method used

By obtaining inventory data, convert the inventory situation of each warehouse into decimal storage, calculate the optimal delivery warehouse combination, check and process the situation of the same goods in multiple warehouses, and finally select the lowest cost delivery combination through cost calculation, and update the inventory and Show delivery status.

Benefits of technology

It improves shipping efficiency, optimizes inventory management and logistics costs, reduces freight costs, and achieves more reasonable inventory and logistics costs.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119026753A_ABST
    Figure CN119026753A_ABST
Patent Text Reader

Abstract

The embodiment of the invention discloses an order splitting processing method and device, computer equipment and a storage medium. The method comprises the steps of obtaining stock data of goods, and recording whether the goods in an order are completely delivered; converting the inventory condition of each warehouse in the order into a decimal system, and storing the decimal system as a key value pair to obtain a storage result; performing delivery warehouse number optimal solution calculation according to the storage result to obtain a warehouse combination of the optimal solution; checking whether the warehouse combination of the optimal solution has the condition that multiple warehouses share the same goods or not through bit operation; if so, constructing a combination set; performing data translation and cost calculation on the multi-warehouse goods combination, and determining the delivery combination with the lowest cost; and updating the inventory, and displaying the delivery condition and the order number of each warehouse. By implementing the method provided by the embodiment of the invention, the problems of low delivery efficiency and unreasonable freight cost caused by incapability of effectively optimizing inventory and reducing logistics cost due to too simple order splitting and warehouse selection in the prior art can be solved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to an order splitting method, and more specifically to an order splitting processing method, device, computer equipment and storage medium. Background Art

[0002] In the e-commerce snack industry, orders usually contain multiple items, and warehouses often run out of stock of certain items. This leads to the following problem: it is necessary to determine which warehouses can provide all the out-of-stock items, and to decide which warehouse to ship from through manual communication to ensure the most reasonable logistics costs. This manual processing method is inefficient and affects the timeliness of delivery.

[0003] At present, when dealing with this problem, e-commerce warehouses generally take measures to find a warehouse that can fully meet the order requirements, and give priority to the warehouse closest to the shipping address for delivery. If some goods cannot be found in the warehouse, they are replenished from the next closest warehouse. The goal of this approach is to complete orders in the form of multiple packages, but the efficiency and logistics costs are not satisfactory. In order to improve delivery efficiency and reduce logistics costs, an efficient system can be established to automatically split orders and select the best warehouse combination to meet order requirements, thereby optimizing inventory management and logistics costs. At present, although offline warehouses will try their best to replenish goods, the system still performs simple order splitting. This approach fails to effectively manage inventory and accurately calculate logistics rates, resulting in unreasonable freight costs, which affects the balance between processing efficiency and costs.

[0004] Therefore, it is necessary to design a new method to solve the problem that the existing technology is too simple in order splitting and warehouse selection, fails to effectively optimize inventory and reduce logistics costs, and thus leads to inefficient delivery and unreasonable freight costs. Summary of the invention

[0005] The purpose of the present invention is to overcome the defects of the prior art and provide an order splitting processing method, device, computer equipment and storage medium.

[0006] To achieve the above object, the present invention adopts the following technical solution: an order splitting processing method, comprising: Obtain inventory data for goods and record whether the goods in the order have been fully shipped; Convert the inventory status of each warehouse in the order into decimal and store it as a key-value pair to obtain the storage result; Calculate the optimal solution of the number of shipping warehouses according to the storage results to obtain an optimal warehouse combination; Use bitwise operations to check whether the optimal warehouse combination has multiple warehouses with the same goods; When the optimal warehouse combination contains multiple warehouses with the same goods, a combination set is constructed; Performing data translation and cost calculation on the combination set, and determining the lowest cost shipping combination to obtain a final shipping combination; Update the inventory based on the final delivery combination and display the delivery status and order count for each warehouse.

[0007] A further technical solution is: obtaining the inventory data of the goods and recording whether the goods in the order are fully shipped includes: Select the assigned warehouse and obtain the inventory data of each item in the order in each warehouse; Obtain the logistics rate template and store it; Record the item number in the order and convert the item number to a binary decimal integer.

[0008] A further technical solution is: the inventory status of each warehouse in the order is converted into decimal and stored as a key-value pair to obtain a storage result, including: Compare the quantity of the goods in the order with the inventory of the warehouse involved in the allocation to check whether the allocated warehouse is out of stock; When the assigned warehouse is not out of stock, the inventory status is recorded using binary calculation method and converted to decimal storage to obtain a decimal result; The storage warehouse ID and the decimal result are a key-value pair to obtain the storage result.

[0009] A further technical solution is: performing optimal calculation of the number of shipping warehouses according to the storage result to obtain an optimal warehouse combination, including: Sorting the decimal results in the stored results in descending order to obtain a sorted result; Use recursive calculation and XOR operation to find the minimum number of warehouses that meet the conditions of the sorting result to obtain the screening result; The screening results are narrowed down to obtain an optimal warehouse combination.

[0010] A further technical solution is as follows: the step of checking whether the optimal warehouse combination has multiple warehouses with the same product by bit operation includes: Perform a bitwise OR operation on each warehouse combination in the optimal warehouse combination to check whether the warehouse combination can meet all the product requirements of the order; For the warehouse combination that can meet all the product requirements of the order, determine whether there are multiple warehouses with the same product.

[0011] A further technical solution is as follows: the construction of the combination set includes: For warehouse combinations that have multiple warehouses with the same product and can meet all product requirements of the order, a storage result of the multiple warehouses with the same product combination is constructed to obtain a construction result; By bitwise operation, a warehouse combination satisfying the requirement that all goods are in stock is found in the construction result to obtain a combination set.

[0012] A further technical solution is: the data translation and cost calculation of the combination set are performed, and the lowest cost delivery combination is determined to obtain the final delivery combination, including: Translating the data of the combined set to determine the specific goods in each warehouse; Calculate the weight, volume and delivery address information of the order based on the specific goods in each warehouse; The total cost of each intermediate warehouse combination is calculated according to the logistics rate template, and the delivery combination with the lowest cost is selected to obtain the final delivery combination.

[0013] The present invention also provides an order splitting processing device, comprising: The inventory data acquisition unit is used to acquire the inventory data of the goods and record whether the goods in the order have been fully shipped; The conversion storage unit is used to convert the inventory status of each warehouse in the order into decimal and store it as a key-value pair to obtain a storage result; A calculation unit, used to perform optimal solution calculation of the number of shipping warehouses according to the stored results to obtain an optimal warehouse combination; The checking unit is used to check whether the optimal warehouse combination contains the same product in multiple warehouses through bit operations; The construction unit is used to construct a combination set when there are multiple warehouses with the same goods in the optimal warehouse combination; A combination determination unit, used for performing data translation and cost calculation on the combination set, and determining a delivery combination with the lowest cost to obtain a final delivery combination; The updating unit is used to update the inventory according to the final delivery combination and display the delivery status and order quantity of each warehouse.

[0014] The present invention further provides a computer device, which includes a memory and a processor. The memory stores a computer program, and the processor implements the above method when executing the computer program.

[0015] The present invention also provides a storage medium, wherein the storage medium stores a computer program, and the computer program implements the above method when executed by a processor.

[0016] Compared with the prior art, the present invention has the following beneficial effects: the present invention obtains inventory data and converts the inventory status of each warehouse into decimal for storage. Then, the optimal shipping warehouse combination is calculated, the situation of the same goods in multiple warehouses is checked and processed, and finally, the shipping combination with the lowest cost is selected through cost calculation, and the inventory is updated and the shipping status is displayed; the problem that the prior art is too simple in order splitting and warehouse selection, fails to effectively optimize inventory and reduce logistics costs, and thus leads to low shipping efficiency and unreasonable freight costs is solved.

[0017] The present invention is further described below in conjunction with the accompanying drawings and specific embodiments. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other accompanying drawings can be obtained based on these accompanying drawings without paying any creative work.

[0019] Figure 1 A schematic diagram of an application scenario of the order splitting processing method provided by an embodiment of the present invention; Figure 2 A schematic diagram of a flow chart of an order splitting processing method provided by an embodiment of the present invention; Figure 3 A schematic diagram of a sub-process of an order splitting processing method provided in an embodiment of the present invention; Figure 4 A schematic diagram of a sub-process of an order splitting processing method provided in an embodiment of the present invention; Figure 5 A schematic diagram of a sub-process of an order splitting processing method provided in an embodiment of the present invention; Figure 6 A schematic diagram of a sub-process of an order splitting processing method provided in an embodiment of the present invention; Figure 7 A schematic diagram of a sub-process of an order splitting processing method provided in an embodiment of the present invention; Figure 8 A schematic diagram of a sub-process of an order splitting processing method provided in an embodiment of the present invention; Fig. 9 A schematic block diagram of an order splitting processing device provided by an embodiment of the present invention; Fig.10 A schematic block diagram of a computer device provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0020] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0021] It should be understood that when used in this specification and the appended claims, the terms "include" and "comprises" indicate the presence of described features, integers, steps, operations, elements and / or components, but do not exclude the presence or addition of one or more other features, integers, steps, operations, elements, components and / or combinations thereof.

[0022] It should also be understood that the terms used in this specification of the present invention are only for the purpose of describing specific embodiments and are not intended to limit the present invention. As used in the specification of the present invention and the appended claims, unless the context clearly indicates otherwise, the singular forms "a", "an" and "the" are intended to include plural forms.

[0023] It should be further understood that the term "and / or" used in the present description and the appended claims refers to and includes any and all possible combinations of one or more of the associated listed items.

[0024] See also Figure 1 and Figure 2 , Figure 1 A schematic diagram of an application scenario of the order splitting processing method provided in an embodiment of the present invention. Figure 2 A schematic flow chart of an order splitting processing method provided by an embodiment of the present invention. The order splitting processing method is applied to a server. The server interacts with the terminal for data. When processing large batches of orders, in order to avoid memory exhaustion, the inventory is first abstracted into a two-dimensional matrix, a virtual two-dimensional table is constructed by whether it is out of stock, and it is converted into a binary format for storage. The dynamic programming (DP) algorithm is used in combination with existing data (such as logistics rates and inventory) to calculate the optimal number of warehouses, and a threshold is set to reduce invalid combination calculations. When multiple warehouses provide the same goods, all possible warehouse combinations are recursively generated using binary operations (such as bitwise AND, bitwise OR, XOR, and negation). Based on these combinations, the freight of each combination is calculated, and the combination with the lowest cost is selected. Finally, the warehouse combination that meets the delivery standard is organized into a KV structure, and the optimal freight combination is screened by weight, volume and other information, and splitting suggestions are provided to improve order processing efficiency. It can solve the problem that the existing technology is too simple in order splitting and warehouse selection, fails to effectively optimize inventory and reduce logistics costs, and thus leads to low delivery efficiency and unreasonable freight costs.

[0025] Figure 2 FIG. 1 is a flow chart of an order splitting processing method provided by an embodiment of the present invention. Figure 2 As shown, the method includes the following steps S110 to S170.

[0026] S110. Obtain the inventory data of the goods and record whether the goods in the order have been fully shipped.

[0027] In one embodiment, see Figure 3 , the above-mentioned step S110 may include steps S111~S113.

[0028] S111. Select the assigned warehouse and obtain the inventory data of each item in the order in each warehouse.

[0029] In this embodiment, the warehouse to be assigned is selected, and the inventory information of each item in the order in each warehouse is collected. These data include the current inventory of each item in each warehouse.

[0030] S112: Obtain a logistics rate template and store it.

[0031] In this embodiment, the corresponding logistics rate template is obtained and stored in the form of logistics + warehouse for use in subsequent calculations.

[0032] S113. Record the item number in the order, and convert the item number into a binary decimal integer.

[0033] In this embodiment, the order item subscript is recorded, and the order item is converted into a binary decimal integer by shifting the item bit left by -1, so that the inventory data can be processed and analyzed efficiently.

[0034] S120: Convert the inventory status of each warehouse in the order into decimal and store it as a key-value pair to obtain a storage result.

[0035] In this embodiment, the storage result refers to the result obtained by storing the warehouse id and the decimal result as a key-value pair.

[0036] In one embodiment, see Figure 4 , the above-mentioned step S120 may include steps S121~S123.

[0037] S121. Compare the quantity of the goods in the order with the inventory of the warehouse involved in the allocation to check whether the allocated warehouse is out of stock.

[0038] In this embodiment, the quantity of each item in the order is compared with the inventory of the warehouses involved in the allocation to determine whether the warehouses have enough items. If the inventory of a warehouse is not enough to meet the order requirements, the warehouse is marked as out of stock.

[0039] S122. When the assigned warehouse is not out of stock, the inventory status is recorded using a binary calculation method and converted into a decimal storage to obtain a decimal result.

[0040] In this embodiment, the decimal result refers to the decimal conversion result of the inventory status.

[0041] For warehouses that are well-stocked, binary calculations are used to record their inventory status. This usually involves representing the inventory status of each item as binary bits. For example, each binary bit can represent the inventory status of an item, with 1 indicating that it is in stock and 0 indicating that it is out of stock. This binary representation is then converted to a decimal value to simplify storage and subsequent calculations.

[0042] S123. The storage warehouse ID and the decimal result are a key-value pair to obtain a storage result.

[0043] In this embodiment, the warehouse ID and its corresponding decimal result are stored as a key-value pair, which can efficiently retrieve and manage inventory data and facilitate quick search and comparison of inventory status of each warehouse in subsequent processing.

[0044] Using binary and decimal to represent inventory status simplifies the data processing process and speeds up calculations. The key-value pair storage method reduces data redundancy and makes the retrieval of warehouse inventory status more direct. By converting the inventory status into decimal, further operations and comparisons can be easily performed, such as calculating the optimal distribution plan.

[0045] S130. Calculate the optimal solution of the number of shipping warehouses according to the stored results to obtain an optimal warehouse combination.

[0046] In one embodiment, see Figure 4 , the above-mentioned step S130 may include steps S131~S133.

[0047] S131. Sort the decimal results in the stored results in descending order to obtain a sorted result.

[0048] In this embodiment, sorting the results refers to sorting the stored results in descending order.

[0049] Arrange all decimal values ​​in the storage results in descending order. These decimal values ​​represent the coverage of goods in different warehouses.

[0050] The sorted results make subsequent calculations more efficient. Prioritizing warehouses with higher coverage can help find the optimal solution faster, thereby reducing the amount of calculation.

[0051] S132. Use recursive calculation and XOR operation to find the minimum number of warehouses that meet the conditions of the sorting result to obtain the screening result.

[0052] In this embodiment, the screening result refers to the result of the minimum number of warehouses for which the sorting result meets the conditions.

[0053] Using recursive calculation and XOR operation, detect which warehouse combinations can cover all required goods, and calculate the minimum number of warehouses that meet the conditions.

[0054] Recursive calculation can deeply explore all possible warehouse combinations, while XOR operation helps to quickly evaluate the coverage of these combinations. In this way, the smallest warehouse combination that meets the conditions can be effectively screened out, avoiding redundant calculations.

[0055] S133. Narrowing the screening results to obtain an optimal warehouse combination.

[0056] In this embodiment, based on the screening results of the previous step, the warehouse combinations are further reduced to exclude warehouses included in other warehouse combinations, thereby streamlining the final warehouse combinations.

[0057] Reducing the steps can avoid meaningless redundant calculations and ensure that the final selected warehouse combination is the most concise and effective. This not only improves computing efficiency, but also optimizes resource usage.

[0058] Through the storage results of KV, the optimal solution for the number of shipping warehouses is calculated for the order splitting suggestion. First, the decimal numbers in the values ​​array of the storage results are sorted in descending order. For example, in the order, if the goods are not out of stock, the corresponding binary number is 111 (decimal: 7), and if the second product is out of stock, it is 101 (decimal: 5). Next, recursively calculate the module for screening the optimal solution, and find the minimum number of warehouses that meet the conditions by performing XOR operations on the goods under the warehouse. The decimal number of this optimal solution is 2n-1. In order to avoid meaningless calculations, the warehouse data needs to be reduced based on the principle of completely including other warehouses and the variety of goods is greater than the warehouse to be removed. For example, the order items are item 1, item 2, item 3, and item 4, and the inventory is: the binary number corresponding to warehouse C (item 1, item 2) is 1100, the binary number corresponding to warehouse A (item 2, item 3, item 4) is 0111, the binary number corresponding to warehouse D (item 1, item 3) is 1010, and the binary number corresponding to warehouse B (item 1, item 3, item 4) is 1011. Finally, the optimal number of warehouses is 2.

[0059] S140. Check through bitwise operation whether the optimal warehouse combination contains the same product in multiple warehouses.

[0060] In one embodiment, see Figure 6 , the above-mentioned step S140 may include steps S141~S142.

[0061] S141. Perform a bitwise OR operation on each warehouse combination in the optimal warehouse combination to check whether the warehouse combination can meet all the product requirements of the order.

[0062] In this embodiment, a bitwise OR operation is performed on each warehouse combination in the optimal solution to determine whether these combinations can meet the needs of all goods in the order. This is done by merging the inventory data of all related warehouses and checking whether the merged result covers all the goods required for the order.

[0063] This operation ensures that the selected warehouse combination can fully meet the order requirements and avoid missing any necessary goods. This operation is a key step in verifying the effectiveness of the optimal solution and helps to ensure that the warehouse combination finally selected can indeed complete the delivery task.

[0064] S142. For the warehouse combination that can meet all the product requirements of the order, determine whether there are multiple warehouses with the same product.

[0065] In this embodiment, for those warehouse combinations that can meet all the product requirements of the order, it is further checked whether the combinations contain the same product provided by multiple warehouses. This is usually achieved by performing a bitwise AND operation on the warehouse inventory data.

[0066] Identifying and handling the situation of the same product in multiple warehouses can reduce redundant use of resources, optimize warehouse configuration, and ensure more efficient inventory management. Through this step, it can be ensured that the final warehouse combination can not only meet order requirements, but also avoid unnecessary duplication of supply, thereby reducing costs and improving logistics efficiency.

[0067] In this embodiment, by recursively performing a bitwise "OR" operation on the warehouse storage data (expressed in decimal) and the data of other warehouses, if the operation result is equal to the value after the product size is shifted to the left, it is considered that these warehouse combinations can meet all the delivery requirements of the order. On this basis, it is also necessary to check whether there are multiple warehouses with the same product, that is, perform a bitwise "AND" operation on the inventory data i of warehouse A and the inventory data j of warehouse B.

[0068] S150. When the optimal warehouse combination contains multiple warehouses with the same goods, a combination set is constructed.

[0069] In this embodiment, the combination set refers to those warehouse combinations that meet the "multiple warehouses with the same goods and can meet all the goods requirements of the order" selected from all possible warehouse combinations. Each warehouse combination in the combination set meets two conditions: Able to meet all product requirements of the order: This combination can provide all the products required for the order.

[0070] There are multiple warehouses with the same goods: that is, in this combination, some goods come from multiple warehouses.

[0071] In one embodiment, see Figure 7 , the above-mentioned step S150 may include steps S151~S152.

[0072] S151. For a warehouse combination that has multiple warehouses with the same product and can meet all product requirements of the order, a storage result of the multiple warehouses with the same product combination is constructed to obtain a construction result.

[0073] In this embodiment, all warehouses and their inventory information are obtained and matched with order requirements; for each product, all warehouses that provide the product are found and combinations of these warehouses are created; all warehouse combinations that meet the conditions (i.e., they can meet all product requirements of the order and each product is in stock in multiple warehouses) are recorded. This result set includes all warehouse combinations that can effectively meet the order requirements, forming a "construction result".

[0074] Ensure that all possible warehouse combinations are considered to avoid missing any combination that can satisfy the order; record the situation of the same product in multiple warehouses so that the system can handle different warehouse configurations.

[0075] S152. Find out, through bitwise operation, a warehouse combination in the construction result that satisfies the requirement that all goods are in stock, to obtain a combination set.

[0076] In this embodiment, bit operation technology is used to quickly process and retrieve information. Each warehouse can be represented by a bit, and each product is also represented by a bit. Through bit operation, it is possible to efficiently determine whether a certain warehouse combination covers all required products. From the construction results, the warehouse combination that meets all product requirements is selected to obtain the final "combination set".

[0077] Bitwise operations can efficiently process a large number of combinations and conditional judgments, and are particularly suitable for processing large-scale data sets. They ensure that the final warehouse combination can meet the needs of all goods in the order, avoiding insufficient inventory. Bitwise operations simplify the combination screening process, reducing computational complexity and time costs.

[0078] Determine whether it is necessary to build a KV set to store the extended multi-warehouse same-product combination based on the warehouse combination that has multiple warehouses with the same product and can meet all product requirements of the order. First, determine the existence of the products in each warehouse by performing bit operations on the inventory data of each warehouse (for example, 1011 and 1110 are ANDed to get 1010). Next, obtain non-repeating bits (for example, 0101) through the negation operation, and then use the decimal values ​​of these bits as indexes to traverse and calculate the warehouse combinations that satisfy the inventory of all products, and store these combinations in the KV structure, where Key is the warehouse and V is the decimal position subscript of the product. In order to improve performance, the logic is pruned and optimized, and a baseline number of warehouses is set to interrupt the logic of the excess part, thereby reducing the recursive depth. For example, the following combinations are included: Combination 1: [Warehouse A (0111): Item 2, Item 3, Item 4], [Warehouse B (1000): Item 1]; Combination 2: [Warehouse A (0111): Item 2, Item 3, Item 4], [Warehouse C (1000): Item 1]; Combination 3: [Warehouse A (0111): Item 2, Item 3, Item 4], [Warehouse D (1000): Item 1]; Combination 4: [Warehouse B (1011): Item 1, Item 3, Item 4], [Warehouse A (0100): Item 2]; Combination 5: [Warehouse C (1100): Item 1, Item 2], [Warehouse A (0011): Item 3, Item 4].

[0079] S160: Perform data translation and cost calculation on the combination set, and determine the lowest cost shipping combination to obtain a final shipping combination.

[0080] In this embodiment, the final delivery combination refers to selecting a delivery plan with the lowest total cost among all possible delivery combinations by calculating and comparing the cost of each combination.

[0081] In one embodiment, see Figure 8 The above-mentioned step S160 may include steps S161~S163.

[0082] S161. Translate the data of the combined set to determine the specific goods in each warehouse.

[0083] In this embodiment, the data in the combined set is translated into the specific product information actually stored in each warehouse. This ensures an accurate understanding of the actual inventory of each warehouse and provides a real data basis for subsequent order processing. Accurate product information can prevent order processing problems caused by data errors and improve the reliability of the overall system.

[0084] S162. Calculate the weight, volume and delivery address information of the order based on the specific goods in each warehouse.

[0085] In this embodiment, detailed information of specific goods, such as weight and volume, is extracted from each warehouse; the weight and volume of each item are multiplied by the quantity of each item in the order to obtain the total weight and volume of the order; and the delivery address information of the order is extracted and formatted to ensure accuracy.

[0086] Calculating the weight and volume of the order helps to arrange the shipping method and select the appropriate logistics service, while the delivery address information is used to ensure the delivery is accurate. This step ensures the efficiency and accuracy of logistics operations and avoids additional costs or delays caused by calculation errors.

[0087] S163. Calculate the total cost of each intermediate warehouse combination according to the logistics rate template, and select the delivery combination with the lowest cost to obtain the final delivery combination.

[0088] In this embodiment, the specific product information of each combination is obtained from the intermediate warehouse combination, including weight, volume, shipping location, etc.; the total cost of each combination is calculated using the rules in the rate template. For example: The weight charge standard in the rate template is applied according to the total weight of each combination; the volume charge standard is applied according to the total volume of each combination; and the additional charge is calculated based on the distance or area from the shipping point to the destination.

[0089] For each intermediate warehouse combination, the calculated various fees (such as basic freight, volume fee, weight fee, etc.) are summarized to obtain the total cost of the combination; the total costs of all intermediate warehouse combinations are compared; and the combination with the lowest cost is selected as the final delivery plan.

[0090] The relevant information of the lowest cost combination is saved for subsequent processing; the actual delivery operation is performed according to the determined optimal combination.

[0091] Example: Assume that the logistics rate template stipulates: freight is $5 per kilogram and $10 per cubic meter.

[0092] For a combined order: total weight 20 kg or total volume 2 m³; The calculation is as follows: Weight charge = 20 kg * $5 / kg = $100, or, volume charge = 2 m³ * $10 / m³ = $20; Total cost = $20, or, $100.

[0093] Repeat the above calculation steps for all intermediate warehouse combinations and select the combination with the lowest total cost as the final delivery plan.

[0094] By calculating the cost of each possible shipping combination, the most economical delivery solution can be found. This step optimizes logistics costs, improves overall cost-effectiveness, and ensures that the company minimizes expenses while meeting customer needs.

[0095] S170: Update the inventory according to the final delivery combination, and display the delivery status and order quantity of each warehouse.

[0096] In this embodiment, according to the final delivery warehouse and goods in the final delivery combination, the inventory is logically deducted, and the result is displayed in a one-to-n manner to show the number of warehouses and orders.

[0097] Specifically, first, determine the final shipping combination, which includes the shipping warehouse and specific goods. According to the warehouses and goods involved in the final shipping combination, deduct the corresponding quantity from the inventory of each relevant warehouse. For example, if the final shipping combination decides to ship 10 items X and 5 items Y from warehouse A, then the quantity of these 10 items X and 5 items Y will be deducted from the inventory of warehouse A respectively. Update the inventory database or system to reflect the inventory status after these deduction operations. Display the shipping status and number of orders in a "one-to-N" manner. That is, display the results of the final shipping combination as the actual goods and quantities shipped from each warehouse. Display the number of orders processed by each warehouse.

[0098] Example: Warehouse A: 10 items of product X and 5 items of product Y were shipped, and the number of orders processed was 3.

[0099] Warehouse B: 7 items of product Z were shipped and 2 orders were processed.

[0100] The shipping details of each warehouse and the total number of orders processed are comprehensively displayed and provided to managers for analysis and decision-making.

[0101] By logically deducting inventory, we ensure that the system inventory is consistent with the actual inventory, reducing inventory management errors caused by delivery; automatically updating inventory reduces the workload of manual operations and improves the efficiency and accuracy of inventory management; displaying the delivery status and number of orders in a "one-to-N" manner, so that the delivery status of each warehouse and the number of orders processed are clear at a glance; providing detailed delivery and order data to support warehouse management and logistics optimization, and help analyze delivery efficiency and order processing; by displaying the delivery status and number of orders of each warehouse, management can better evaluate the workload and logistics efficiency of the warehouse, and make reasonable resource allocation and scheduling; helping to identify possible bottlenecks and improvement points, optimize inventory configuration and delivery processes, and improve overall operational efficiency.

[0102] Considering that the calculation of large-volume orders may consume a lot of memory instantaneously and cause service unavailability, the inventory is abstracted into a two-dimensional matrix, and a virtual two-dimensional table is constructed with out-of-stock as the core target. The inventory data of the warehouse corresponding to the order goods is stored in binary. The dynamic programming (DP) algorithm is combined with the existing data of the system, such as logistics rates and inventory, and the binary data of the warehouse inventory is used to calculate the optimal solution, determine the optimal number of warehouses to be matched, and reduce the invalid calculation of the combined warehouse by setting a threshold. When there are multiple warehouses with the same goods in the warehouse to be allocated, it is necessary to find all possible warehouse allocation combinations, expand the combination using binary bitwise AND, bitwise OR, XOR, and negation operations, and recursively obtain different combination results of the same goods in multiple warehouses. According to the combination results, the sample data is used to translate the product information, and the rates of each warehouse combination are calculated by weight, volume, and delivery address. The warehouse product combination with the lowest logistics rate is obtained by using CAS. Finally, the splitting suggestion is obtained, which significantly improves the warehouse's processing efficiency for orders. For the warehouse combination found, a KV structure set of warehouse shipments without duplication is obtained as a data set through binary bitwise AND, bitwise OR, XOR and other calculation methods. The specific goods are abstracted into weight and volume, and the combination with the lowest freight is screened out as the order splitting suggestion, which effectively improves user processing efficiency.

[0103] Use out-of-stock marks to filter out the order arrays that need to be split, and improve system memory utilization through binary storage and operations. Use the dynamic programming (DP) algorithm to obtain the optimal solution for the number of warehouses, and reasonably prune invalid logic based on this optimal solution to improve execution efficiency. At the same time, calculate all the combination data that meet the requirements of multiple warehouses with the same goods, and display the combination results with the lowest logistics rates. Warehouse staff only need to split the orders and ship them according to the suggestions, without worrying about whether the ordered goods have been fully shipped or whether the logistics rates are reasonable. This greatly reduces the workload of warehouse staff in selecting goods and calculating freight, and significantly improves the overall delivery efficiency.

[0104] The above-mentioned order splitting processing method obtains inventory data and converts the inventory status of each warehouse into decimal for storage. Then, the optimal shipping warehouse combination is calculated, the situation of the same goods in multiple warehouses is checked and processed, and finally, the lowest cost shipping combination is selected through cost calculation, and the inventory is updated and the shipping status is displayed; it solves the problem that the existing technology is too simple in order splitting and warehouse selection, fails to effectively optimize inventory and reduce logistics costs, and thus leads to low shipping efficiency and unreasonable freight costs.

[0105] Fig. 9 is a schematic block diagram of an order splitting processing device 300 provided in an embodiment of the present invention. Fig. 9As shown, corresponding to the above order splitting processing method, the present invention also provides an order splitting processing device 300. The order splitting processing device 300 includes a unit for executing the above order splitting processing method, and the device can be configured in a server. Fig. 9 The order splitting processing device 300 includes an inventory data acquiring unit 301, a conversion storage unit 302, a calculation unit 303, a checking unit 304, a construction unit 305, a combination determination unit 306 and an updating unit 307.

[0106] The inventory data acquisition unit 301 is used to acquire the inventory data of the goods and record whether the goods in the order have been fully shipped; the conversion storage unit 302 is used to convert the inventory status of each warehouse in the order into decimal and store it as a key-value pair to obtain a storage result; the calculation unit 303 is used to perform an optimal solution calculation of the number of shipping warehouses based on the storage result to obtain an optimal warehouse combination; the inspection unit 304 is used to check whether the optimal warehouse combination has multiple warehouses with the same goods through bit operations; the construction unit 305 is used to construct a combination set when the optimal warehouse combination has multiple warehouses with the same goods; the combination determination unit 306 is used to perform data translation and cost calculation on the combination set, and determine the shipping combination with the lowest cost to obtain a final shipping combination; the update unit 307 is used to update the inventory according to the final shipping combination, and display the shipping status and order quantity of each warehouse.

[0107] In one embodiment, the inventory data acquisition unit 301 includes: The data acquisition subunit is used to select the assigned warehouse and obtain the inventory data of each item in the order in each warehouse; the template acquisition subunit is used to obtain the logistics rate template and store it; the recording subunit is used to record the item number in the order and convert the item number into a binary decimal integer.

[0108] In one embodiment, the conversion storage unit 302 includes: The comparison subunit is used to compare the quantity of the goods in the order with the inventory of the warehouse involved in the allocation to check whether the allocated warehouse is out of stock; the conversion subunit is used to record the inventory status using a binary calculation method when the allocated warehouse is not out of stock, and convert it into decimal storage to obtain a decimal result; the storage subunit is used to store the warehouse ID and the decimal result as a key-value pair to obtain a storage result.

[0109] In one embodiment, the calculation unit 303 includes: The sorting subunit is used to sort the decimal results in the storage results in descending order to obtain the sorting results; the screening subunit is used to use recursive calculation and XOR operation to find the minimum number of warehouses that meet the conditions of the sorting results to obtain the screening results; the reduction subunit is used to reduce the screening results to obtain the optimal warehouse combination.

[0110] In one embodiment, the checking unit 304 includes: The bitwise OR operation subunit is used to perform a bitwise OR operation on each warehouse combination in the optimal warehouse combination to check whether the warehouse combination can meet all the product requirements of the order; the judgment subunit is used to judge whether there are multiple warehouses with the same product for the warehouse combination that can meet all the product requirements of the order.

[0111] In one embodiment, the construction unit 305 includes: The combination construction subunit is used to construct the storage result of the multi-warehouse same-goods combination for the warehouse combination that has multiple warehouses with the same goods and can meet all the goods requirements of the order, so as to obtain the construction result; the set determination subunit is used to find out the warehouse combination in the construction result that satisfies the inventory of all goods through bit operations, so as to obtain the combination set.

[0112] In one embodiment, the combination determination unit 306 includes: The translation subunit is used to translate the data of the combination set to determine the specific goods in each warehouse; the information calculation subunit is used to calculate the weight, volume and delivery address information of the order according to the specific goods in each warehouse; the total cost calculation subunit is used to calculate the total cost of each intermediate warehouse combination according to the logistics rate template, and select the lowest cost delivery combination to obtain the final delivery combination.

[0113] It should be noted that technical personnel in the relevant field can clearly understand that the specific implementation process of the above-mentioned order splitting processing device 300 and each unit can refer to the corresponding description in the aforementioned method embodiment, and for the convenience and brevity of description, it will not be repeated here.

[0114] The order splitting processing device 300 can be implemented in the form of a computer program. Fig.10 Runs on the computer device shown.

[0115] See also Fig.10 , Fig.10 5 is a schematic block diagram of a computer device provided in an embodiment of the present application. The computer device 500 may be a server, wherein the server may be an independent server or a server cluster composed of multiple servers.

[0116] See also Fig.10 The computer device 500 includes a processor 502 , a memory and a network interface 505 connected via a system bus 501 , wherein the memory may include a non-volatile storage medium 503 and an internal memory 504 .

[0117] The non-volatile storage medium 503 can store an operating system 5031 and a computer program 5032. The computer program 5032 includes program instructions, and when the program instructions are executed, the processor 502 can execute an order splitting processing method.

[0118] The processor 502 is used to provide computing and control capabilities to support the operation of the entire computer device 500 .

[0119] The internal memory 504 provides an environment for the operation of the computer program 5032 in the non-volatile storage medium 503. When the computer program 5032 is executed by the processor 502, the processor 502 can execute an order splitting processing method.

[0120] The network interface 505 is used to communicate with other devices over the network. Fig.10 The structure shown in the figure is merely a block diagram of a portion of the structure related to the solution of the present application, and does not constitute a limitation on the computer device 500 to which the solution of the present application is applied. The specific computer device 500 may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0121] The processor 502 is used to run the computer program 5032 stored in the memory to implement the following steps: Obtain the inventory data of the goods and record whether the goods in the order have been fully shipped; convert the inventory status of each warehouse in the order into decimal and store it as a key-value pair to obtain the storage result; perform optimal calculation of the number of shipping warehouses based on the storage result to obtain the optimal warehouse combination; check whether the optimal warehouse combination has multiple warehouses with the same goods through bit operations; when the optimal warehouse combination has multiple warehouses with the same goods, construct a combination set; perform data translation and cost calculation on the combination set, and determine the shipping combination with the lowest cost to obtain the final shipping combination; update the inventory based on the final shipping combination, and display the shipping status and order quantity of each warehouse.

[0122] In one embodiment, when the processor 502 implements the step of obtaining the inventory data of the goods and recording whether the goods in the order are fully shipped, it specifically implements the following steps: Select the assigned warehouse and obtain the inventory data of each item in the order in each warehouse; obtain the logistics rate template and store it; record the item number in the order and convert the item number into a binary decimal integer.

[0123] In one embodiment, when the processor 502 implements the step of converting the inventory status of each warehouse in the order into decimal and storing it as a key-value pair to obtain a storage result, the processor 502 specifically implements the following steps: The quantity of the goods in the order is compared with the inventory of the warehouse involved in the allocation to check whether the allocated warehouse is out of stock; when the allocated warehouse is not out of stock, the inventory status is recorded using a binary calculation method and converted to decimal storage to obtain a decimal result; the warehouse ID and the decimal result are stored as a key-value pair to obtain a storage result.

[0124] In one embodiment, when the processor 502 implements the step of performing optimal calculation of the number of shipping warehouses according to the stored results to obtain an optimal warehouse combination, the processor 502 specifically implements the following steps: The decimal results in the storage results are sorted in descending order to obtain a sorting result; recursive calculation and XOR operation are used to find the minimum number of warehouses that meet the conditions of the sorting result to obtain a screening result; the screening result is reduced to obtain an optimal warehouse combination.

[0125] In one embodiment, when the processor 502 implements the step of checking whether the optimal warehouse combination has multiple warehouses with the same product by bit operation, the processor 502 specifically implements the following steps: Perform a bitwise OR operation on each warehouse combination in the optimal warehouse combination to check whether the warehouse combination can meet all the product requirements of the order; for the warehouse combination that can meet all the product requirements of the order, determine whether there are multiple warehouses with the same product.

[0126] In one embodiment, when implementing the step of constructing a combination set, the processor 502 specifically implements the following steps: For warehouse combinations that have multiple warehouses with the same goods and can meet all the goods requirements of the order, a storage result of the multiple warehouses with the same goods combination is constructed to obtain a construction result; and a warehouse combination in the construction result that satisfies the requirement that all goods are in stock is found through bit operations to obtain a combination set.

[0127] In one embodiment, when the processor 502 implements the step of performing data translation and cost calculation on the combination set and determining the lowest-cost delivery combination to obtain the final delivery combination, the processor 502 specifically implements the following steps: The data of the combination set is translated to determine the specific goods in each warehouse; the weight, volume and delivery address information of the order are calculated according to the specific goods in each warehouse; the total cost of each intermediate warehouse combination is calculated according to the logistics rate template, and the shipping combination with the lowest cost is selected to obtain the final shipping combination.

[0128] It should be understood that in the embodiment of the present application, the processor 502 may be a central processing unit (CPU), and the processor 502 may also be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. Among them, the general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.

[0129] It can be understood by those skilled in the art that all or part of the processes in the method for implementing the above embodiment can be completed by instructing the relevant hardware through a computer program. The computer program includes program instructions, and the computer program can be stored in a storage medium, which is a computer-readable storage medium. The program instructions are executed by at least one processor in the computer system to implement the process steps of the embodiment of the above method.

[0130] Therefore, the present invention also provides a storage medium. The storage medium may be a computer-readable storage medium. The storage medium stores a computer program, wherein when the computer program is executed by a processor, the processor executes the following steps: Obtain the inventory data of the goods and record whether the goods in the order have been fully shipped; convert the inventory status of each warehouse in the order into decimal and store it as a key-value pair to obtain the storage result; perform optimal calculation of the number of shipping warehouses based on the storage result to obtain the optimal warehouse combination; check whether the optimal warehouse combination has multiple warehouses with the same goods through bit operations; when the optimal warehouse combination has multiple warehouses with the same goods, construct a combination set; perform data translation and cost calculation on the combination set, and determine the shipping combination with the lowest cost to obtain the final shipping combination; update the inventory based on the final shipping combination, and display the shipping status and order quantity of each warehouse.

[0131] In one embodiment, when the processor executes the computer program to implement the step of obtaining inventory data of goods and recording whether the goods in the order are fully shipped, the processor specifically implements the following steps: Select the assigned warehouse and obtain the inventory data of each item in the order in each warehouse; obtain the logistics rate template and store it; record the item number in the order and convert the item number into a binary decimal integer.

[0132] In one embodiment, when the processor executes the computer program to implement the step of converting the inventory status of each warehouse in the order into decimal and storing it as a key-value pair to obtain a storage result, the processor specifically implements the following steps: The quantity of the goods in the order is compared with the inventory of the warehouse involved in the allocation to check whether the allocated warehouse is out of stock; when the allocated warehouse is not out of stock, the inventory status is recorded using a binary calculation method and converted to decimal storage to obtain a decimal result; the warehouse ID and the decimal result are stored as a key-value pair to obtain a storage result.

[0133] In one embodiment, when the processor executes the computer program to implement the step of performing optimal solution calculation of the number of shipping warehouses according to the stored results to obtain an optimal warehouse combination, the processor specifically implements the following steps: The decimal results in the storage results are sorted in descending order to obtain a sorting result; recursive calculation and XOR operation are used to find the minimum number of warehouses that meet the conditions of the sorting result to obtain a screening result; the screening result is reduced to obtain an optimal warehouse combination.

[0134] In one embodiment, when the processor executes the computer program to implement the step of checking whether there are multiple warehouses with the same goods in the optimal warehouse combination through bit operation, the processor specifically implements the following steps: Perform a bitwise OR operation on each warehouse combination in the optimal warehouse combination to check whether the warehouse combination can meet all the product requirements of the order; for the warehouse combination that can meet all the product requirements of the order, determine whether there are multiple warehouses with the same product.

[0135] In one embodiment, when the processor executes the computer program to implement the step of constructing a combination set, the processor specifically implements the following steps: For warehouse combinations that have multiple warehouses with the same goods and can meet all the goods requirements of the order, a storage result of the multiple warehouses with the same goods combination is constructed to obtain a construction result; and a warehouse combination in the construction result that satisfies the requirement that all goods are in stock is found through bit operations to obtain a combination set.

[0136] In one embodiment, when the processor executes the computer program to implement the step of translating data and calculating costs for the combination set, and determining the lowest-cost shipping combination to obtain the final shipping combination, the processor specifically implements the following steps: The data of the combination set is translated to determine the specific goods in each warehouse; the weight, volume and delivery address information of the order are calculated according to the specific goods in each warehouse; the total cost of each intermediate warehouse combination is calculated according to the logistics rate template, and the shipping combination with the lowest cost is selected to obtain the final shipping combination.

[0137] The storage medium may be a USB flash drive, a mobile hard disk, a read-only memory (ROM), a magnetic disk, or an optical disk, etc., which are computer-readable storage media that can store program codes.

[0138] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of the two. In order to clearly illustrate the interchangeability of hardware and software, the composition and steps of each example have been generally described in terms of function in the above description. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present invention.

[0139] In the several embodiments provided by the present invention, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of each unit is only a logical function division, and there may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed.

[0140] The steps in the method of the embodiment of the present invention can be adjusted in order, combined and deleted according to actual needs. The units in the device of the embodiment of the present invention can be combined, divided and deleted according to actual needs. In addition, the functional units in the various embodiments of the present invention can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0141] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a storage medium. Based on this understanding, the technical solution of the present invention is essentially or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for a computer device (which can be a personal computer, terminal, or network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention.

[0142] The above is only a specific embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any technician familiar with the technical field can easily think of various equivalent modifications or replacements within the technical scope disclosed by the present invention, and these modifications or replacements should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention shall be based on the protection scope of the claims.

Claims

1. The order splitting processing method is characterized by: include: Obtain inventory data for goods and record whether the goods in the order have been fully shipped; Convert the inventory status of each warehouse in the order into decimal and store it as a key-value pair to obtain the storage result; Calculate the optimal solution of the number of shipping warehouses according to the storage results to obtain an optimal warehouse combination; Use bitwise operations to check whether the optimal warehouse combination has multiple warehouses with the same goods; When the optimal warehouse combination contains multiple warehouses with the same goods, a combination set is constructed; Performing data translation and cost calculation on the combination set, and determining the lowest cost shipping combination to obtain a final shipping combination; Update the inventory based on the final delivery combination and display the delivery status and order count for each warehouse.

2. The order splitting processing method according to claim 1, characterized in that: The acquisition of inventory data of goods and recording whether the goods in the order are fully shipped include: Select the assigned warehouse and obtain the inventory data of each item in the order in each warehouse; Obtain the logistics rate template and store it; Record the item number in the order and convert the item number to a binary decimal integer.

3. The order splitting processing method according to claim 1, characterized in that: The inventory status of each warehouse in the order is converted into decimal and stored as a key-value pair to obtain a storage result, including: Compare the quantity of the goods in the order with the inventory of the warehouse involved in the allocation to check whether the allocated warehouse is out of stock; When the assigned warehouse is not out of stock, the inventory status is recorded using binary calculation method and converted to decimal storage to obtain a decimal result; The storage warehouse ID and the decimal result are a key-value pair to obtain the storage result.

4. The order splitting processing method according to claim 1, characterized in that: The step of performing optimal calculation of the number of shipping warehouses according to the storage result to obtain an optimal warehouse combination includes: Sorting the decimal results in the stored results in descending order to obtain a sorted result; Use recursive calculation and XOR operation to find the minimum number of warehouses that meet the conditions of the sorting result to obtain the screening result; The screening results are narrowed down to obtain an optimal warehouse combination.

5. The order splitting processing method according to claim 1, characterized in that: The bitwise operation is used to check whether the optimal warehouse combination has multiple warehouses with the same goods, including: Perform a bitwise OR operation on each warehouse combination in the optimal warehouse combination to check whether the warehouse combination can meet all the product requirements of the order; For the warehouse combination that can meet all the product requirements of the order, determine whether there are multiple warehouses with the same product.

6. The order splitting processing method according to claim 1 is characterized in that: The construction combination set includes: For warehouse combinations that have multiple warehouses with the same product and can meet all product requirements of the order, a storage result of the multiple warehouses with the same product combination is constructed to obtain a construction result; By bitwise operation, a warehouse combination satisfying the requirement that all goods are in stock is found in the construction result to obtain a combination set.

7. The order splitting processing method according to claim 6 is characterized in that: The data translation and cost calculation of the combination set and determination of the lowest cost shipping combination to obtain the final shipping combination include: Translating the data of the combined set to determine the specific goods in each warehouse; Calculate the weight, volume and delivery address information of the order based on the specific goods in each warehouse; The total cost of each intermediate warehouse combination is calculated according to the logistics rate template, and the delivery combination with the lowest cost is selected to obtain the final delivery combination.

8. The order splitting processing device is characterized by: include: The inventory data acquisition unit is used to acquire the inventory data of the goods and record whether the goods in the order have been fully shipped; The conversion storage unit is used to convert the inventory status of each warehouse in the order into decimal and store it as a key-value pair to obtain a storage result; A calculation unit, used to perform optimal solution calculation of the number of shipping warehouses according to the stored results to obtain an optimal warehouse combination; The checking unit is used to check whether the optimal warehouse combination contains the same product in multiple warehouses through bit operations; The construction unit is used to construct a combination set when there are multiple warehouses with the same goods in the optimal warehouse combination; A combination determination unit, used for performing data translation and cost calculation on the combination set, and determining a delivery combination with the lowest cost to obtain a final delivery combination; The updating unit is used to update the inventory according to the final delivery combination and display the delivery status and order quantity of each warehouse.

9. A computer device, characterized in that: The computer device comprises a memory and a processor, wherein a computer program is stored in the memory, and when the processor executes the computer program, the method according to any one of claims 1 to 7 is implemented.

10. A storage medium, characterized in that: The storage medium stores a computer program, and when the computer program is executed by a processor, the method according to any one of claims 1 to 7 is implemented.

Citation Information

Patent Citations

  • Method and device for determining warehouse storage distribution

    CN104574013A

  • E-commerce order number generation method and device, equipment and storage medium

    CN112365323A

  • Intelligent multi-warehouse delivery method and system for e-commerce service

    CN115760305A

  • Warehouse material allocation planning method and system based on improved genetic algorithm

    CN117217659A

  • Method for cleaning substrate

    KR102458583B1

Cited By

  • Even code layered intelligent modulation method and system based on binary bit operation

    CN120430734A

  • A hierarchical intelligent tuning method and system based on binary bit operations

    CN120430734B