Computer processing method for order warehouse searching and related device

Through computer processing methods and tree data models, intelligently match e-commerce order warehouses, the problems of low manual operation efficiency and high error rate in traditional e-commerce operations are solved, efficient processing and inventory management of e-commerce orders are realized, and the Customer experience and logistics efficiency.

CN118941209AInactive Publication Date: 2024-11-12SHANGHAI JIAYING TECH CO LTD

Patent Information

Application Number
CN202411020453.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-29
Publication Date
2024-11-12
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

The traditional e-commerce operation model relies on manual operations, resulting in low order processing efficiency, high error rate, poor customer experience, and difficulty in dealing with complex orders and emergencies, which cannot meet the needs of modern e-commerce companies.

Method used

Using computer processing methods to realize order warehouse search, a tree-like data model is established by analyzing the receiving address, matching warehouses within the target area, prioritizing selection based on inventory and distribution capabilities, and using sorting weights to calculate the optimal warehouse to achieve 智能选仓和库存管理。

Benefits of technology

It significantly improves logistics efficiency and customer satisfaction, reduces costs, enhances system flexibility, ensures accurate and timely delivery of orders, and optimizes inventory management and capacity allocation.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118941209A_ABST
    Figure CN118941209A_ABST
Patent Text Reader

Abstract

The invention relates to a computer processing method for order warehouse searching and a related device. The method comprises the following steps: obtaining order data; analyzing a receiving address of the order data to obtain a standard receiving address; matching warehouses in the target region range according to the standard receiving address; and selecting a distribution warehouse from the target region range, and sending the order data to the selected distribution warehouse.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of computer application technology, and more specifically, to a computer processing method, computer program product, storage medium and computer equipment for order warehouse search. Background Art

[0002] In the era of booming e-commerce industry, order processing efficiency and delivery speed have become important criteria for measuring the service level of e-commerce enterprises. With the continuous expansion of e-commerce business, the number of warehouses and stores across the country has increased rapidly. How to realize intelligent warehouse selection and order dispatch across the country has become an urgent problem to be solved.

[0003] Traditional e-commerce operation models often rely on manual operations, which are inefficient and prone to errors, and can no longer meet the needs of modern e-commerce companies. Specifically, traditional e-commerce operations have the following shortcomings:

[0004] Inefficiency: Manually processing orders and matching warehouses and stores takes a lot of time and effort. The speed of processing information is far slower than that of the automated system, and it is unable to respond and process a large number of orders quickly, especially during peak order periods, which is prone to backlogs and delays.

[0005] High error rate: Various human errors are prone to occur in manual operations, such as errors in order information entry, wrong warehouse selection, etc., which lead to inaccurate order shipments. Due to the reliance on manual updates of inventory and order information, data updates are often not timely, affecting the accuracy of inventory management and order processing.

[0006] Poor customer experience: Due to the low efficiency of manual processing, customers often have to wait a long time to receive their orders, affecting the shopping experience.

[0007] Insufficient ability to deal with complex orders: When faced with complex orders (such as bulk orders or orders that require coordination among multiple warehouses), manual management is difficult to coordinate and optimize effectively, and unreasonable scheduling is prone to occur. Manual management lacks flexibility and the ability to adjust quickly when dealing with emergencies and changes, which can easily lead to delays and reduced service quality. Summary of the invention

[0008] In order to realize intelligent warehouse selection for e-commerce orders, the present invention proposes a computer processing method and related devices for order warehouse search. In this article, "order warehouse search" refers to the selection of warehouses for distribution according to e-commerce orders. The "warehouse" generally refers to a place where goods are stored, including warehouses in the general sense, as well as distributors, stores, etc.

[0009] According to an embodiment of the present invention, a computer processing method for order warehouse search includes:

[0010] Get order data;

[0011] Parsing the delivery address of the order data to obtain a standardized delivery address;

[0012] Match warehouses within the target area based on the standardized delivery address;

[0013] A distribution warehouse is selected from within the target area, and the order data is sent to the selected distribution warehouse.

[0014] In some embodiments of the present invention, the computer processing method further comprises:

[0015] The target area includes the first regional division, the second regional division, and the third regional division;

[0016] A tree data model with the first regional division as a root node is established in the memory, wherein the second regional division is a child node of the first regional division, the third regional division is a child node of the second regional division, and the scope of the first regional division is larger than that of the second regional division, and the scope of the second regional division is larger than that of the third regional division;

[0017] Each node in the tree data model points to a warehouse that can perform distribution within the corresponding geographical area.

[0018] In some embodiments of the present invention, the process of matching a warehouse within a target area according to a standardized delivery address includes:

[0019] Searching for a corresponding tree structure according to the first regional division name in the standard recipient address;

[0020] Starting from the bottom child node of the tree structure, searching for a child node matching the third geographical region name in the standard recipient address;

[0021] Get the warehouse that supports distribution on the current node, and get the inventory data and distribution capacity of the warehouse;

[0022] If there is no warehouse that supports distribution at the current node, the node at the previous level in the tree structure will be searched for a warehouse that supports distribution until a warehouse that supports distribution is found.

[0023] In some embodiments of the present invention, the process of selecting a distribution warehouse from within the target area includes:

[0024] When the warehouse that supports distribution on the current node is a single warehouse, select this warehouse as the distribution warehouse and lock the warehouse inventory.

[0025] In some embodiments of the present invention, the process of selecting a distribution warehouse from within the target area includes:

[0026] When the warehouses supporting distribution at the current node include multiple warehouses, the warehouse with the highest priority is selected as the distribution warehouse according to the regional priority; optionally, the regional priority can be determined by the e-commerce or logistics company.

[0027] When multiple warehouses have the same priority, the warehouses are re-sorted using the sorting weights to select the best warehouse.

[0028] The above ranking weight is calculated according to the following formula:

[0029] Sorting weight = remaining order-taking capacity × capacity weight + inventory balance × inventory weight,

[0030] The remaining order-accepting capacity of each of the multiple warehouses is calculated based on the daily maximum order quantity of the warehouse and the number of orders received on that day.

[0031] In some implementations of the present invention, the capacity weight is 0.5, and the inventory weight is 0.5.

[0032] In some embodiments of the present invention, the process of selecting a distribution warehouse from within the target area includes:

[0033] When the inventory of the current warehouse does not meet the quantity of goods required by the order, it is assumed that the current warehouse will send all the remaining inventory to the buyer of the order, and the remaining quantity of goods will be shipped from other warehouses.

[0034] Among them, the other warehouse is selected according to the principle of minimizing the number of packages shipped by the current warehouse and other warehouses in combination.

[0035] In addition, an embodiment of the present invention provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, it can implement the computer processing method for order warehouse search described in any embodiment.

[0036] In addition, an embodiment of the present invention provides a computer device, which includes a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the computer processing method for order warehouse search described in any one of the embodiments.

[0037] An embodiment of the present invention further provides a computer program product, which includes a computer program. When the computer program is executed by a processor, it implements the computer processing method for order warehouse search described in any one of the embodiments.

[0038] According to the implementation mode, the present invention realizes a high degree of automation and optimization of e-commerce order logistics and inventory management, significantly improves logistics efficiency, reduces costs, and enhances customer satisfaction and system flexibility.

[0039] Various aspects, features, advantages, etc. of the embodiments of the present invention will be described in detail below in conjunction with the accompanying drawings. According to the following detailed description in conjunction with the accompanying drawings, the above aspects, features, advantages, etc. of the present invention will become more clear. BRIEF DESCRIPTION OF THE DRAWINGS

[0040] Figure 1 It is a schematic flow chart of a computer processing method for order warehouse search according to an embodiment of the present invention.

[0041] Figure 2 An example of a tree data model according to an embodiment of the present invention is shown.

[0042] Figure 3 and Figure 4 An example of selecting a distribution warehouse using a tree data model according to an embodiment of the present invention is shown. DETAILED DESCRIPTION

[0043] Hereinafter, exemplary embodiments will be described in more detail with reference to the accompanying drawings. However, the present invention may be embodied in various different forms and should not be construed as being limited to the embodiments shown herein. On the contrary, these embodiments are provided as examples so that the disclosure of the present invention will be thorough and comprehensive, and will fully convey the various aspects and features of the present invention to those skilled in the art. Therefore, processes, elements, and techniques that are not necessary for a person of ordinary skill in the art to fully understand the various aspects and features of the present invention may not be described. Unless otherwise stated, similar reference numerals represent similar elements throughout the drawings and text descriptions, and therefore, their descriptions may not be repeated. In addition, the features or aspects within each exemplary embodiment should generally be considered to be other similar features or aspects that can be used in other exemplary embodiments.

[0044] The terms used herein are for the purpose of describing a specific embodiment, rather than for limiting the present invention. As used herein, "one" and "the" are intended to also include plural forms, unless the context clearly indicates otherwise. It should also be understood that the terms "comprising", "including" and "having" specify the existence of stated features, integral bodies, steps, operations, elements and / or parts when used in this specification, but do not exclude the existence or addition of one or more other features, integral bodies, steps, operations, elements, parts and / or their sets. As used herein, the term "and / or" includes any and all combinations of one or more of the associated listed items. Expressions such as "at least one of..." modify the entire list of elements when they are before the list of elements, rather than modifying the individual elements of the list. Similarly, unless the context clearly indicates, the terms "first", "second" and other such digital terms referring to structures do not mean order or sequence. Digital markings such as S101, S102, S201 are only used to correspond processing, steps or operations, etc. to the accompanying drawings, and do not necessarily represent the execution order of processing, operations or steps, etc.

[0045] According to an embodiment of the present invention, Figure 1 As shown, a computer processing method for order warehouse search includes:

[0046] S101, obtaining order data;

[0047] S102, parsing the delivery address of the order data to obtain a standardized delivery address;

[0048] S103, matching a warehouse within the target area according to the standardized delivery address;

[0049] S104, selecting a distribution warehouse from within the target area, and sending the order data to the selected distribution warehouse.

[0050] In some implementations, at S101, order data is obtained through an application program interface, for example, order data is obtained from e-commerce platform systems such as Taobao, JD.com, and Pinduoduo.

[0051] In some implementations, at S102, the order data is derived from different e-commerce platforms, and the address formats of the platforms are different. Parsing the delivery address of the order data includes: standardizing the address naming by removing modified nouns to improve the accuracy of the delivery area calculation. For example: using StringUtils.remove("Zhejiang Province", "Province"), "Zhejiang Province" is unified into "Zhejiang".

[0052] In some embodiments, the computer processing method further comprises performing the following preprocessing:

[0053] The target area includes the first regional division, the second regional division, and the third regional division;

[0054] A tree data model with the first regional division as a root node is established in the memory, wherein the second regional division is a child node of the first regional division, the third regional division is a child node of the second regional division, and the scope of the first regional division is larger than that of the second regional division, and the scope of the second regional division is larger than that of the third regional division;

[0055] Each node in the tree data model points to a warehouse that can perform distribution within the corresponding geographical area.

[0056] For example, the first geographical division is province (or municipality), the second geographical division is city, and the third geographical division is district (or county). A tree data model is established in memory with province as the root node, city as the child node of province, and district as the child node of city. Each node directly points to the warehouse that can perform the contract in the corresponding area. Figure 2 As shown, the root node is "Zhejiang", and its child nodes include "Hangzhou" and "Ningbo", the child node of the child node "Hangzhou" includes "West Lake", and the child node of the child node "Ningbo" includes "Fenghua". The root node "Zhejiang" points to warehouse A and warehouse B, the child node "Hangzhou" points to dealer A, the child node "West Lake" points to regional store A and regional store B, and the child node "Fenghua" points to regional store B. In some embodiments, the same warehouse can be demarcated in different regions, and the root node "Shanghai" can also point to warehouse A. That is, warehouse A supports distribution in both Shanghai and Zhejiang.

[0057] In some embodiments of the present invention, at S103, the process of matching a warehouse within the target area according to the standardized delivery address includes:

[0058] Searching for a corresponding tree structure according to the first regional division name in the standard recipient address;

[0059] Starting from the bottom child node of the tree structure, searching for a child node matching the third geographical region name in the standard recipient address;

[0060] Get the warehouse that supports distribution on the current node, and get the inventory data and distribution capacity of the warehouse;

[0061] If there is no warehouse that supports distribution at the current node, the node at the previous level in the tree structure will be searched for a warehouse that supports distribution until a warehouse that supports distribution is found.

[0062] For example, if the order data includes: purchase of 1 item SKU-A, and the delivery address is "No. XX, Lingyin Avenue, Xihu District, Hangzhou City, Zhejiang Province", then find the tree structure with the root node "Zhejiang" according to the province name. Then, Figure 3As shown, we start searching from the bottom child node of the tree structure, find the node "West Lake", obtain the warehouses in the area of ​​West Lake, namely, regional store A and regional store B, and obtain the inventory information of SKU-A*0, that is, the inventory of product SKU-A is 0. Therefore, there is currently no warehouse that supports distribution at the node "West Lake". So, Figure 4 As shown in the figure, the node "Hangzhou" at the previous level in the tree structure is searched for warehouses that support distribution, namely distributor A (SKU-A*5) and warehouse B (SKU-A*8). This intelligently matches the warehouse closest to the delivery address, shortens the delivery time, and improves the overall efficiency of order processing and delivery through real-time inventory monitoring and dynamic planning of transportation capacity.

[0063] In some implementations, at S104, the process of selecting a distribution warehouse from within the target area includes:

[0064] When the warehouse that supports distribution on the current node is a single warehouse, select this warehouse as the distribution warehouse and lock the warehouse inventory.

[0065] When the warehouses supporting distribution at the current node include multiple warehouses, the warehouse with the highest priority is selected as the distribution warehouse according to the regional priority, wherein the regional priority is to define the priority of a warehouse in distributing goods in a certain region;

[0066] When multiple warehouses have the same regional priority, the multiple warehouses are re-sorted using the sorting weights to select the best warehouse.

[0067] The above ranking weight is calculated according to the following formula:

[0068] Sorting weight = remaining order-taking capacity × capacity weight + inventory balance × inventory weight,

[0069] The remaining order-accepting capacity of each of the multiple warehouses is calculated based on the daily maximum order quantity of the warehouse and the number of orders received on that day.

[0070] In some embodiments of the present invention, the capacity weight is 0.5, and the inventory weight is 0.5, so that the orders in the region are distributed more evenly to avoid a situation where one warehouse is about to be overwhelmed with orders while another warehouse has no orders yet.

[0071] That is to say, the regional priority is used first. When the regional priority is high, other conditions are not considered. When the regional priorities are the same, the weight ranking is calculated based on the inventory and order-taking capacity, as shown in Tables 1 and 2. Among them, the regional priority can be determined by the e-commerce or logistics company according to the corresponding operation strategy.

[0072] Table 1: Data before sorting, assuming that the weights of inventory and order-taking capacity are both 50%

[0073]

[0074] Table 2: Sorting results:

[0075]

[0076] According to the above sorting principle, Figure 4 As shown in the figure, the warehouses that support distribution for the node "Hangzhou" include distributor A (SKU-A*5) and warehouse B (SKU-A*8), and the priority of both is 1. Therefore, a warehouse with large inventory and strong order-taking capacity is selected. The order-taking capacity is estimated based on the maximum order quantity and the number of orders received by the warehouse.

[0077] The system that implements the method of the present invention calculates the maximum daily order quantity (MaxOrderCapacity) and the number of orders received on the day (CurrentOrders) to obtain the remaining order capacity (RemainingCapacity) of the warehouse. In addition, the system also calculates the inventory balance (SkuStockQuantity) of the SKU required for the order in the current warehouse. RemainingCapacity and SkuStockQuantity are key indicators for warehouse selection calculation. The ranking weight of the warehouse is calculated using the warehouse indicator data and indicator weights, and the calculation formula is as follows:

[0078] RankingWeight=RemainingCapacity*CapacityWeight+SkuStockQuantity*SkuStockWeight

[0079] Among them, CapacityWeight is the capacity weight, SkuStockWeight is the inventory weight, and the default values ​​of both are 0.5.

[0080] In the example, according to the above formula, the ranking weight of distributor A is: 50*0.5+80*0.5=65; the ranking weight of warehouse B is: 60*0.5+20*0.5=40. Therefore, distributor A is selected as the distribution warehouse.

[0081] From the above, we can see that in the same area, when there are multiple warehouses, the goods are allocated according to priority, for example, warehouses with larger inventory or stronger processing capacity are given priority. At the same time, the order acceptance capacity and processing time of each warehouse are taken into consideration to ensure that the orders can be processed quickly and efficiently.

[0082] The system monitors the inventory status of warehouses and stores in real time, dynamically plans distribution capacity, and reasonably allocates orders. This approach not only ensures efficient use of inventory, but also improves offline fulfillment capabilities.

[0083] In some embodiments of the present invention, the process of selecting a distribution warehouse from within the target area includes:

[0084] When the inventory of the current warehouse does not meet the quantity of goods required by the order, it is assumed that the current warehouse will send all the remaining inventory to the buyer of the order, and the remaining quantity of goods will be shipped from other warehouses.

[0085] Among them, the other warehouse is selected according to the principle of minimizing the number of packages shipped by the current warehouse and other warehouses in combination.

[0086] The combined delivery of the present invention is described below by way of example.

[0087] 1: Define the product information required for the order

[0088] The definition of change order[] represents the quantity of goods required in the order. Combined with Table 3, we can see that:

[0089] order[0] = 4, the information of product A is at position 0 in the array, and its value is 4, which means that 4 pieces of A are needed in stock;

[0090] order[1] = 4, the information of product B is in the first position of the array, and the value is 4, which means that 4 pieces of B are needed in stock;

[0091] order[2]=2 The information of product C is at the second position of the array, and its value is 2, which means that 2 pieces of C are needed in stock.

[0092] Table 3:

[0093] Product A (index = 0) Product B (index = 1) Product C (index = 2) 4 4 2

[0094] 2: Define the inventory information of each item in the warehouse

[0095] In the example, the stock[][] two-dimensional array is used to represent the relationship between the warehouse and the SKU (Stock Keeping Unit) inventory.

[0096] Define the variable stock[i][j] to represent the quantity of each product in each warehouse (the warehouses are already sorted according to the above priority calculations).

[0097] Stock[0][2,5,4] indicates the quantity of goods A to C in warehouse 1;

[0098] Stock[1][4,2,1] indicates the quantity of goods A to C in warehouse 2;

[0099] Stock[2][3,6,7] indicates the quantity of goods A to C in warehouse 3.

[0100] Table 4:

[0101] Warehouse 1 (p = 100) Warehouse 2 (p=80) Warehouse 3 (p=70) Product A 2 4 3 Product B 5 2 6 Product C 4 1 7

[0102] Assume that the ranking weights of the warehouses calculated according to the above method are: Warehouse 1 is 100, Warehouse 2 is 80, and Warehouse 3 is 70. Therefore, the priority ranking is Warehouse 1, Warehouse 2, and Warehouse 3.

[0103] 3: Calculate the delivery combination of the product in the i-th warehouse

[0104] Traverse order[] and find the possibility of combining each product in different warehouses.

[0105] If the current warehouse can meet the quantity required by the order, the warehouse will not try to combine with other warehouses. For example, if product A requires 4 pieces and warehouse 2 can fully meet the quantity of the product, warehouse 2 will not be combined with any other warehouse.

[0106] If the current warehouse does not meet the quantity required by the order, it is assumed that the current warehouse will send all the remaining inventory to the buyer, and the remaining quantity will be sought from other warehouses.

[0107] Define dp[i][j] to record the possibility of shipping the jth item in the i-th warehouse.

[0108] For example:

[0109] dp[0][0]=[warehouse 1][["warehouse 1+warehouse 3"]]: If warehouse 1 wants to ship product A, it must be combined with warehouse 3.

[0110] dp[0][1]=[warehouse 1][["warehouse 1"]]: When warehouse 1 ships product B, it does not need to be combined with other warehouses.

[0111] dp[0][2]=[Warehouse 1][["Warehouse 1"]]: When warehouse 1 ships product C, it does not need to be combined with other warehouses.

[0112] Table 5:

[0113] Warehouse 1 (p = 100) Warehouse 2 (p=80) Warehouse 3 (p=70) Product A [Warehouse 1 + Warehouse 3] [Warehouse 2] [Warehouse 3 + Warehouse 1] Product B [Warehouse 1] [] [Warehouse 3] Product C [Warehouse 1] [] [Warehouse 3]

[0114] 4: Assuming that each warehouse hopes to be able to ship goods for buyers and to ship as many goods as possible by itself (that is, when it can ship alone, it will not consider other warehouses), calculate the possibility of all shipments from the current warehouse.

[0115] Table 6:

[0116] Warehouse 1 (p = 100) Warehouse 2 (p=80) Warehouse 3 (p=70) Product A [Warehouse 1 + Warehouse 3] [Warehouse 2] [Warehouse 3 + Warehouse 1] Product B [Warehouse 1] [Warehouse 1, Warehouse 3] [Warehouse 3] Product C [Warehouse 1] [Warehouse 1, Warehouse 3] [Warehouse 3]

[0117] There is only one way to prioritize shipments from warehouse 1: [Warehouse 1 + Warehouse 3], where product A is shipped from warehouse 1 and warehouse 3 together, and products B and C are shipped from warehouse 1 alone.

[0118] There are three ways to prioritize shipments from Warehouse 2: [Warehouse 2 + Warehouse 1], [Warehouse 2 + Warehouse 1 + Warehouse 3], [Warehouse 2 + Warehouse 3]

[0119] There is one way to prioritize shipments from warehouse 3: [Warehouse 3 + Warehouse 1]

[0120] According to the shipping plans of all the above warehouses, at least 2 packages are needed to meet the order requirements. Warehouse 1 has the highest priority, and the number of packages in the shipping plan also meets the minimum package requirement, so the shipping plan of Warehouse 1 is preferred.

[0121] According to the implementation mode of the present invention, the system gives priority to single warehouse shipment to reduce warehouse splitting operations. When a single warehouse cannot fully meet the order demand, the system will calculate the distribution plan with the least number of split packages to ensure that the order meets the logistics timeliness while minimizing the logistics cost.

[0122] In some embodiments, when a warehouse refuses to accept an order for various reasons, the system will automatically transfer the order to another suitable warehouse.

[0123] In summary, the method of the present invention has the following advantages over the prior art:

[0124] 1. Improve logistics efficiency: The system intelligently matches the nearest warehouse and store, shortens delivery time, and improves the overall efficiency of order processing and delivery by real-time inventory monitoring and dynamic planning of transportation capacity.

[0125] 2. Reduce logistics costs: Intelligent matching and minimum package algorithm reduce the transportation distance and the number of package distribution times, thereby reducing logistics costs.

[0126] 3. Improve inventory management efficiency: The system updates the inventory information of warehouses and stores in real time, ensures the accuracy and timeliness of inventory data, reasonably allocates orders and dynamically plans transportation capacity, maximizes the utilization efficiency of inventory resources, and avoids waste of resources.

[0127] 4. Improve customer satisfaction: Through precise inventory management and optimized distribution solutions, we ensure that orders are delivered accurately and on time, improving customer experience. Intelligent algorithms optimize order and transportation capacity allocation, ensuring that resources are optimally allocated and improving overall operational efficiency.

[0128] The methods, steps, processing, operations, etc. involved in the above embodiments can be stored on a computer-readable storage medium through computer-executable instructions, and the computer-executable instructions are executed by a processor to implement the methods, steps, processing, operations, etc. described in any embodiment of the present invention.

[0129] In addition, the methods, steps, processing, operations, etc. involved in the above embodiments can be executed by a computer device. The memory stores computer executable instructions, and the processor executes the computer executable instructions to implement the method described in any embodiment of the present invention.

[0130] Furthermore, the methods, steps, processing, operations, etc. involved in the above embodiments may be implemented by a computer program. The computer program may be included in a computer program product. When the computer program is executed by a processor, the method described in any embodiment of the present invention is implemented.

[0131] The hardware and data processing components for performing various processes, operations, example logic, logic blocks, program blocks, modules and circuits related to the embodiments disclosed herein can be implemented or executed using a general-purpose single-chip or multi-chip processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof to perform the functions described herein. A general-purpose processor can be a microprocessor, or any conventional processor, controller, microcontroller or state machine. The processor can also be implemented as a combination of computing devices, such as a combination of a DSP and a microprocessor, a plurality of microprocessors, a combination of one or more microprocessors and a DSP core, or any other such configuration. In some embodiments, specific processes and methods can be performed by circuits dedicated to specific functions. A memory (e.g., memory, storage unit, storage device) may include one or more devices (e.g., RAM, ROM, flash memory, hard disk storage) for storing data and / or computer code to complete or facilitate the various processes, layers and modules described in the disclosure herein. The memory may be or include volatile memory or non-volatile memory and may include a database component, an object code component, a script component, or any other type of information structure to support the various activities and information structures described herein. According to an exemplary embodiment, the memory is communicatively connected to the processor via a processing circuit and includes computer code for executing (e.g., by a processing circuit or processor) one or more processes described herein.

[0132] The method, system and program product of the embodiment of the present invention can perform various operations on any machine-readable medium. The embodiment of the present invention can be implemented using an existing computer processor, or implemented by a special-purpose computer processor for an appropriate system (incorporated for this purpose or another purpose), or implemented by a hard-wired system. The embodiment disclosed in the scope of this article includes a program product, which includes a machine-readable medium for carrying or having a machine-executable instruction or data structure stored thereon. Such a machine-readable medium can be any available medium that can be accessed by a general or special-purpose computer or other machine with a processor. For example, such a machine-readable medium can include RAM, ROM, EPROM, EEPROM or other optical disk storage devices, magnetic disk storage devices or other magnetic storage devices, or any other medium (which can be accessed by a general or special-purpose computer or other machine with a processor) that can be used to carry or store the desired program code in the form of a machine-executable instruction or data structure. The above combination is also included in the scope of the machine-readable medium. Machine executable instructions include instructions and data that, for example, enable a general-purpose computer, a special-purpose computer or a special-purpose processing machine to perform a specific function or function group.

[0133] Although the drawings and description may show method steps in a particular order, the order of these steps may be different from that shown and described, unless otherwise specified above. In addition, two or more steps may be performed simultaneously or partially simultaneously, unless otherwise specified above. Such variations may depend on, for example, the selected software and hardware systems and the designer's choice. All of these variations are within the scope of this disclosure. Similarly, software implementations of the described methods can be accomplished using standard programming techniques with rule-based logic and other logic to implement various connection steps, processing steps, comparison steps, and decision steps.

[0134] Those skilled in the art should understand that the purpose of the above-disclosed embodiments is to illustrate the technical solutions of the present invention, and it certainly cannot be used to limit the scope of the patent protection requested. Equivalent changes and modifications made according to the above-mentioned embodiments still fall within the scope covered by the claims.

Claims

1. A computer processing method for order warehouse search includes: Get order data; Parsing the delivery address of the order data to obtain a standardized delivery address; Match warehouses within the target area based on the standardized delivery address; A distribution warehouse is selected from within the target area, and the order data is sent to the selected distribution warehouse.

2. The computer processing method according to claim 1, characterized in that: The computer processing method also includes: The target area includes the first regional division, the second regional division, and the third regional division; A tree data model with the first regional division as a root node is established in the memory, wherein the second regional division is a child node of the first regional division, the third regional division is a child node of the second regional division, and the scope of the first regional division is larger than that of the second regional division, and the scope of the second regional division is larger than that of the third regional division; Each node in the tree data model points to a warehouse that can perform distribution within the corresponding geographical area.

3. The computer processing method according to claim 2, characterized in that: The process of matching the warehouse within the target area according to the standardized delivery address includes: Searching for a corresponding tree structure according to the first regional division name in the standard recipient address; Starting from the bottom child node of the tree structure, searching for a child node matching the third geographical region name in the standard recipient address; Get the warehouse that supports distribution on the current node, and get the inventory data and distribution capacity of the warehouse; If there is no warehouse that supports distribution at the current node, the node at the previous level in the tree structure will be searched for a warehouse that supports distribution until a warehouse that supports distribution is found.

4. The computer processing method according to claim 3, characterized in that: The process of selecting a distribution warehouse from within the target area includes: When the warehouse that supports distribution on the current node is a single warehouse, select this warehouse as the distribution warehouse and lock the warehouse inventory.

5. The computer processing method according to claim 3, characterized in that: The process of selecting a distribution warehouse from within the target area includes: When there are multiple warehouses supporting distribution at the current node, the warehouse with the highest priority is selected as the distribution warehouse according to the regional priority; When multiple warehouses have the same regional priority, the multiple warehouses are re-sorted using the sorting weights to select the best warehouse. The above ranking weight is calculated according to the following formula: Sorting weight = remaining order-taking capacity × capacity weight + inventory balance × inventory weight, The remaining order-accepting capacity of each of the multiple warehouses is calculated based on the daily maximum order quantity of the warehouse and the number of orders received on that day.

6. The computer processing method according to claim 5, characterized in that: The capacity weight is 0.5, and the inventory weight is 0.

5.

7. The computer processing method according to claim 3, characterized in that: The process of selecting a distribution warehouse from within the target area includes: When the inventory of the current warehouse does not meet the quantity of goods required by the order, it is assumed that the current warehouse will send all the remaining inventory to the buyer of the order, and the remaining quantity of goods will be shipped from other warehouses. Among them, the other warehouse is selected according to the principle of minimizing the number of packages shipped by the current warehouse and other warehouses in combination.

8. A computer-readable storage medium storing a computer program, wherein the computer program is executed by a processor to implement the method according to any one of claims 1 to 7.

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

10. A computer program product, comprising a computer program, which is used to implement the method according to any one of claims 1 to 7 when executed by a processor.

Citation Information

Patent Citations

  • Method and apparatus for quickly retrieving warehouse capable of performing delivery, and electronic device

    CN108388602A

  • Intelligent warehousing method, device and computer-readable storage medium

    CN109359759A

  • Method, device and system for determining delivered commodity

    CN110322180A

  • Order receiving method and system for automatic warehouse, electronic equipment and storage medium

    CN111144797A

  • Order source searching algorithm and system for DTC mode multi-warehouse delivery in retail industry

    CN116228372A

Cited By

  • Method and system for matching nearest warehouse and most economical express company based on receiving place

    CN119904164A