CN113762850A

CN113762850A - Method and device for processing order data

Info

Publication number: CN113762850A
Application number: CN202011240378.0A
Authority: CN
Inventors: 王凯斌; 张达; 戚依楠
Original assignee: Beijing Jingdong Shangke Information Technology Co Ltd; Beijing Wodong Tianjun Information Technology Co Ltd
Current assignee: Beijing Jingdong Shangke Information Technology Co Ltd; Beijing Wodong Tianjun Information Technology Co Ltd
Priority date: 2020-11-09
Filing date: 2020-11-09
Publication date: 2021-12-07

Abstract

The invention discloses a method and a device for processing order data, and relates to the technical field of warehouse logistics. One embodiment of the method comprises: matching the stores with the delivery area range including the receiving address according to the receiving address of the order and the delivery area range corresponding to each store; updating the to-be-produced product set of the store according to the latest delivery time and the item details of the order; wherein the item details include an item number and an item quantity; updating the item relation network list of the store according to the item details of the order; and determining the production mode of the order according to the latest delivery time and item details of the order, the to-be-produced item set of the store and the item relation network list. The implementation mode can solve the technical problem that the highest production efficiency cannot be achieved.

Description

Method and device for processing order data

Technical Field

The invention relates to the technical field of warehouse logistics, in particular to a method and a device for processing order data.

Background

At present, orders are generally produced by a warehouse, then the orders are produced and packaged in the warehouse, and finally the packages are delivered to order placement addresses of the orders. With the increase of group orders (such as community group order, enterprise group order, etc.), store production methods have appeared, which are based on store production packaging and distribution.

In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:

if the orders are produced in stores or warehouses, the highest production efficiency cannot be achieved, and the distribution cost of the orders is increased.

Disclosure of Invention

In view of this, embodiments of the present invention provide a method and an apparatus for processing order data to solve the technical problem that the highest production efficiency cannot be achieved.

To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a method of processing order data, including:

matching the stores with the delivery area range including the receiving address according to the receiving address of the order and the delivery area range corresponding to each store;

updating the to-be-produced product set of the store according to the latest delivery time and the item details of the order; wherein the item details include an item number and an item quantity;

updating the item relation network list of the store according to the item details of the order;

and determining the production mode of the order according to the latest delivery time and item details of the order, the to-be-produced item set of the store and the item relation network list.

Optionally, updating the to-be-produced item set of the store according to the latest delivery time and item details of the order includes:

taking the latest delivery time and the article number of the order as a production index, and judging whether the production index exists in the to-be-produced product set of the store;

if so, updating the number of the articles corresponding to the article number into a to-be-produced article set of the store as the value of the production index;

and if not, inserting the production index into the to-be-produced product set of the store, and setting the value of the production index as the number of the products corresponding to the product number.

Optionally, updating the item relationship network list of the store according to the item details of the order, including:

judging whether an article relation network containing each article number exists in an article relation network list of the store according to each article number of the order;

if yes, updating an article relation network containing the article numbers;

if not, inserting a new article relationship network into the article relationship network list of the store;

the article relation network is in a key-value pair form, the key is an article number, and the value is the sum of the article quantity corresponding to the article number.

Optionally, determining a production mode of the order according to the latest delivery time and item details of the order, the to-be-produced item set of the store, and the item relationship network list, includes:

stacking each production index in the to-be-produced product set of the store by taking the item number as a dimension, and adding values corresponding to each production index in the stacks to obtain the to-be-produced quantity corresponding to each item number;

updating the relation set of the items to be considered of the store according to the quantity to be produced corresponding to each item and the item relation network list of the store;

extracting each article number from the article relation set to be considered, calculating the sum of the article number of each article number in the article relation set to be considered as the transfer quantity corresponding to each article number, and adding each article number and the transfer quantity corresponding to each article number into the transfer article set;

and determining the production mode of the order according to the latest delivery time, the item details and the allocated item set of the order.

Optionally, updating the relation set of the items to be considered of the store according to the quantity to be produced corresponding to each item and the item relation network list of the store, including:

for each article number, judging whether the to-be-produced quantity corresponding to the article number is larger than or equal to a threshold value of the initial to-be-allocated quantity; if so, adding the article number into a list of articles to be allocated for the first time;

and circularly traversing the item relationship network list of the store, and adding the item relationship network into the item relationship set to be considered if the item relationship network in which all the items are in the item list to be called for the first time exists.

Optionally, updating the relation set of the items to be considered in the store according to the quantity to be produced corresponding to each item and the item relation network list of the store, further comprising:

if an article relation network with only partial articles in the primary article list to be allocated exists, extracting article numbers which are not in the primary article list to be allocated from the article relation network, and judging whether the to-be-produced quantity corresponding to each article number which is not in the primary article list to be allocated is larger than or equal to a secondary article number threshold value or not; wherein the secondary number-to-be-dialed threshold is greater than the primary number-to-be-dialed threshold;

and if so, adding the item relationship network into the item relationship set to be considered.

Optionally, before extracting each item number from the set of item relationships to be considered, the method further includes:

extracting each item number from the item relation set to be considered, and calculating the sum of the item numbers of each item number in the item relation set to be considered as the transfer quantity corresponding to each item number;

and deleting the item numbers with the transfer quantity smaller than the threshold value of the secondary transfer quantity to be considered and the item relation network containing the item numbers from the item relation set to be considered, so as to update the item relation set to be considered.

Optionally, determining a production mode of the order according to the latest delivery time of the order, the item details, and the allocated item set includes:

adding the current time to the estimated transfer duration to obtain the latest transfer time;

judging whether the latest allocation time is more than or equal to the latest delivery time of the order;

if so, determining that the production mode of the order is warehouse production;

if not, continuously judging whether each item number of the order is in the allocated item set and the number of the items corresponding to each item number is less than or equal to the allocated number corresponding to each item number in the allocated item set;

if so, determining that the production mode of the order is store production, and updating the allocated article set;

if not, determining that the production mode of the order is warehouse production.

In addition, according to another aspect of the embodiments of the present invention, there is provided an apparatus for processing order data, including:

the determining module is used for matching out the stores with the delivery area ranges including the receiving addresses according to the receiving addresses of the orders and the delivery area ranges corresponding to the stores;

the to-be-produced module is used for updating the to-be-produced product set of the store according to the latest delivery time and the item details of the order; wherein the item details include an item number and an item quantity;

the relation module is used for updating the item relation network list of the store according to the item details of the order;

and the production module is used for determining the production mode of the order according to the latest delivery time and item details of the order, the to-be-produced product set of the store and the item relation network list.

Optionally, the module to be produced is further configured to:

Optionally, the relationship module is further configured to:

if yes, updating an article relation network containing the article numbers;

Optionally, the production module is further configured to:

According to another aspect of the embodiments of the present invention, there is also provided an electronic device, including:

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 of any of the embodiments described above.

According to another aspect of the embodiments of the present invention, there is also provided a computer readable medium, on which a computer program is stored, which when executed by a processor implements the method of any of the above embodiments.

One embodiment of the above invention has the following advantages or benefits: the technical means of determining the production mode of the order is adopted by updating the to-be-produced product set and the item relation network list of the store according to the latest delivery time and item details of the order, so that the technical problem that the highest production efficiency cannot be achieved in the prior art is solved. According to the method and the system, the production mode of the order is determined through the latest delivery time and item detail of the order, the to-be-produced product set of a store and the item relation network list, so that the production and transportation cost of the order is reduced, the production efficiency of the order is improved, and the production efficiency is highest; the embodiment of the invention can also improve the operation efficiency of the store, and avoid high operation cost caused by large-scale store opening of the store.

Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.

Drawings

The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:

FIG. 1 is a schematic diagram of a main flow of a method of processing order data according to an embodiment of the invention;

FIG. 2 is a schematic view of a main flow of a method of processing order data according to a referential embodiment of the present invention;

FIG. 3 is a schematic view of a main flow of a method of processing order data according to another referential embodiment of the present invention;

FIG. 4 is a schematic view of a main flow of a method of processing order data according to still another referential embodiment of the present invention;

FIG. 5 is a schematic diagram of the main modules of an apparatus for processing order data according to an embodiment of the present invention;

FIG. 6 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;

fig. 7 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server of an embodiment of the invention.

Detailed Description

Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.

Fig. 1 is a schematic diagram of a main flow of a method of processing order data according to an embodiment of the present invention. As an embodiment of the present invention, as shown in fig. 1, the method for processing order data may include:

and step 101, matching stores with the delivery area range including the receiving address according to the receiving address of the order and the delivery area range corresponding to each store.

In the embodiment of the present invention, the order may be a group order (such as a community group order, an enterprise group order, etc.), or may be a personal order. Specifically, whether the order is a group order may be determined according to a group order identifier, where the group order identifier may be a certain field in the order information or a certain bit in a long text in the order information.

Optionally, step 101 may comprise: and matching at least one store with a delivery area range containing the receiving address on the map according to the receiving address of the order and the delivery area range corresponding to each store. In the embodiment of the invention, the receiving address of the order is obtained, the corresponding store information Points (POI) are matched on the map according to the receiving address of the order, each store POI corresponds to a certain distribution area range, and the order with the receiving address in the distribution area range of the store can be matched to the store. It should be noted that there may be situations where one order matches two or more stores. And generating a store number character string by using all the matched store numbers no matter the number of the stores matched by the order. If a plurality of stores are matched, the store numbers are separated by commas. Single store number string example: 123; multiple store number strings for example: 123,1326. Finally, the generated store number character string is updated to the store number field of the order table. Optionally, the store may be a community store, or may be a community service station, and the like, which is not limited in this embodiment of the present invention.

And 102, updating the to-be-produced product set of the store according to the latest delivery time and the item details of the order. Wherein the item details include an item number and an item quantity.

The latest delivery time and item details of the order may be obtained from the order information, and then the to-be-produced item set of the store may be updated according to the latest delivery time and item details of the order.

Optionally, updating the to-be-produced item set of the store according to the latest delivery time and item details of the order may include: taking the latest delivery time and the article number of the order as a production index, and judging whether the production index exists in the to-be-produced product set of the store; if so, updating the number of the articles corresponding to the article number into a to-be-produced article set of the store as the value of the production index; and if not, inserting the production index into the to-be-produced product set of the store, and setting the value of the production index as the number of the products corresponding to the product number. The method and the device take the combination of the latest delivery time of the order and the item number as the production index, and check whether the production index exists in the to-be-produced item set.

Specifically, taking a certain item number in an order as an example, the method may include the following steps:

firstly, taking the combination of the latest delivery time of an order and the item number as a production index;

then, traversing the to-be-produced product set of the store, and judging whether the production index exists in the to-be-produced product set of the store; if yes, updating the value of the production index, wherein the value of the updated production index is equal to the value of the production index before updating plus the quantity of the articles corresponding to the article number; and if the product number does not exist, inserting the production index and the corresponding value thereof into the to-be-produced product set of the store, wherein the value of the production index is the number of the product corresponding to the product number.

And 103, updating the item relationship network list of the store according to the item details of the order.

The item list of the order can be obtained from the order information, and then the item relation network list of the store is updated according to the item list of the order. The item relation network is that the item relation exists between the items belonging to one order, and is mainly used for ensuring that the items of the same order are produced in a warehouse or in the same store during subsequent calculation. The article relation network table stores each store number and an article relation network list corresponding to each store, and one store has one article relation network list, wherein each article relation is contained in the article relation network list, the article relation is in a key-value form, the key is the article number, and the value is the article number corresponding to the article number. For example, [ { skuA:2, skuB:4}, { skuB:2, skuD:4} ] is an item relationship network list of stores, { skuA:2, skuB:4} is an item relationship network, skuA is an item number, and 2 is a corresponding item number.

Optionally, updating the item relationship network list of the store according to the item details of the order may include: judging whether an article relation network containing each article number exists in an article relation network list of the store according to each article number of the order; if yes, updating an article relation network containing the article numbers; if not, inserting a new article relationship network into the article relationship network list of the store; the article relation network is in a key-value pair form, the key is an article number, and the value is the sum of the article quantity corresponding to the article number. Specifically, taking a certain order as an example, the method may include the following steps:

first, all item numbers placed in the order are obtained.

Then, judging whether an article relation network containing all article numbers exists in the article relation network list of the store or not;

and if so, updating the existing article relation network, wherein the article quantity corresponding to each article number after updating is the quantity corresponding to each article number before updating plus the article quantity corresponding to each article number placed in the order. For example, the item relationship network list is [ { skuA:1, skuB:1}, { skuB:2, skuD:4} before updating, and { skuA:2, skuB:4} needs to be added, and the updated item relationship network list is [ { skuA:3, skuB:5}, { skuB:2, skuD:4} ].

And if the order does not exist, inserting a new item relation network into the item relation network list of the store, wherein in the item relation network, the item quantity corresponding to each item number is the item quantity corresponding to each item number placed in the order. For example, the item relationship network list is [ { skuB:2, skuD:4} before updating, a new item relationship network { skuA:2, skuB:4} needs to be inserted, and the updated item relationship network list is [ { skuA:2, skuB:4}, { skuB:2, skuD:4} ].

And 104, determining the production mode of the order according to the latest delivery time and item details of the order, the to-be-produced product set of the store and the item relation network list.

After the to-be-produced product set and the item relation network list of the store are calculated, the production mode of the order, such as store production or warehouse production, is determined by combining the latest delivery time and item details of the order.

Optionally, step 104 may include: stacking each production index in the to-be-produced product set of the store by taking the item number as a dimension, and adding values corresponding to each production index in the stacks to obtain the to-be-produced quantity corresponding to each item number; updating the relation set of the items to be considered of the store according to the quantity to be produced corresponding to each item and the item relation network list of the store; extracting each article number from the article relation set to be considered, calculating the sum of the article number of each article number in the article relation set to be considered as the transfer quantity corresponding to each article number, and adding each article number and the transfer quantity corresponding to each article number into the transfer article set; and determining the production mode of the order according to the latest delivery time, the item details and the allocated item set of the order.

After all orders are processed according to the steps 101 to 103, obtaining the numbers of all stores, forming a store number list, circulating the store number list, and calculating the allocation articles and the allocation quantity. Specifically, for each store number, acquiring all article numbers in a to-be-produced product set of the store, and removing duplication to obtain an article number list; and then circulating the item number list, stacking each production index and the corresponding value thereof in the to-be-produced item set of the store by taking the item number as a dimension, adding the values corresponding to the production indexes in the stacks to obtain the to-be-produced quantity corresponding to each item number, and storing the to-be-produced quantity in a cache.

Optionally, updating the relation set of the items to be considered of the store according to the quantity to be produced corresponding to each item and the item relation network list of the store, including: for each article number, judging whether the to-be-produced quantity corresponding to the article number is larger than or equal to a threshold value of the initial to-be-allocated quantity; if so, adding the article number into a list of articles to be allocated for the first time; and circularly traversing the item relationship network list of the store, and adding the item relationship network into the item relationship set to be considered if the item relationship network in which all the items are in the item list to be called for the first time exists. Optionally, updating the relation set of the items to be considered in the store according to the quantity to be produced corresponding to each item and the item relation network list of the store, further comprising: if an article relation network with only partial articles in the primary article list to be allocated exists, extracting article numbers which are not in the primary article list to be allocated from the article relation network, and judging whether the to-be-produced quantity corresponding to each article number which is not in the primary article list to be allocated is larger than or equal to a secondary article number threshold value or not; wherein the secondary number-to-be-dialed threshold is greater than the primary number-to-be-dialed threshold; and if so, adding the item relationship network into the item relationship set to be considered.

In the embodiment of the invention, for each article number, whether the to-be-produced quantity corresponding to the article number is more than or equal to the initial to-be-allocated quantity threshold value is judged; if so, the description may consider the warehouse to transfer the item to a store for uniform distribution, so the item number is added to the list of items to be transferred for the first time. Then, acquiring the item relationship network list of the store, circularly traversing the item relationship network list of the store, and calculating an item relationship set to be considered:

a) and if all the items in the circulated item relationship network are in the list of the items to be transferred for the first time, adding the item relationship network into the item relationship set to be considered. Because there may be a plurality of article relationship networks containing a certain article, one of the article relationship networks may satisfy the condition, but the other article relationship networks may not satisfy the condition, in order to avoid that the articles in the other article relationship networks cannot be produced in stores and finally the article cannot be produced in stores, the article relationship network where all the articles are in the list of articles to be called for the first time is added to the article relationship set to be considered.

b) And if all the objects in the circulated object relationship network are not in the list of the objects to be transferred for the first time, updating is not carried out, and judgment of the next object relationship network in the object relationship network list is continued.

c) If the circulated article relation network has articles and only part of the articles are in the primary to-be-allocated article list, extracting article numbers which are not in the primary to-be-allocated article list and judging whether the to-be-generated quantity of each article number which is not in the primary to-be-allocated article list is larger than or equal to a secondary to-be-allocated quantity threshold value or not; if the to-be-produced quantity of the item numbers not in the primary to-be-allocated item list is greater than or equal to the secondary to-be-allocated quantity threshold value, adding an item relation network meeting the conditions into the to-be-considered item relation set; and if the to-be-produced quantity of each article number not in the primary to-be-allocated article list is not greater than or equal to the secondary to-be-allocated quantity threshold value, no processing is performed.

It should be noted that the to-be-produced quantity refers to the to-be-produced quantity corresponding to the item number in the to-be-produced item set of the store, and is not the quantity of the item corresponding to the item number in the item relationship network that is circulated to. Because the quantity of the article in all article relationship networks is considered in a whole, such as the article relationship networks { a:1, b:5} { b:6, c:3}, { b:2, d:2}, if the circulation is carried out to { a:1, b:5} to see only the quantity 5 of the article b per se, the quantity threshold of the secondary quantity to be allocated may not be reached, but the sum of the quantities of the article b in all article relationship networks (i.e. the quantity to be produced) may reach the quantity threshold of the secondary quantity to be allocated. And of course, the verification is performed again, and it needs to be verified whether the sum of the quantity of each item in the item relationship set to be considered really reaches the secondary quantity threshold to be dialed, because other items of some item relationship networks including the item b may not reach the secondary quantity threshold to be dialed, so that the items in the item relationship networks cannot be produced through stores. For example, the number of the article c cannot reach the secondary quantity-to-be-called threshold value, so that the { b:6, c:3} cannot be produced in a store, and the article b cannot be produced in the store indirectly.

It should be noted that the threshold of the number to be allocated for the first time and the threshold of the number to be allocated for the second time are manually set, or reasonable thresholds may be obtained through statistics based on big data. The threshold value of the number of initial calls and the threshold value of the number of secondary calls may be a threshold value for all items of all stores, a threshold value for all items of a certain store, a threshold value for a certain item of all stores, or a threshold value for a certain item of a certain store.

In the embodiment of the invention, the primary quantity threshold to be allocated and the secondary quantity threshold to be allocated are distinguished because the primary quantity threshold to be allocated is mainly used for meeting the requirement that the cost of allocating articles to stores for distribution is less than the cost of distribution after warehouse packaging, and the secondary quantity threshold to be allocated is mainly used for meeting the requirement that orders are produced in one package as much as possible and avoiding the condition that the orders are divided into a part of stores for production and a part of stores for production. The number threshold of the secondary to-be-dialed is generally larger than the number threshold of the primary to-be-dialed.

Optionally, before extracting each item number from the set of item relationships to be considered, the method further includes: extracting each item number from the item relation set to be considered, and calculating the sum of the item numbers of each item number in the item relation set to be considered as the transfer quantity corresponding to each item number; and deleting the item numbers with the transfer quantity smaller than the threshold value of the secondary transfer quantity to be considered and the item relation network containing the item numbers from the item relation set to be considered, so as to update the item relation set to be considered. Specifically, the process of calculating the dialed goods and the dialed number thereof and generating the dialed goods set may include the steps of:

1) extracting each article number from the article relation set to be considered, and calculating the sum of the number of the article number in the article relation set to be considered as the allocation number of the article for each article number; judging whether the transfer quantity of the articles is greater than or equal to a secondary transfer quantity threshold value; if not, the article can not be produced in a store at present, the article relation network containing the article is deleted from the article relation set to be considered, and the article relation set to be considered is updated;

2) then, extracting each article number from the updated article relation set to be considered, and calculating the sum of the number of the article number in the article relation set to be considered as the allocation number of the article for each article number; then adding the article number and the corresponding transfer quantity into a transfer article set;

3) updating a set of allocated items according to existing inventory, specifically comprising:

3a) acquiring area numbers according to store numbers, and calling an inventory interface to acquire the stock quantity of all the item numbers in the allocated item set under the area numbers;

3b) sequentially judging whether the allocation quantity of the article numbers is less than or equal to the stock quantity of the spot goods; if so, the allocation requirement of the article number can be completely met, and no processing is performed; if not, the allocation requirement of the item number cannot be completely met, and the allocation quantity of the item number in the allocated item set is updated to be the spot stock quantity.

4) And judging whether the allocated article set is not empty, if so, sending the store number and the allocated article set to an allocation system so that the allocation system allocates the articles to the stores.

After the allocated item set is determined, the final production mode of the order can be determined according to the latest delivery time, item details and the allocated item set of the order, if the order can be produced in a store, the store number is obtained, and if the order cannot be produced in the store, the order can be produced in a warehouse. Specifically, all order information including the store numbers is acquired, the orders are sorted according to the order from the latest delivery time to the latest delivery time, then an order list is formed, the order list is circulated, and for each order, the following steps are performed:

1) and acquiring the estimated transfer time, wherein the estimated transfer time is the longest estimated time required for transferring each article in the order from the warehouse to the store.

2) And judging whether the sum of the current system time and the estimated transfer time length is greater than or equal to the latest delivery time of the order.

If yes, the order cannot continue to wait for production in the store, and the warehouse production needs to be immediately located, so the group identification of the order is erased, so that the order is processed according to the common order in the next round of processing, the order is located to the warehouse production, and meanwhile, the to-be-produced product set and the item relation network list of the store are updated. Warehouse production means that packages are produced in a large warehouse without being delivered to a store, ordinary order logic is carried out, and the packages are delivered to a delivery station and delivered by a delivery person.

If not, continuously judging whether each item number in the item list of the order is in the allocated item set.

3) If all the item numbers in the item details of the order are in the allocated item set and the item number of each item number in the order is less than or equal to the allocated number corresponding to each item number in the allocated item set, it indicates that the order can be produced in an store (the warehouse uniformly allocates each item to the community store, the community store performs packaging and allocation, and each cost of the warehouse is saved), and the following logic is performed:

positioning the production of the order in the store number, and sending the order to a store operation terminal for production; and then updating the allocation quantity of each item number in the allocated item set, namely subtracting the allocation quantity corresponding to each item number in the allocated item set from the item quantity corresponding to the item number in the order. Meanwhile, the to-be-produced product set and the item relation network list of the store need to be updated.

Acquiring all store numbers in a store number field of an order, circularly processing the store numbers, and updating a to-be-produced product set and an item relation network list of the stores for each store number, wherein the logic comprises the following steps:

1) and acquiring a product set to be produced of the store, updating the production index consisting of the latest delivery time and the item number and a value corresponding to the production index in the product set to be produced of the store, wherein the updated value is obtained by subtracting the quantity of the items corresponding to the item number placed in the order from the value before updating. And if the updated value is 0, deleting the production index and the corresponding value thereof in the to-be-produced product set.

2) And acquiring an article relation network list of the store, updating an article relation network completely consistent with the article number placed in the order in the article relation network list of the store, wherein the article quantity corresponding to each article number in the updated article relation network is obtained by subtracting the article quantity corresponding to the article number placed in the order from the article quantity corresponding to each article number before updating. And if the quantity of the items corresponding to each item number of the updated item relationship network is 0, deleting the item relationship network from the item relationship network list.

It should be noted that, regardless of whether there are a plurality of store numbers in the store number field of the order, since the order is not yet in store waiting for production, the relevant information of the order in all relevant stores needs to be deleted.

According to the various embodiments described above, it can be seen that the technical means of determining the production mode of the order by updating the to-be-produced product set and the item relationship network list of the store according to the latest delivery time and item details of the order in the embodiments of the present invention solves the technical problem that the highest production efficiency cannot be achieved in the prior art. According to the method and the system, the production mode of the order is determined through the latest delivery time and item detail of the order, the to-be-produced product set of a store and the item relation network list, so that the production and transportation cost of the order is reduced, the production efficiency of the order is improved, and the production efficiency is highest; the embodiment of the invention can also improve the operation efficiency of the store, and avoid high operation cost caused by large-scale store opening of the store.

Fig. 2 is a schematic view of a main flow of a method of processing order data according to a referential embodiment of the present invention. As another embodiment of the present invention, as shown in fig. 2, step 102 in the above embodiment may include the following steps:

step 201, obtaining the latest delivery time of the order and item details, where the item details include an item number and an item quantity.

Step 202, generating a storage address of a to-be-produced product set of the store according to the store number. The unique identifier may be generated by adding a specific prefix to the store number, for example, if the store number is "1232", then adding a specific prefix "sqd _", and then the storage address of the to-be-generated product set of the store is "sqd _ 1232".

Step 203, obtaining a text of the product set to be generated of the store from Redis (a storage server with a dictionary structure and higher access efficiency) according to the storage address of the product set to be generated of the store.

And 204, if corresponding records exist in the Redis, converting the acquired to-be-generated product set text of the store into a to-be-generated product set required by calculation. And if no corresponding record exists in the Redis, newly building a product set to be produced of the store.

And step 205, updating the to-be-produced product set of the store according to the latest delivery time and the item details of the order.

Optionally, step 205 may comprise: taking the latest delivery time and the article number of the order as a production index, and judging whether the production index exists in the to-be-produced product set of the store; if so, updating the number of the articles corresponding to the article number into a to-be-produced article set of the store as the value of the production index; and if not, inserting the production index into the to-be-produced product set of the store, and setting the value of the production index as the number of the products corresponding to the product number. The method and the device take the combination of the latest delivery time of the order and the item number as the production index, and check whether the production index exists in the to-be-produced item set.

And step 206, storing the updated to-be-produced product set of the store to a corresponding storage address in Redis.

In addition, in a reference embodiment of the present invention, the detailed implementation of the method for processing order data is described in detail in the above-mentioned method for processing order data, and therefore, the repeated description is not repeated here.

Fig. 3 is a schematic view of a main flow of a method of processing order data according to another referential embodiment of the present invention. As another embodiment of the present invention, as shown in fig. 3, step 103 in the above embodiment may include the following steps:

step 301, acquiring an item detail of an order, wherein the item detail comprises an item number and an item quantity;

step 302, generating a storage address of the item relationship network list of the store according to the store number. The unique identifier may be generated by adding a specific prefix to the store number, for example, if the store number is "1232", then adding a specific prefix "spgx _", and then the storage address of the item relationship network list of the store is "spgx _ 1232".

Step 303, acquiring an item relationship network list text of the store from the Redis according to the storage address of the item relationship network list of the store.

And step 304, if corresponding records exist in Redis, converting the acquired item relationship network list text of the store into an item relationship network list required by calculation. And if the corresponding record does not exist in the Redis, creating an item relationship network list of the store.

And 305, updating the item relationship network list of the store according to the item details of the order.

Optionally, step 305 may include: judging whether an article relation network containing each article number exists in an article relation network list of the store according to each article number of the order; if yes, updating an article relation network containing the article numbers; if not, inserting a new article relationship network into the article relationship network list of the store; the article relation network is in a key-value pair form, the key is an article number, and the value is the sum of the article quantity corresponding to the article number.

And step 306, storing the updated item relationship network list of the store to a corresponding storage address in Redis.

In addition, in another embodiment of the present invention, the order data processing method is described in detail in the above-mentioned method for processing order data, and therefore the repeated description is not repeated here.

Fig. 4 is a schematic view of a main flow of a method of processing order data according to still another referential embodiment of the present invention. As still another embodiment of the present invention, as shown in fig. 4, the method of processing order data may include:

step 401, according to the receiving address of the order and the distribution area range corresponding to each store, matching at least one store in the distribution area range including the receiving address on the map.

In the embodiment of the invention, the receiving address of the order is obtained, the corresponding store information POI is matched on the map according to the receiving address of the order, each store POI corresponds to a certain distribution area range, and the order with the receiving address in the distribution area range of the store can be matched to the store. There may be situations where one order matches two or more stores. And generating a store number character string by using all the matched store numbers no matter the number of the stores matched by the order.

Step 402, updating the to-be-produced product set of the store according to the latest delivery time and the item details of the order.

Taking a certain item number in an order as an example, the method can comprise the following steps:

Step 403, updating the item relationship network list of the store according to the item details of the order.

Specifically, taking a certain order as an example, the method may include the following steps:

first, all item numbers placed in the order are obtained.

and if so, updating the existing article relation network, wherein the article quantity corresponding to each article number after updating is the quantity corresponding to each article number before updating plus the article quantity corresponding to each article number placed in the order. And if the order does not exist, inserting a new item relation network into the item relation network list of the store, wherein in the item relation network, the item quantity corresponding to each item number is the item quantity corresponding to each item number placed in the order.

And step 404, stacking each production index in the to-be-produced product set of the store by taking the item number as a dimension, and adding values corresponding to each production index in the stack to obtain the to-be-produced quantity corresponding to each item number.

For each store number, acquiring all article numbers in a to-be-produced product set of the store, and removing duplication to obtain an article number list; and circulating the item number list, stacking each production index and the corresponding value thereof in the to-be-produced item set of the store by taking the item number as a dimension, and adding the values corresponding to the production indexes in the stacks to obtain the to-be-produced quantity corresponding to each item number.

Step 405, updating the relation set of the items to be considered of the store according to the quantity to be produced corresponding to each item and the item relation network list of the store.

For each article number, judging whether the to-be-produced quantity corresponding to the article number is larger than or equal to a threshold value of the initial to-be-allocated quantity; if so, adding the article number into a list of articles to be allocated for the first time; and circularly traversing the item relationship network list of the store, and adding the item relationship network into the item relationship set to be considered if the item relationship network in which all the items are in the item list to be called for the first time exists.

If an article relation network with only partial articles in the primary article list to be allocated exists, extracting article numbers which are not in the primary article list to be allocated from the article relation network, and judging whether the to-be-produced quantity corresponding to each article number which is not in the primary article list to be allocated is larger than or equal to a secondary article number threshold value or not; wherein the secondary number-to-be-dialed threshold is greater than the primary number-to-be-dialed threshold; and if so, adding the item relationship network into the item relationship set to be considered.

Step 406, extracting each item number from the item relationship set to be considered, and calculating the sum of the item numbers of each item number in the item relationship set to be considered as the allocation number corresponding to each item number; and deleting the item numbers with the transfer quantity smaller than the threshold value of the secondary transfer quantity to be considered and the item relation network containing the item numbers from the item relation set to be considered, so as to update the item relation set to be considered.

Step 407, extracting each item number from the updated item relationship set to be considered, calculating the sum of the item numbers of each item number in the item relationship set to be considered as the allocation number corresponding to each item number, and adding each item number and the allocation number corresponding to each item number into the allocated item set.

And 408, determining the production mode of the order according to the latest delivery time of the order, the item details and the allocated item set.

In addition, in another embodiment of the present invention, the order data processing method is described in detail in the above-mentioned method, and therefore, the repeated description is not repeated here.

Fig. 5 is a schematic diagram of main blocks of an apparatus for processing order data according to an embodiment of the present invention, and as shown in fig. 5, the apparatus 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 determining module 501 is configured to match, according to a receiving address of an order and a distribution area range corresponding to each store, a store in a distribution area range that includes the receiving address; the to-be-produced module 502 updates the to-be-produced product set of the store according to the latest delivery time and item details of the order; wherein the item details include an item number and an item quantity; the relationship module 503 is configured to update the item relationship network list of the store according to the item details of the order; the production module 504 is configured to determine a production method of the order according to the latest delivery time and item details of the order, the to-be-produced item set of the store, and the item relationship network list.

Optionally, the module to be generated 502 is further configured to:

Optionally, the relationship module 503 is further configured to:

if yes, updating an article relation network containing the article numbers;

Optionally, the production module 504 is further configured to:

It should be noted that, in the implementation of the apparatus for processing order data according to the present invention, the above method for processing order data has been described in detail, and therefore, the repeated description is omitted here.

Fig. 6 illustrates an exemplary system architecture 600 of a method of processing order data or an apparatus for processing order data to which embodiments of the present invention may be applied.

As shown in fig. 6, the system architecture 600 may include

terminal devices

601, 602, 603, a network 604, and a server 605. The network 604 serves to provide a medium for communication links between the

terminal devices

601, 602, 603 and the server 605. Network 604 may include various types of connections, such as wire, wireless communication links, or fiber optic cables, to name a few.

A user may use the

terminal devices

601, 602, 603 to interact with the server 605 via the network 604 to receive or send messages or the like. The

terminal devices

601, 602, 603 may have installed thereon various communication client applications, such as shopping applications, web browser applications, search applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only).

The

terminal devices

601, 602, 603 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.

The server 605 may be a server providing various services, such as a background management server (for example only) providing support for shopping websites browsed by users using the

terminal devices

601, 602, 603. The background management server can analyze and process the received data such as the article information query request and feed back the processing result to the terminal equipment.

It should be noted that the method for processing order data provided by the embodiment of the present invention is generally executed by the server 605, and accordingly, the apparatus for processing order data is generally disposed in the server 605. The method for processing order data provided by the embodiment of the present invention may also be executed by the

terminal devices

601, 602, and 603, and accordingly, the apparatus for processing order data may be disposed in the

terminal devices

601, 602, and 603.

It should be understood that the number of terminal devices, networks, and servers in fig. 6 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.

Referring now to FIG. 7, shown is a block diagram of a computer system 700 suitable for use with a terminal device implementing an embodiment of the present invention. The terminal device shown in fig. 7 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.

As shown in fig. 7, the computer system 700 includes a Central Processing Unit (CPU)701, which can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)702 or a program loaded from a storage section 708 into a Random Access Memory (RAM) 703. In the RAM703, various programs and data necessary for the operation of the system 700 are also stored. The CPU 701, the ROM 702, and the RAM703 are connected to each other via a bus 704. An input/output (I/O) interface 705 is also connected to bus 704.

The following components are connected to the I/O interface 705: an input portion 706 including a keyboard, a mouse, and the like; an output section 707 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 708 including a hard disk and the like; and a communication section 709 including a network interface card such as a LAN card, a modem, or the like. 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, or the like is mounted on the drive 710 as necessary, so that a computer program read out therefrom is mounted into the storage section 708 as necessary.

In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 709, and/or installed from the removable medium 711. The computer program performs the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 701.

It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, 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 disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer programs according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The modules described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described as: a processor includes a determination module, a to-be-produced module, a relationship module, and a production module, where the names of the modules do not in some way constitute a limitation on the modules themselves.

As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, implement the method of: matching the stores with the delivery area range including the receiving address according to the receiving address of the order and the delivery area range corresponding to each store; updating the to-be-produced product set of the store according to the latest delivery time and the item details of the order; wherein the item details include an item number and an item quantity; updating the item relation network list of the store according to the item details of the order; and determining the production mode of the order according to the latest delivery time and item details of the order, the to-be-produced item set of the store and the item relation network list.

According to the technical scheme of the embodiment of the invention, the technical means of determining the production mode of the order is adopted by updating the to-be-produced product set and the item relation network list of the store according to the latest delivery time and item details of the order, so that the technical problem that the highest production efficiency cannot be achieved in the prior art is solved. According to the method and the system, the production mode of the order is determined through the latest delivery time and item detail of the order, the to-be-produced product set of a store and the item relation network list, so that the production and transportation cost of the order is reduced, the production efficiency of the order is improved, and the production efficiency is highest; the embodiment of the invention can also improve the operation efficiency of the store, and avoid high operation cost caused by large-scale store opening of the store.

The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A method of processing order data, comprising:

2. The method of claim 1, wherein updating the store's collection of products to be produced based on the latest delivery time and item detail for the order comprises:

3. The method of claim 1, wherein updating the store's item relationship network list based on the item details of the order comprises:

if yes, updating an article relation network containing the article numbers;

4. The method of claim 1, wherein determining a production mode of the order according to the latest delivery time, item details, the to-be-produced item set of the store, and the item relationship network list of the order comprises:

5. The method according to claim 4, wherein updating the item relationship set 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 comprises:

6. The method according to claim 5, wherein the updating of the relation set of the items to be considered in the store according to the quantity to be produced corresponding to each item and the item relation network list of the store further comprises:

7. The method according to claim 4, wherein before extracting each item number from the set of item relationships to be considered, further comprising:

8. The method of claim 4, wherein determining the mode of production of the order based on the latest delivery time of the order, item detail, and the set of allocated items comprises:

9. An apparatus for processing order data, comprising:

10. An electronic device, comprising:

one or more processors;

a storage device for storing one or more programs,

the one or more programs, when executed by the one or more processors, implement the method of any of claims 1-8.

11. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-8.