A method and device for processing order data
By updating the store's collection of items to be produced and the item relationship network list of items to be produced based on the order's delivery address and item details, determining the production method of orders, solving the problem of low production efficiency in the existing technology, and achieving cost reduction and efficiency improvement.
Patent Information
- Application Number
- CN202011240378.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2020-11-09
- Publication Date
- 2024-12-10
- Estimated Expiration
- 2040-11-09
AI Technical Summary
In the prior art, when orders are produced in stores or warehouses, the highest production efficiency cannot be achieved, resulting in an increase in distribution costs.
By updating the store's collection of items to be produced and the item relationship network list of the order based on the order's delivery address, the store's delivery area scope, the latest delivery time and item details, determining the production method of the order, and choosing the most suitable production method to improve efficiency .
It reduces the production and transportation costs of orders, improves production efficiency, maximizes production efficiency, and improves the operational efficiency of stores, avoiding the high operating costs brought about by large-scale store opening.
Smart Images

Figure CN113762850B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of warehousing logistics, and in particular to a method and device for processing order data. Background Art
[0002] At present, orders are generally produced by warehouses, then produced and packaged in warehouses, and finally shipped to the order address. With the increase in group orders (such as community group purchase orders, corporate group purchase orders, etc.), store production has emerged, which is based on store production, packaging and delivery.
[0003] In the process of implementing the present invention, the inventors found that there are at least the following problems in the prior art:
[0004] If all orders are produced in stores or warehouses, the highest production efficiency cannot be achieved and the delivery costs of the orders will increase. Summary of the invention
[0005] In view of this, an embodiment of the present invention provides a method and device for processing order data to solve the technical problem of failing to achieve the highest production efficiency.
[0006] To achieve the above objective, according to one aspect of an embodiment of the present invention, a method for processing order data is provided, comprising:
[0007] According to the delivery address of the order and the delivery area range corresponding to each store, the store whose delivery area range includes the delivery address is matched;
[0008] According to the latest delivery time and item details of the order, update the set of items to be produced in the store; wherein the item details include item number and item quantity;
[0009] According to the item details of the order, update the item relationship network list of the store;
[0010] The production method of the order is determined according to the latest delivery time of the order, item details, the set of items to be produced in the store, and the item relationship network list.
[0011] Optionally, updating the set of items to be produced in the store according to the latest delivery time and item details of the order includes:
[0012] Using the latest delivery time and item number of the order as a production index, determining whether the production index exists in the set of items to be produced in the store;
[0013] If yes, the quantity of the item corresponding to the item number is used as the value of the production index and updated to the set of items to be produced in the store;
[0014] If not, insert the production index into the set of items to be produced in the store, and set the value of the production index to the quantity of items corresponding to the item number.
[0015] Optionally, updating the item relationship network list of the store according to the item details of the order includes:
[0016] According to each item number of the order, determining whether there is an item relationship network in the item relationship network list of the store that includes each item number;
[0017] If yes, then update the item relationship network including the item numbers;
[0018] If not, inserting a new item relationship network into the item relationship network list of the store;
[0019] The item relationship network is in the form of a key-value pair, where the key is the item number and the value is the sum of the item quantities corresponding to the item number.
[0020] Optionally, determining the production method of the order according to the latest delivery time of the order, item details, the set of items to be produced in the store, and the item relationship network list includes:
[0021] Each production index in the set of items to be produced of the store is piled up based on the item number as a dimension, and the values corresponding to each production index in the pile are added up to obtain the quantity to be produced corresponding to each item number;
[0022] According to the to-be-produced quantity corresponding to each item and the item relationship network list of the store, updating the item relationship set to be considered of the store;
[0023] Extracting each item number from the item relationship set to be considered, calculating the sum of the item quantities of each item number in the item relationship set to be considered as the transfer quantity corresponding to each item number, and adding each item number and its corresponding transfer quantity to the transfer item set;
[0024] The production method of the order is determined according to the latest delivery time of the order, the item details and the set of allocated items.
[0025] Optionally, updating the set of item relationships to be considered of the store according to the to-be-produced quantity corresponding to each item and the item relationship network list of the store includes:
[0026] For each item number, determine whether the quantity to be produced corresponding to the item number is greater than or equal to the threshold of the quantity to be allocated for the first time; if so, add the item number to the list of items to be allocated for the first time;
[0027] The item relationship network list of the store is traversed in a loop, and if there is an item relationship network in which all items are in the initial list of items to be transferred, the item relationship network is added to the item relationship set to be considered.
[0028] Optionally, updating the set of item relationships to be considered of the store according to the to-be-produced quantity corresponding to each item and the item relationship network list of the store further includes:
[0029] If there is an item relationship network in which only some items are in the initial list of items to be allocated, then extract the item numbers that are not in the initial list of items to be allocated from the item relationship network, and determine whether the quantities to be produced corresponding to the item numbers that are not in the initial list of items to be allocated are all greater than or equal to the secondary quantity threshold to be allocated; wherein the secondary quantity threshold to be allocated is greater than the initial quantity threshold to be allocated;
[0030] If so, the item relationship network is added to the item relationship set to be considered.
[0031] Optionally, before extracting each item number from the item relationship set to be considered, the method further includes:
[0032] Extracting each item number from the item relationship set to be considered, and calculating the sum of the item quantities of each item number in the item relationship set to be considered as the transfer quantity corresponding to each item number;
[0033] Item numbers whose transfer quantities are less than a secondary transfer quantity threshold and item relationship networks containing the item numbers are deleted from the item relationship set to be considered, thereby updating the item relationship set to be considered.
[0034] Optionally, determining the production mode of the order according to the latest delivery time of the order, item details and the set of transferred items includes:
[0035] Add the current time to the estimated transfer duration to get the latest transfer time;
[0036] Determine whether the latest transfer time is greater than or equal to the latest delivery time of the order;
[0037] If so, it is determined that the production method of the order is warehouse production;
[0038] If not, continue to determine whether each item number of the order is in the set of transferred items and whether the item quantity corresponding to each item number is less than or equal to the transfer quantity corresponding to each item number in the set of transferred items;
[0039] If yes, determine that the production mode of the order is store production, and update the transfer item set;
[0040] If not, it is determined that the production method of the order is warehouse production.
[0041] In addition, according to another aspect of an embodiment of the present invention, there is provided a device for processing order data, comprising:
[0042] A determination module, for matching stores whose delivery areas include the delivery address according to the delivery address of the order and the delivery area ranges corresponding to each store;
[0043] The module to be produced updates the set of items to be produced in the store according to the latest delivery time and item details of the order; wherein the item details include item number and item quantity;
[0044] A relationship module, used to update the item relationship network list of the store according to the item details of the order;
[0045] The production module is used to determine the production method of the order according to the latest delivery time of the order, the item details, the set of items to be produced in the store and the item relationship network list.
[0046] Optionally, the module to be produced is also used for:
[0047] Using the latest delivery time and item number of the order as a production index, determining whether the production index exists in the set of items to be produced in the store;
[0048] If yes, the quantity of the item corresponding to the item number is used as the value of the production index and updated to the set of items to be produced in the store;
[0049] If not, insert the production index into the set of items to be produced in the store, and set the value of the production index to the quantity of items corresponding to the item number.
[0050] Optionally, the relationship module is further used for:
[0051] According to each item number of the order, determining whether there is an item relationship network in the item relationship network list of the store that includes each item number;
[0052] If yes, then update the item relationship network including the item numbers;
[0053] If not, inserting a new item relationship network into the item relationship network list of the store;
[0054] The item relationship network is in the form of a key-value pair, where the key is the item number and the value is the sum of the item quantities corresponding to the item number.
[0055] Optionally, the production module is further used for:
[0056] Each production index in the set of items to be produced of the store is piled up based on the item number as a dimension, and the values corresponding to each production index in the pile are added up to obtain the quantity to be produced corresponding to each item number;
[0057] According to the to-be-produced quantity corresponding to each item and the item relationship network list of the store, updating the item relationship set to be considered of the store;
[0058] Extracting each item number from the item relationship set to be considered, calculating the sum of the item quantities of each item number in the item relationship set to be considered as the transfer quantity corresponding to each item number, and adding each item number and its corresponding transfer quantity to the transfer item set;
[0059] The production method of the order is determined according to the latest delivery time of the order, the item details and the set of allocated items.
[0060] Optionally, the production module is further used for:
[0061] For each item number, determine whether the quantity to be produced corresponding to the item number is greater than or equal to the threshold of the quantity to be allocated for the first time; if so, add the item number to the list of items to be allocated for the first time;
[0062] The item relationship network list of the store is traversed in a loop, and if there is an item relationship network in which all items are in the initial list of items to be transferred, the item relationship network is added to the item relationship set to be considered.
[0063] Optionally, the production module is further used for:
[0064] If there is an item relationship network in which only some items are in the initial list of items to be allocated, then extract the item numbers that are not in the initial list of items to be allocated from the item relationship network, and determine whether the quantities to be produced corresponding to the item numbers that are not in the initial list of items to be allocated are all greater than or equal to the secondary quantity threshold to be allocated; wherein the secondary quantity threshold to be allocated is greater than the initial quantity threshold to be allocated;
[0065] If so, the item relationship network is added to the item relationship set to be considered.
[0066] Optionally, the production module is further used for:
[0067] Extracting each item number from the item relationship set to be considered, and calculating the sum of the item quantities of each item number in the item relationship set to be considered as the transfer quantity corresponding to each item number;
[0068] Item numbers whose transfer quantities are less than a secondary transfer quantity threshold and item relationship networks containing the item numbers are deleted from the item relationship set to be considered, thereby updating the item relationship set to be considered.
[0069] Optionally, the production module is further used for:
[0070] Add the current time to the estimated transfer duration to get the latest transfer time;
[0071] Determine whether the latest transfer time is greater than or equal to the latest delivery time of the order;
[0072] If so, it is determined that the production method of the order is warehouse production;
[0073] If not, continue to determine whether each item number of the order is in the set of transferred items and whether the item quantity corresponding to each item number is less than or equal to the transfer quantity corresponding to each item number in the set of transferred items;
[0074] If yes, determine that the production mode of the order is store production, and update the transfer item set;
[0075] If not, it is determined that the production method of the order is warehouse production.
[0076] According to another aspect of an embodiment of the present invention, there is further provided an electronic device, including:
[0077] one or more processors;
[0078] a storage device for storing one or more programs,
[0079] When the one or more programs are executed by the one or more processors, the one or more processors implement the method described in any one of the above embodiments.
[0080] According to another aspect of an embodiment of the present invention, a computer-readable medium is provided, on which a computer program is stored. When the program is executed by a processor, the method described in any one of the above embodiments is implemented.
[0081] One embodiment of the above invention has the following advantages or beneficial effects: because the technical means of determining the production mode of the order by updating the store's set of items to be produced and the item relationship network list according to the latest delivery time and item details of the order is adopted, the technical problem of the inability to achieve the highest production efficiency in the prior art is overcome. The embodiment of the present invention determines the production mode of the order through the latest delivery time, item details, the store's set of items to be produced and the item relationship network list of the order, which not only reduces the production and transportation costs of the order, but also improves the production efficiency of the order, so that the production efficiency is maximized; and the embodiment of the present invention can also improve the operating efficiency of the store, avoiding high operating costs caused by large-scale store openings.
[0082] The further effects of the above-mentioned non-conventional optional manner will be described below in conjunction with the specific implementation manner. BRIEF DESCRIPTION OF THE DRAWINGS
[0083] The accompanying drawings are used to better understand the present invention and do not constitute an improper limitation of the present invention.
[0084] Figure 1 is a schematic diagram of the main flow of a method for processing order data according to an embodiment of the present invention;
[0085] Figure 2 is a schematic diagram of the main flow of a method for processing order data according to a reference embodiment of the present invention;
[0086] Figure 3 is a schematic diagram of the main flow of a method for processing order data according to another reference embodiment of the present invention;
[0087] Figure 4 is a schematic diagram of the main flow of a method for processing order data according to yet another reference embodiment of the present invention;
[0088] Figure 5 is a schematic diagram of main modules of an apparatus for processing order data according to an embodiment of the present invention;
[0089] Figure 6 is an exemplary system architecture diagram to which embodiments of the present invention may be applied;
[0090] Figure 7 It is a schematic diagram of the structure of a computer system of a terminal device or a server suitable for implementing an embodiment of the present invention. DETAILED DESCRIPTION
[0091] The following is a description of exemplary embodiments of the present invention in conjunction with the accompanying drawings, including various details of the embodiments of the present invention to facilitate understanding, which should be considered as merely exemplary. Therefore, it should be recognized by those of ordinary skill in the art that various changes and modifications may be made to the embodiments described herein without departing from the scope and spirit of the present invention. Similarly, for clarity and conciseness, the description of well-known functions and structures is omitted in the following description.
[0092] Figure 1 Schematic diagram of the main process of the method for processing order data according to an embodiment of the present invention. As an embodiment of the present invention, Figure 1 As shown, the method for processing order data may include:
[0093] Step 101, according to the delivery address of the order and the delivery area range corresponding to each store, match the store whose delivery area range includes the delivery address.
[0094] In an embodiment of the present invention, the order may be a group order (such as a community group purchase order, an enterprise group purchase order, etc.) or an individual order. Specifically, whether the order is a group order may be determined based on a group order identifier, which may be a field in the order information or a digit in a long numeric text in the order information.
[0095] Optionally, step 101 may include: matching at least one store whose distribution area includes the delivery address on the map according to the delivery address of the order and the distribution area corresponding to each store. In an embodiment of the present invention, the delivery address of the order is obtained, and the corresponding store information point (POI) is matched on the map according to the delivery address of the order. Each store POI corresponds to a certain distribution area, and the order with the delivery address within the distribution area of the store can be matched to the store. It should be pointed out that there may be a situation where two or more stores are matched for one order. Regardless of the number of stores matched by the order, all the matched store numbers are generated into a store number string. If multiple stores are matched, the store numbers are separated by commas. An example of a single store number string: 123; an example of multiple store number strings: 123, 1326. Finally, the generated store number string is updated to the store number field of the order table. Optionally, the store can be a community store, a community service station, etc., which is not limited in the embodiment of the present invention.
[0096] Step 102: Update the set of items to be produced in the store according to the latest delivery time and item details of the order, wherein the item details include item numbers and item quantities.
[0097] The latest delivery time and item details of the order may be obtained from the order information, and then the set of items to be produced of the store may be updated according to the latest delivery time and item details of the order.
[0098] Optionally, updating the store's set of items to be produced based on the latest delivery time and item details of the order may include: using the latest delivery time and item number of the order as a production index to determine whether the production index exists in the store's set of items to be produced; if so, using the number of items corresponding to the item number as the value of the production index to update the store's set of items to be produced; if not, inserting the production index into the store's set of items to be produced, and setting the value of the production index to the number of items corresponding to the item number. The embodiment of the present invention uses the combination of the latest delivery time of the order and the item number as a production index to check whether the production index exists in the set of items to be produced.
[0099] Specifically, taking an item number in an order as an example, the following steps may be included:
[0100] First, the latest delivery time of an order and the item number are used as the production index;
[0101] Then, the set of items to be produced in the store is traversed to determine whether the production index exists in the set of items to be produced in the store; if so, the value of the production index is updated, and the value of the updated production index is equal to the value of the production index before the update plus the number of items corresponding to the item number; if not, the production index and its corresponding value are inserted into the set of items to be produced in the store, and the value of the production index is the number of items corresponding to the item number.
[0102] Step 103: update the item relationship network list of the store according to the item details of the order.
[0103] The item details of the order can be obtained from the order information, and then the item relationship network list of the store can be updated according to the item details of the order. The item relationship network is an item relationship between items belonging to the same order, mainly to ensure that the items of the same order are produced in the warehouse or in the same store during subsequent calculations. The item relationship network table stores the store numbers and the item relationship network lists corresponding to each store. There is an item relationship network list for each store. The item relationship network list contains various item relationships. The item relationship is in key-value form, where the key is the item number and the value is the number of items corresponding to the item number. For example, [{skuA:2,skuB:4},{skuB:2,skuD:4}] is the item relationship network list of the store, {skuA:2,skuB:4} is the item relationship network, skuA is the item number, and 2 is the corresponding number of items.
[0104] Optionally, updating the item relationship network list of the store according to the item details of the order may include: judging whether there is an item relationship network containing each item number in the item relationship network list of the store according to each item number of the order; if so, updating the item relationship network containing each item number; if not, inserting a new item relationship network into the item relationship network list of the store; wherein the item relationship network is in the form of a key-value pair, the key is the item number, and the value is the sum of the item quantities corresponding to the item number. Specifically, taking a certain order as an example, the following steps may be included:
[0105] First, get all the item numbers under the order.
[0106] Then, determining whether there is an item relationship network in the item relationship network list of the store that includes all the item numbers;
[0107] If it exists, the existing item relationship network is updated, and the quantity of items corresponding to each item number after the update is the quantity corresponding to each item number before the update plus the quantity of items corresponding to each item number under the order. For example, the item relationship network list before the update is [{skuA:1,skuB:1},{skuB:2,skuD:4}], and {skuA:2,skuB:4} needs to be added, then the updated item relationship network list is [{skuA:3,skuB:5},{skuB:2,skuD:4}].
[0108] If it does not exist, a new item relationship network is inserted into the item relationship network list of the store. In the item relationship network, the item quantity corresponding to each item number is the item quantity corresponding to each item number under the order. For example, the item relationship network list is [{skuB:2,skuD:4}] before update, and a new item relationship network {skuA:2,skuB:4} needs to be inserted. Then the updated item relationship network list is [{skuA:2,skuB:4},{skuB:2,skuD:4}].
[0109] Step 104 , determining the production method of the order according to the latest delivery time of the order, item details, the set of items to be produced in the store, and the item relationship network list.
[0110] After calculating the store's set of items to be produced and the item relationship network list, the production method of the order is determined in combination with the latest delivery time and item details, such as store production or warehouse production.
[0111] Optionally, step 104 may include: grouping each production index in the set of items to be produced of the store based on the item number as a dimension, adding the values corresponding to each production index in the group to obtain the quantity to be produced corresponding to each item number; updating the set of item relationships to be considered of the store according to the quantity to be produced corresponding to each item and the item relationship network list of the store; extracting each item number from the set of item relationships to be considered, calculating the sum of the quantity of items of each item number in the set of item relationships to be considered as the allocation quantity corresponding to each item number, and adding each item number and its corresponding allocation quantity to the allocation item set; determining the production method of the order according to the latest delivery time of the order, the item details and the set of allocated items.
[0112] After all orders are processed according to steps 101 to 103, the store numbers are obtained to form a store number list, and the store number list is looped to calculate the items to be transferred and the number of items to be transferred. Specifically, for each store number, all item numbers in the set of items to be produced of the store are obtained and deduplicated to obtain an item number list; then the item number list is looped to pile up each production index and its corresponding value in the set of items to be produced of the store based on the item number as the dimension, and the values corresponding to each production index in the pile are added to obtain the number of items to be produced corresponding to each item number, which is saved in the cache.
[0113] Optionally, the item relationship set to be considered of the store is updated according to the to-be-produced quantity corresponding to each item and the item relationship network list of the store, including: for each item number, determining whether the to-be-produced quantity corresponding to the item number is greater than or equal to a threshold value of the quantity to be initially allocated; if so, adding the item number to the initial list of items to be allocated; looping through the item relationship network list of the store, and if there is an item relationship network in which all items are in the initial list of items to be allocated, adding the item relationship network to the item relationship set to be considered. Optionally, updating the item relationship set to be considered of the store according to the to-be-produced quantity corresponding to each item and the item relationship network list of the store also includes: if there is an item relationship network in which only some items are in the initial list of items to be allocated, extracting item numbers that are not in the initial list of items to be allocated from the item relationship network, and judging whether the to-be-produced quantities corresponding to each item number that is not in the initial list of items to be allocated are all greater than or equal to a secondary to-be-allocated quantity threshold; wherein the secondary to-be-allocated quantity threshold is greater than the initial to-be-allocated quantity threshold; if so, adding the item relationship network to the item relationship set to be considered.
[0114] In the embodiment of the present invention, for each item number, it is determined whether the quantity to be produced corresponding to the item number is greater than or equal to the threshold of the quantity to be initially allocated; if so, it means that the warehouse can be considered to allocate the item to the store for unified distribution, so the item number is added to the list of items to be initially allocated. Then, the item relationship network list of the store is obtained, the item relationship network list of the store is looped through, and the item relationship set to be considered is calculated:
[0115] a) If all items in the looped item relationship network are in the initial list of items to be allocated, the item relationship network is added to the item relationship set to be considered. Since there may be multiple item relationship networks containing a certain item, one item relationship network meets the conditions, but other item relationship networks may not meet the conditions. In order to avoid the inability of stores to produce items in other item relationship networks, which ultimately leads to the inability of stores to produce the item, the item relationship network with all items in the initial list of items to be allocated is added to the item relationship set to be considered.
[0116] b) If all items in the looped item relationship network are not in the initial list of items to be transferred, no update is performed and the judgment of the next item relationship network in the item relationship network list is continued.
[0117] c) If only some of the items in the looped item relationship network are in the initial list of items to be allocated, extract the item numbers that are not in the initial list of items to be allocated and determine whether the to-be-produced quantities of each item number that is not in the initial list of items to be allocated are all greater than or equal to the secondary to-be-allocated quantity threshold; if the to-be-produced quantities of each item number that is not in the initial list of items to be allocated are all greater than or equal to the secondary to-be-allocated quantity threshold, add the item relationship network that meets the conditions to the item relationship set to be considered; if the to-be-produced quantities of each item number that is not in the initial list of items to be allocated are not all greater than or equal to the secondary to-be-allocated quantity threshold, no processing is performed.
[0118] It should be pointed out that the quantity to be produced refers to the quantity to be produced corresponding to the item number in the set of items to be produced in the store, rather than the number of items corresponding to the item number in the item relationship network that is cycled. Because the quantity of the item in all item relationship networks must be considered as a whole, such as the item relationship network {a:1,b:5}{b:6,c:3},{b:2,d:2}, if the cycle reaches {a:1,b:5} and only the quantity of item b itself is 5, it may not reach the threshold of the second quantity to be allocated, but the sum of the quantity of item b in all item relationship networks (i.e., the quantity to be produced) can reach the threshold of the second quantity to be allocated. Of course, it is necessary to verify once more at the end, and it is necessary to verify whether the sum of the quantity of each item in the item relationship set to be considered really reaches the threshold of the second quantity to be allocated, because other items in some item relationship networks containing item b may not reach the threshold of the second quantity to be allocated, resulting in the inability of the items in these item relationship networks to be produced through the store. For example, the quantity of item c cannot reach the threshold of the second quantity to be allocated, so {b:6,c:3} cannot be produced in the store, which indirectly causes item b to be unable to be produced in the store.
[0119] It should be noted that the threshold of the quantity to be allocated for the first time and the threshold of the quantity to be allocated for the second time are set manually, or they can be reasonable thresholds obtained based on big data statistics. The threshold of the quantity to be allocated for the first time and the threshold of the quantity to be allocated for the second time can be a unified threshold for all items in all stores, or a threshold for all items in a certain store, or a threshold for a certain item in all stores, or a threshold for a certain item in a certain store.
[0120] In the embodiment of the present invention, the reason why the initial quantity threshold to be allocated and the secondary quantity threshold to be allocated are distinguished is that the initial quantity threshold to be allocated is mainly to facilitate the cost of allocating items to stores for distribution is less than the cost of packaging and distribution from the warehouse, and the secondary quantity threshold to be allocated is mainly to meet the order to produce in one package as much as possible, avoiding splitting the order into part store production and part warehouse production. Generally, the secondary quantity threshold to be allocated is greater than the initial quantity threshold to be allocated.
[0121] Optionally, before extracting each item number from the item relationship set to be considered, the process further includes: extracting each item number from the item relationship set to be considered, calculating the sum of the item quantities of each item number in the item relationship set to be considered as the transfer quantity corresponding to each item number; deleting the item numbers whose transfer quantities are less than the secondary transfer quantity threshold and the item relationship network containing the item numbers from the item relationship set to be considered, thereby updating the item relationship set to be considered. Specifically, the process of calculating the transfer items and their transfer quantities and generating the transfer item set may include the following steps:
[0122] 1) Extracting each item number from the item relationship set to be considered, and for each item number, calculating the sum of the number of the item number in the item relationship set to be considered as the allocation quantity of the item; judging whether the allocation quantity of the item is greater than or equal to the secondary allocation quantity threshold; if not, it means that the item cannot be produced in the store at present, deleting the item relationship network containing the item from the item relationship set to be considered, and updating the item relationship set to be considered;
[0123] 2) Next, extract each item number from the updated set of item relationships to be considered, and for each item number, calculate the sum of the number of the item number in the set of item relationships to be considered as the allocation quantity of the item; then add the item number and its corresponding allocation quantity to the allocation item set;
[0124] 3) Update the transfer item set based on the existing inventory, including:
[0125] 3a) Obtain the region code according to the store code, and call the inventory interface to obtain the spot inventory quantity of all item numbers in the transfer item set under the region code;
[0126] 3b) Determine in turn whether the transfer quantity of the item number is less than or equal to the spot inventory quantity; if so, it means that the transfer demand of the item number can be fully met and no processing is performed; if not, it means that the transfer demand of the item number cannot be fully met, and the transfer quantity of the item number in the transfer item set is updated to the spot inventory quantity.
[0127] 4) Determine whether the set of items to be transferred is not empty. If so, send the store number and the set of items to be transferred to the transfer system so that the transfer system transfers the items to the store.
[0128] Optionally, determining the production mode of the order according to the latest delivery time of the order, item details and the set of transferred items includes:
[0129] Add the current time to the estimated transfer duration to get the latest transfer time;
[0130] Determine whether the latest transfer time is greater than or equal to the latest delivery time of the order;
[0131] If so, it is determined that the production method of the order is warehouse production;
[0132] If not, continue to determine whether each item number of the order is in the set of transferred items and whether the item quantity corresponding to each item number is less than or equal to the transfer quantity corresponding to each item number in the set of transferred items;
[0133] If yes, determine that the production mode of the order is store production, and update the transfer item set;
[0134] If not, it is determined that the production method of the order is warehouse production.
[0135] After the set of transferred items is determined, the final production method of the order can be determined based on the latest delivery time of the order, the item details and the set of transferred items. If it can be produced in the store, the store number is obtained. If it cannot be produced in the store, it is produced in the warehouse. Specifically, all order information containing the store number is obtained, and each order is sorted in ascending order according to the latest delivery time, and then an order list is formed. The order list is looped, and for each order, the following steps are performed:
[0136] 1) Obtaining an estimated transfer time, where the estimated transfer time refers to the longest time among the estimated times required to deliver each item in the order from the warehouse to the store.
[0137] 2) Determine whether the current system time plus the estimated transfer time is greater than or equal to the latest delivery time of the order.
[0138] If yes, it means that the order cannot continue to wait for production in the store and needs to be immediately located in the warehouse for production, so the group identifier of the order is erased so that the order can be processed as a normal order in the next round of processing, located in the warehouse for production, and the collection of items to be produced in the store and the list of item relationship network are updated at the same time. Warehouse production means that it does not need to be delivered to the store, and follows the logic of normal orders. The large warehouse produces the package, the package is delivered to the distribution station, and the delivery staff delivers it.
[0139] If not, continue to determine whether each item number in the item details of the order is in the transfer item set.
[0140] 3) If all item numbers in the item details of the order are in the transfer item set and the quantity of items under each item number under the order is less than or equal to the transfer quantity corresponding to each item number in the transfer item set, it means that the order can be produced in the store (the warehouse will uniformly deliver all items to the community store, and the community store will package and deliver them, saving various warehouse costs), and the following logic is performed:
[0141] The production of the order is located at the store number, and the order is sent to the store operation end for production; then the allocation quantity of each item number in the allocation item set is updated, that is, the allocation quantity corresponding to each item number in the allocation item set is subtracted from the item quantity corresponding to the item number under the order. At the same time, the store's to-be-produced item set and the item relationship network list also need to be updated.
[0142] Obtain all store numbers in the store number field of the order, and then loop through the store numbers. For each store number, update the logic of the set of items to be produced and the item relationship network list of the store, including the following steps:
[0143] 1) Obtain the set of items to be produced in the store, and update the production index consisting of the latest delivery time and the item number and its corresponding value in the set of items to be produced in the store, wherein the updated value is the value before the update minus the number of items corresponding to the item number under the order. If the updated value is 0, delete the production index and its corresponding value in the set of items to be produced.
[0144] 2) Obtain the item relationship network list of the store, and update the item relationship network that is completely consistent with the item number under the order in the item relationship network list of the store, and the number of items corresponding to each item number in the updated item relationship network is the number of items corresponding to each item number before the update minus the number of items corresponding to the item number under the order. If the number of items corresponding to each item number in the updated item relationship network is 0, delete the item relationship network from the item relationship network list.
[0145] It should be pointed out that no matter whether there are multiple store numbers in the store number field of the order, since the order is no longer waiting for production at the store, the relevant information of the order in all related stores needs to be deleted.
[0146] According to the various embodiments described above, it can be seen that the embodiment of the present invention solves the technical problem that the prior art cannot achieve the highest production efficiency by updating the store's set of items to be produced and the item relationship network list according to the latest delivery time and item details of the order, thereby determining the production method of the order. The embodiment of the present invention determines the production method of the order through the latest delivery time, item details, the store's set of items to be produced, and the item relationship network list of the order, which not only reduces the production and transportation costs of the order, but also improves the production efficiency of the order, so that the production efficiency is maximized; and the embodiment of the present invention can also improve the operating efficiency of the store, avoiding high operating costs caused by large-scale store openings.
[0147] Figure 2 Schematic diagram of the main process of a method for processing order data according to a reference embodiment of the present invention. As another embodiment of the present invention, Figure 2 As shown, step 102 in the above embodiment may include the following steps:
[0148] Step 201, obtaining the latest delivery time and item details of the order, wherein the item details include the item number and the item quantity.
[0149] Step 202: Generate a storage address of the set of items to be produced in the store according to the store number. A unique identifier can be generated by adding a specific prefix to the store number. For example, if the store number is "1232", add a specific prefix "sqd_", and the storage address of the set of items to be produced in the store is "sqd_1232".
[0150] Step 203, obtaining the text of the set of items to be produced of the store from Redis (a storage server with a dictionary structure and higher access efficiency) according to the storage address of the set of items to be produced of the store.
[0151] Step 204: If there is a corresponding record in Redis, the acquired set of items to be produced of the store is converted into the set of items to be produced required for calculation. If there is no corresponding record in Redis, a new set of items to be produced of the store is created.
[0152] Step 205: update the set of items to be produced in the store according to the latest delivery time and item details of the order.
[0153] Optionally, step 205 may include: using the latest delivery time and item number of the order as a production index, determining whether the production index exists in the set of items to be produced of the store; if so, using the number of items corresponding to the item number as the value of the production index, and updating it to the set of items to be produced of the store; if not, inserting the production index into the set of items to be produced of the store, and setting the value of the production index to the number of items corresponding to the item number. In this embodiment of the present invention, the combination of the latest delivery time of the order and the item number is used as the production index to check whether the production index exists in the set of items to be produced.
[0154] Step 206: Save the updated set of items to be produced of the store to the corresponding storage address in Redis.
[0155] In addition, the specific implementation content of the method for processing order data in a reference embodiment of the present invention has been described in detail in the method for processing order data described above, so the repeated content will not be described here.
[0156] Figure 3 Schematic diagram of the main process of a method for processing order data according to another reference embodiment of the present invention. As another embodiment of the present invention, Figure 3 As shown, step 103 in the above embodiment may include the following steps:
[0157] Step 301, obtaining item details of the order, wherein the item details include item number and item quantity;
[0158] Step 302: Generate a storage address of the item relationship network list of the store according to the store number. A unique identifier can be generated by adding a specific prefix to the store number. For example, if the store number is "1232", add a specific prefix "spgx_", and the storage address of the item relationship network list of the store is "spgx_1232".
[0159] Step 303: Obtain the text of the store's item relationship network list from Redis according to the storage address of the store's item relationship network list.
[0160] Step 304: If there is a corresponding record in Redis, the obtained text of the item relationship network list of the store is converted into the item relationship network list required for calculation. If there is no corresponding record in Redis, a new item relationship network list of the store is created.
[0161] Step 305: Update the item relationship network list of the store according to the item details of the order.
[0162] Optionally, step 305 may include: judging, based on the item numbers of the order, whether there is an item relationship network containing the item numbers in the item relationship network list of the store; if so, updating the item relationship network containing the item numbers; if not, inserting a new item relationship network into the item relationship network list of the store; wherein the item relationship network is in the form of a key-value pair, the key being the item number, and the value being the sum of the item quantities corresponding to the item number.
[0163] Step 306: Save the updated item relationship network list of the store to the corresponding storage address in Redis.
[0164] In addition, the specific implementation content of the method for processing order data in another reference embodiment of the present invention has been described in detail in the method for processing order data described above, so the repeated content will not be described here.
[0165] Figure 4 Schematic diagram of the main flow of a method for processing order data according to another reference embodiment of the present invention. As another embodiment of the present invention, Figure 4 As shown, the method for processing order data may include:
[0166] Step 401, according to the delivery address of the order and the delivery area range corresponding to each store, at least one store whose delivery area range includes the delivery address is matched on the map.
[0167] In an embodiment of the present invention, the delivery address of the order is obtained, and the corresponding store POI is matched on the map according to the delivery address of the order. Each store POI corresponds to a certain delivery area range, and orders with a delivery address within the delivery area of the store can be matched to the store. There may be a situation where two or more stores are matched for one order. Regardless of the number of stores matched by the order, all the matched store numbers are used to generate a store number string.
[0168] Step 402: update the set of items to be produced in the store according to the latest delivery time and item details of the order.
[0169] Taking an item number in an order as an example, the following steps can be included:
[0170] First, the latest delivery time of an order and the item number are used as the production index;
[0171] Then, the set of items to be produced in the store is traversed to determine whether the production index exists in the set of items to be produced in the store; if so, the value of the production index is updated, and the value of the updated production index is equal to the value of the production index before the update plus the number of items corresponding to the item number; if not, the production index and its corresponding value are inserted into the set of items to be produced in the store, and the value of the production index is the number of items corresponding to the item number.
[0172] Step 403: update the item relationship network list of the store according to the item details of the order.
[0173] Specifically, taking a certain order as an example, the following steps may be included:
[0174] First, get all the item numbers under the order.
[0175] Then, determining whether there is an item relationship network in the item relationship network list of the store that includes all the item numbers;
[0176] If it exists, the existing item relationship network is updated, and the quantity of items corresponding to each item number after the update is the quantity corresponding to each item number before the update plus the quantity of items corresponding to each item number under the order. If it does not exist, a new item relationship network is inserted into the item relationship network list of the store, and in the item relationship network, the quantity of items corresponding to each item number is the quantity of items corresponding to each item number under the order.
[0177] Step 404: stack each production index in the set of items to be produced of the store based on the item number as a dimension, and add the values corresponding to each production index in the stack to obtain the quantity to be produced corresponding to each item number.
[0178] For each store number, obtain all item numbers in the set of items to be produced of the store and remove duplicates to obtain a list of item numbers; then loop through the list of item numbers, and stack each production index and its corresponding value in the set of items to be produced of the store based on the item number as the dimension, and add up the values corresponding to each production index in the stack to obtain the quantity to be produced corresponding to each item number.
[0179] Step 405: update the set of item relationships to be considered of the store according to the to-be-produced quantity corresponding to each item and the item relationship network list of the store.
[0180] For each item number, determine whether the quantity to be produced corresponding to the item number is greater than or equal to the threshold of the quantity to be initially allocated; if so, add the item number to the list of items to be initially allocated; loop through the item relationship network list of the store, and if there is an item relationship network in which all items are in the list of items to be initially allocated, add the item relationship network to the set of item relationships to be considered.
[0181] If there is an item relationship network in which only some items are in the initial list of items to be allocated, then the item numbers that are not in the initial list of items to be allocated are extracted from the item relationship network, and it is determined whether the quantities to be produced corresponding to the item numbers that are not in the initial list of items to be allocated are all greater than or equal to a secondary quantity threshold to be allocated; wherein the secondary quantity threshold to be allocated is greater than the initial quantity threshold to be allocated; if so, the item relationship network is added to the item relationship set to be considered.
[0182] Step 406: extract each item number from the item relationship set to be considered, calculate the sum of the item quantities of each item number in the item relationship set to be considered, and use it as the transfer quantity corresponding to each item number; delete the item numbers whose transfer quantities are less than the secondary transfer quantity threshold and the item relationship network containing the item numbers from the item relationship set to be considered, thereby updating the item relationship set to be considered.
[0183] Step 407: extract each item number from the updated item relationship set to be considered, calculate the sum of the item quantities of each item number in the item relationship set to be considered as the transfer quantity corresponding to each item number, and add each item number and its corresponding transfer quantity to the transfer item set.
[0184] Step 408, determining the production method of the order according to the latest delivery time of the order, the item details and the set of transferred items.
[0185] In addition, the specific implementation content of the method for processing order data in another reference embodiment of the present invention has been described in detail in the method for processing order data described above, so the repeated content will not be described here.
[0186] Figure 5 is a schematic diagram of main modules of an apparatus for processing order data according to an embodiment of the present invention, such as Figure 5As shown, the device 500 for processing order data includes a determination module 501, a module to be produced 502, a relationship module 503 and a production module 504; the determination module 501 is used to match the store whose distribution area range includes the delivery address according to the delivery address of the order and the distribution area range corresponding to each store; the module to be produced 502 updates the set of items to be produced of the store according to the latest delivery time and item details of the order; wherein the item details include item number and item quantity; the relationship module 503 is used to update the item relationship network list of the store according to the item details of the order; the production module 504 is used to determine the production method of the order according to the latest delivery time and item details of the order, the set of items to be produced of the store and the item relationship network list.
[0187] Optionally, the to-be-produced module 502 is further used for:
[0188] Using the latest delivery time and item number of the order as a production index, determining whether the production index exists in the set of items to be produced in the store;
[0189] If yes, the quantity of the item corresponding to the item number is used as the value of the production index and updated to the set of items to be produced in the store;
[0190] If not, insert the production index into the set of items to be produced in the store, and set the value of the production index to the quantity of items corresponding to the item number.
[0191] Optionally, the relationship module 503 is further used for:
[0192] According to each item number of the order, determining whether there is an item relationship network in the item relationship network list of the store that includes each item number;
[0193] If yes, then update the item relationship network including the item numbers;
[0194] If not, inserting a new item relationship network into the item relationship network list of the store;
[0195] The item relationship network is in the form of a key-value pair, where the key is the item number and the value is the sum of the item quantities corresponding to the item number.
[0196] Optionally, the production module 504 is further used for:
[0197] Each production index in the set of items to be produced of the store is piled up based on the item number as a dimension, and the values corresponding to each production index in the pile are added up to obtain the quantity to be produced corresponding to each item number;
[0198] According to the to-be-produced quantity corresponding to each item and the item relationship network list of the store, updating the item relationship set to be considered of the store;
[0199] Extracting each item number from the item relationship set to be considered, calculating the sum of the item quantities of each item number in the item relationship set to be considered as the transfer quantity corresponding to each item number, and adding each item number and its corresponding transfer quantity to the transfer item set;
[0200] The production method of the order is determined according to the latest delivery time of the order, the item details and the set of allocated items.
[0201] Optionally, the production module 504 is further used for:
[0202] For each item number, determine whether the quantity to be produced corresponding to the item number is greater than or equal to the threshold of the quantity to be allocated for the first time; if so, add the item number to the list of items to be allocated for the first time;
[0203] The item relationship network list of the store is traversed in a loop, and if there is an item relationship network in which all items are in the initial list of items to be transferred, the item relationship network is added to the item relationship set to be considered.
[0204] Optionally, the production module 504 is further used for:
[0205] If there is an item relationship network in which only some items are in the initial list of items to be allocated, then extract the item numbers that are not in the initial list of items to be allocated from the item relationship network, and determine whether the quantities to be produced corresponding to the item numbers that are not in the initial list of items to be allocated are all greater than or equal to the secondary quantity threshold to be allocated; wherein the secondary quantity threshold to be allocated is greater than the initial quantity threshold to be allocated;
[0206] If so, the item relationship network is added to the item relationship set to be considered.
[0207] Optionally, the production module 504 is further used for:
[0208] Extracting each item number from the item relationship set to be considered, and calculating the sum of the item quantities of each item number in the item relationship set to be considered as the transfer quantity corresponding to each item number;
[0209] Item numbers whose transfer quantities are less than a secondary transfer quantity threshold and item relationship networks containing the item numbers are deleted from the item relationship set to be considered, thereby updating the item relationship set to be considered.
[0210] Optionally, the production module 504 is further used for:
[0211] Add the current time to the estimated transfer duration to get the latest transfer time;
[0212] Determine whether the latest transfer time is greater than or equal to the latest delivery time of the order;
[0213] If so, it is determined that the production method of the order is warehouse production;
[0214] If not, continue to determine whether each item number of the order is in the set of transferred items and whether the item quantity corresponding to each item number is less than or equal to the transfer quantity corresponding to each item number in the set of transferred items;
[0215] If yes, determine that the production mode of the order is store production, and update the transfer item set;
[0216] If not, it is determined that the production method of the order is warehouse production.
[0217] According to the various embodiments described above, it can be seen that the embodiment of the present invention solves the technical problem that the prior art cannot achieve the highest production efficiency by updating the store's set of items to be produced and the item relationship network list according to the latest delivery time and item details of the order, thereby determining the production method of the order. The embodiment of the present invention determines the production method of the order through the latest delivery time, item details, the store's set of items to be produced, and the item relationship network list of the order, which not only reduces the production and transportation costs of the order, but also improves the production efficiency of the order, so that the production efficiency is maximized; and the embodiment of the present invention can also improve the operating efficiency of the store, avoiding high operating costs caused by large-scale store openings.
[0218] It should be noted that the specific implementation content of the device for processing order data in the present invention has been described in detail in the method for processing order data described above, so the repeated content will not be described again here.
[0219] Figure 6 An exemplary system architecture 600 is shown to which the method for processing order data or the apparatus for processing order data according to the embodiments of the present invention can be applied.
[0220] like Figure 6 As shown, system architecture 600 may include terminal devices 601, 602, 603, network 604 and server 605. Network 604 is used to provide a medium for communication links between terminal devices 601, 602, 603 and server 605. Network 604 may include various connection types, such as wired, wireless communication links or optical fiber cables, etc.
[0221] Users can use terminal devices 601, 602, and 603 to interact with server 605 through network 604 to receive or send messages, etc. Various communication client applications can be installed on terminal devices 601, 602, and 603, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social platform software, etc. (only examples).
[0222] The terminal devices 601 , 602 , and 603 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop computers, and desktop computers, etc.
[0223] The server 605 may be a server that provides various services, such as a backend management server (for example only) that provides support for shopping websites browsed by users using the terminal devices 601, 602, and 603. The backend management server may analyze and process the received data such as the item information query request, and feed back the processing results to the terminal device.
[0224] It should be noted that the method for processing order data provided in the embodiment of the present invention is generally executed by the server 605, and accordingly, the device for processing order data is generally set in the server 605. The method for processing order data provided in the embodiment of the present invention can also be executed by the terminal devices 601, 602, and 603, and accordingly, the device for processing order data can be set in the terminal devices 601, 602, and 603.
[0225] It should be understood that Figure 6 The number of terminal devices, networks and servers in the embodiment is only for illustration. Any number of terminal devices, networks and servers may be provided according to implementation requirements.
[0226] Reference below Figure 7 , which shows a schematic diagram of the structure of a computer system 700 of a terminal device suitable for implementing an embodiment of the present invention. Figure 7 The terminal device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.
[0227] like Figure 7 As shown, the computer system 700 includes a central processing unit (CPU) 701, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 702 or a program loaded from a storage part 708 into a random access memory (RAM) 703. In the RAM 703, various programs and data required for the operation of the system 700 are also stored. The CPU 701, the ROM 702, and the RAM 703 are connected to each other via a bus 704. An input / output (I / O) interface 705 is also connected to the bus 704.
[0228] The following components are connected to the I / O interface 705: an input section 706 including a keyboard, a mouse, etc.; an output section 707 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 708 including a hard disk, etc.; and a communication section 709 including a network interface card such as a LAN card, a modem, etc. The communication section 709 performs communication processing via a network such as the Internet. A drive 710 is also connected to the I / O interface 705 as needed. A removable medium 711, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 710 as needed, so that a computer program read therefrom is installed into the storage section 708 as needed.
[0229] In particular, according to the embodiments disclosed in the present invention, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present invention include a computer program, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication part 709, and / or installed from the removable medium 711. When the computer program is executed by the central processing unit (CPU) 701, the above-mentioned functions defined in the system of the present invention are executed.
[0230] It should be noted that the computer-readable medium shown in the present invention may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present invention, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In the present invention, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than computer-readable storage media, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.
[0231] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, functions and operations of the system, method and computer program according to various embodiments of the present invention. In this regard, each box in the flow chart or block diagram can represent a module, a program segment, or a part of a code, and the above-mentioned module, program segment, or a part of a code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flow chart, and the combination of the boxes in the block diagram or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.
[0232] The modules involved in the embodiments of the present invention may be implemented by software or hardware. The modules described may also be set in a processor, for example, it may be described as: a processor includes a determination module, a module to be produced, a relationship module and a production module, wherein the names of these modules do not constitute a limitation on the modules themselves in some cases.
[0233] As another aspect, the present invention also provides a computer-readable medium, which may be included in the device described in the above embodiment; or it may exist independently and not be assembled into the device. The above computer-readable medium carries one or more programs. When the above one or more programs are executed by a device, the device implements the following method: according to the delivery address of the order and the distribution area range corresponding to each store, the store whose distribution area range includes the delivery address is matched; according to the latest delivery time and item details of the order, the set of items to be produced of the store is updated; wherein the item details include item number and item quantity; according to the item details of the order, the item relationship network list of the store is updated; according to the latest delivery time of the order, item details, the set of items to be produced of the store and the item relationship network list, the production method of the order is determined.
[0234] According to the technical solution of the embodiment of the present invention, because the technical means of determining the production mode of the order by updating the store's set of items to be produced and the list of item relationships according to the latest delivery time and item details of the order is adopted, the technical problem of the inability to achieve the highest production efficiency in the prior art is overcome. The embodiment of the present invention determines the production mode of the order through the latest delivery time, item details, the store's set of items to be produced and the list of item relationships, which not only reduces the production and transportation costs of the order, but also improves the production efficiency of the order, so that the production efficiency is maximized; and the embodiment of the present invention can also improve the operating efficiency of the store, avoiding high operating costs caused by large-scale store openings.
[0235] The above specific implementations do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may occur depending on design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.
Claims
1. A method for processing order data, characterized in that: include: According to the delivery address of the order and the delivery area range corresponding to each store, the store whose delivery area range includes the delivery address is matched; According to the latest delivery time and item details of the order, update the set of items to be produced in the store; wherein the item details include item number and item quantity; According to the item details of the order, update the item relationship network list of the store; wherein the item relationship network is an item relationship between items belonging to the same order; Determine the production method of the order according to the latest delivery time of the order, item details, the set of items to be produced in the store, and the item relationship network list; According to the latest delivery time of the order, item details, the set of items to be produced in the store, and the item relationship network list, the production method of the order is determined, including: Each production index in the set of items to be produced of the store is piled up based on the item number as a dimension, and the values corresponding to each production index in the pile are added up to obtain the quantity to be produced corresponding to each item number; According to the to-be-produced quantity corresponding to each item and the item relationship network list of the store, updating the item relationship set to be considered of the store; Extracting each item number from the item relationship set to be considered, calculating the sum of the item quantities of each item number in the item relationship set to be considered as the transfer quantity corresponding to each item number, and adding each item number and its corresponding transfer quantity to the transfer item set; Determine the production method of the order according to the latest delivery time of the order, item details and the set of transferred items; According to the to-be-produced quantity corresponding to each item and the item relationship network list of the store, updating the to-be-considered item relationship set of the store includes: For each item number, determine whether the quantity to be produced corresponding to the item number is greater than or equal to the threshold of the quantity to be allocated for the first time; if so, add the item number to the list of items to be allocated for the first time; The item relationship network list of the store is traversed in a loop, and if there is an item relationship network in which all items are in the initial list of items to be transferred, the item relationship network is added to the item relationship set to be considered.
2. The method according to claim 1, characterized in that According to the latest delivery time and item details of the order, the set of items to be produced in the store is updated, including: Using the latest delivery time and item number of the order as a production index, determining whether the production index exists in the set of items to be produced in the store; If yes, the quantity of the item corresponding to the item number is used as the value of the production index and updated to the set of items to be produced in the store; If not, insert the production index into the set of items to be produced in the store, and set the value of the production index to the quantity of items corresponding to the item number.
3. The method according to claim 1, characterized in that According to the item details of the order, update the item relationship network list of the store, including: According to each item number of the order, determining whether there is an item relationship network in the item relationship network list of the store that includes each item number; If yes, then update the item relationship network including the item numbers; If not, inserting a new item relationship network into the item relationship network list of the store; The item relationship network is in the form of a key-value pair, where the key is the item number and the value is the sum of the item quantities corresponding to the item number.
4. The method according to claim 1, characterized in that: According to the to-be-produced quantity corresponding to each item and the item relationship network list of the store, updating the to-be-considered item relationship set of the store, further comprising: If there is an item relationship network in which only some items are in the initial list of items to be allocated, then extract the item numbers that are not in the initial list of items to be allocated from the item relationship network, and determine whether the quantities to be produced corresponding to the item numbers that are not in the initial list of items to be allocated are all greater than or equal to the secondary quantity threshold to be allocated; wherein the secondary quantity threshold to be allocated is greater than the initial quantity threshold to be allocated; If so, the item relationship network is added to the item relationship set to be considered.
5. The method according to claim 1, characterized in that Before extracting each item number from the item relationship set to be considered, the method further includes: Extracting each item number from the item relationship set to be considered, and calculating the sum of the item quantities of each item number in the item relationship set to be considered as the transfer quantity corresponding to each item number; Item numbers whose transfer quantities are less than a secondary transfer quantity threshold and item relationship networks containing the item numbers are deleted from the item relationship set to be considered, thereby updating the item relationship set to be considered.
6. The method according to claim 1, characterized in that Determine the production method of the order according to the latest delivery time of the order, item details and the set of transferred items, including: Add the current time to the estimated transfer duration to get the latest transfer time; Determine whether the latest transfer time is greater than or equal to the latest delivery time of the order; If so, it is determined that the production method of the order is warehouse production; If not, continue to determine whether each item number of the order is in the set of transferred items and whether the item quantity corresponding to each item number is less than or equal to the transfer quantity corresponding to each item number in the set of transferred items; If yes, determine that the production mode of the order is store production, and update the transfer item set; If not, it is determined that the production method of the order is warehouse production.
7. A device for processing order data, characterized in that: include: A determination module, for matching stores whose delivery areas include the delivery address according to the delivery address of the order and the delivery area ranges corresponding to each store; The module to be produced updates the set of items to be produced in the store according to the latest delivery time and item details of the order; wherein the item details include item number and item quantity; A relationship module, used to update the item relationship network list of the store according to the item details of the order; A production module, used to determine the production method of the order according to the latest delivery time of the order, item details, the set of items to be produced in the store, and the item relationship network list; The production module is also used to: Each production index in the set of items to be produced of the store is piled up based on the item number as a dimension, and the values corresponding to each production index in the pile are added up to obtain the quantity to be produced corresponding to each item number; According to the to-be-produced quantity corresponding to each item and the item relationship network list of the store, updating the item relationship set to be considered of the store; Extracting each item number from the item relationship set to be considered, calculating the sum of the item quantities of each item number in the item relationship set to be considered as the transfer quantity corresponding to each item number, and adding each item number and its corresponding transfer quantity to the transfer item set; Determine the production method of the order according to the latest delivery time of the order, item details and the set of transferred items; The production module is also used to: For each item number, determine whether the quantity to be produced corresponding to the item number is greater than or equal to the threshold of the quantity to be allocated for the first time; if so, add the item number to the list of items to be allocated for the first time; The item relationship network list of the store is traversed in a loop, and if there is an item relationship network in which all items are in the initial list of items to be transferred, the item relationship network is added to the item relationship set to be considered.
8. An electronic device, characterized in that: include: one or more processors; a storage device for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1 to 6.
9. A computer readable medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.
Citation Information
Patent Citations
Multi-warehouse delivery management method used for e-commerce and multi-warehouse delivery management system thereof
CN106296052A
Method, device and system for processing goods transaction information
CN107527146A
A supply chain management method and system based on double-line purchase
CN109272281A
Method and device for processing order to be delivered
CN110060013A
Scheduling method and device for order to be delivered
CN110070325A
