CN113762854A

CN113762854A - Order processing method and device

Info

Publication number: CN113762854A
Application number: CN202011291279.5A
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-17
Filing date: 2020-11-17
Publication date: 2021-12-07

Abstract

The invention discloses an order processing method and device, and relates to the field of warehouse logistics. One embodiment of the method comprises: when the first order is monitored to be located at a first processing node currently, a first receiving address and first item details in the information of the first order are obtained; filtering a second order set, wherein the receiving address is in a first receiving address preset range and the item details and the first item details accord with preset conditions, from a first order set currently located in a second processing node on the basis of the first receiving address and the first item details; calculating the priority of each order in the second order set, determining the second order with the highest priority and the matched item details of the first order, and sending the matched item details to a distribution station terminal corresponding to the first order so as to process the items in the first order at the distribution station terminal and obtain the packages corresponding to the matched item details. The method and the system can quickly process rejected orders, reduce reverse cost and improve distribution efficiency.

Description

Order processing method and device

Technical Field

The invention relates to the field of warehouse logistics, in particular to an order processing method and device.

Background

The Supply Chain Management technology (SCM) includes five basic contents of planning, purchasing, manufacturing, delivering and returning, wherein one branch of the returning process is rejection returning, the package is not split, the items in the order are complete, and the secondary sale can be realized without processing.

The rejected orders in the existing flow cannot enter a finished state or be deleted or moved to a historical order database, so that a large amount of storage space is occupied. And as the number of rejected orders continues to increase, the speed of querying valuable orders becomes very slow.

In addition, rejected orders need to be returned to the warehouse for processing, and an express receiving party can only return goods after receiving the rejected orders, so that the whole logistics cycle is prolonged, and the reverse flow is too long; the order issuer can perform secondary processing only after receiving the rejected order, resulting in higher processing cost.

Disclosure of Invention

In view of this, embodiments of the present invention provide an order processing method and apparatus, which can at least solve the problem that the rejected order needs to be returned to the warehouse for processing in the existing return flow.

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

when the first order is monitored to be located at a first processing node currently, a first receiving address and first item details in the information of the first order are obtained;

filtering out a second order set, wherein the receiving address is in a preset range of the first receiving address and the item details and the first item details accord with preset conditions, from a first order set currently located in a second processing node based on the first receiving address and the first item details; wherein the second processing node is located before the first processing node in the order processing process;

calculating the priority of each order in the second order set, determining the second order with the highest priority and the matched item detail of the first order, and sending the matched item detail to a distribution station terminal corresponding to the first order so as to process the items in the first order through the distribution station terminal and obtain the packages corresponding to the matched item detail.

Optionally, the receiving address is in the preset range of the first receiving address, and includes: the distance between the delivery address and the first delivery address is smaller than a preset length value and/or is in the same distribution unit area.

Optionally, the item details include an item number;

the item details and the first item details meet preset conditions, including: and for any order in the first order set, acquiring all item numbers in any order information, wherein at least one item number in all the item numbers is the same as at least one item number in the first item number.

Optionally, the item details further include item demand;

at least one of the item numbers is the same as at least one of the item numbers in the first item number, including: the first item number comprises all the item numbers, and the item demand of each item number is less than or equal to the first item demand.

Optionally, the first item number includes all the item numbers, and the item demand is less than or equal to the first item demand, including: the number of all the goods is the same as the number of the first goods, and the goods demand of each goods number is equal to the first goods demand.

Optionally, the calculating the priority of each order in the second order set includes:

for any order in the second order set, calculating a first matching degree of the item details of the any order and the first item details;

calculating a second matching degree of the order placing address of any order and the first receiving address;

calculating a third matching degree of the expected receiving time of any order and the secondary processing finishing time of the order; the time for finishing the secondary processing of the order is the time for finishing the secondary processing of the terminal of the distribution station after the order is rejected;

and carrying out weighted summation on the first matching degree, the second matching degree and the third matching degree to obtain the priority of any order.

Optionally, the calculating a first matching degree between the item details of any one of the orders and the first item details includes:

acquiring the item number and the item demand of each item in any order, determining the item number matched with the first order, and acquiring the matched item demand corresponding to each matched item number in the first order;

calculating the ratio of the number of the matched item numbers in the total number of the item numbers of any order and the ratio of the required quantity of each matched item in the required quantity of the item in any order;

and multiplying the proportion to obtain a first matching degree of the item details of any order and the first item details.

Optionally, the calculating a second matching degree between the order placing address of any order and the first receiving address includes:

determining a linear distance between an order placing address of any order and the first receiving address, and calculating a ratio of the linear distance to the maximum value of the preset range;

and subtracting the difference value of the ratio from a preset value to serve as a second matching degree between the order placing address and the first receiving address of any order.

Optionally, the calculating a third matching degree between the expected receiving time of any one of the orders and the secondary package processing completion time includes:

determining the sum of the time for finishing the secondary processing of the order and the time for transporting the order to the receiving address of any order, and calculating the difference value obtained by subtracting the determined sum from the expected receiving time;

and calculating the ratio of the difference value to the longest storage time threshold of a preset order at a distribution station terminal, and taking the ratio as a third matching degree of the expected delivery address and the time of finishing the secondary processing of the order.

Optionally, the sending the matching item details to a distribution station terminal corresponding to the first order to process the item in the first order through the distribution station terminal, so as to obtain a package corresponding to the matching item details, including:

if the matched item details are consistent with all item details of the second order, determining that the second order does not need to be split;

otherwise, splitting the second order into a third order and a fourth order; the item details of the third order are the matched item details, and the item details of the fourth order are the remaining item details of the second order after the matched item details are removed from all the item details;

and sending the second order which does not need to be split or the split third order to a delivery station terminal corresponding to the first order so as to process the articles in the first order at the delivery station terminal and obtain a package corresponding to the second order or the third order.

Optionally, after splitting the second order into a third order and a fourth order, the method further includes: and judging whether a production order corresponding to the second order exists at present, and if so, updating the item details of the production order based on the item details in the fourth order.

To achieve the above object, according to another aspect of the embodiments of the present invention, there is provided an order processing apparatus including:

the detection module is used for acquiring a first receiving address and first article details in the information of the first order when the first order is monitored to be located at a first processing node;

the screening module is used for filtering out a second order set, wherein the receiving address is in a preset range of the first receiving address, and the item details and the first item details accord with preset conditions, from a first order set currently located in a second processing node based on the first receiving address and the first item details; wherein the second processing node is located before the first processing node in the order processing process;

and the processing module is used for calculating the priority of each order in the second order set, determining the second order with the highest priority and the matched item detail of the first order, and sending the matched item detail to the distribution station terminal corresponding to the first order so as to process the items in the first order through the distribution station terminal and obtain the packages corresponding to the matched item detail.

Optionally, the screening module is configured to: the distance between the delivery address and the first delivery address is smaller than a preset length value and/or is in the same distribution unit area.

Optionally, the item details include an item number;

the screening module is used for: and for any order in the first order set, acquiring all item numbers in any order information, wherein at least one item number in all the item numbers is the same as at least one item number in the first item number.

Optionally, the item details further include item demand;

the screening module is used for: the first item number comprises all the item numbers, and the item demand of each item number is less than or equal to the first item demand.

Optionally, the screening module is configured to: the number of all the goods is the same as the number of the first goods, and the goods demand of each goods number is equal to the first goods demand.

Optionally, the processing module is configured to:

Optionally, the processing module is configured to: determining a linear distance between an order placing address of any order and the first receiving address, and calculating a ratio of the linear distance to the maximum value of the preset range;

Optionally, the processing module is configured to: determining the sum of the time for finishing the secondary processing of the order and the time for transporting the order to the receiving address of any order, and calculating the difference value obtained by subtracting the determined sum from the expected receiving time;

Optionally, the processing module is configured to: if the matched item details are consistent with all item details of the second order, determining that the second order does not need to be split;

Optionally, the processing module is further configured to: and judging whether a production order corresponding to the second order exists at present, and if so, updating the item details of the production order based on the item details in the fourth order.

To achieve the above object, according to still another aspect of the embodiments of the present invention, an order processing electronic device is provided.

The electronic device of the embodiment of the invention comprises: one or more processors; a storage device, configured to store one or more programs, which when executed by the one or more processors, cause the one or more processors to implement any of the order processing methods described above.

To achieve the above object, according to a further aspect of the embodiments of the present invention, there is provided a computer readable medium having a computer program stored thereon, the program, when executed by a processor, implementing any of the order processing methods described above.

According to the scheme provided by the invention, one embodiment of the invention has the following advantages or beneficial effects: the rejected orders are matched with the packed orders which are not taken out of the warehouse currently, the orders with the highest matching degree and priority level are selected from the rejected orders, and secondary processing can be achieved without returning to an order delivery party through an express delivery receiving party, so that the order processing completion degree is improved, the reverse flow processing pressure of the warehouse is reduced, and meanwhile logistics cost and the occupation of storage space are reduced.

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 flow chart of an order processing method according to an embodiment of the present invention;

FIG. 2 is a schematic flow chart of calculating order priority according to an embodiment of the invention;

FIG. 3 is a flow diagram illustrating an alternative method of order processing according to an embodiment of the invention;

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

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

FIG. 6 is a schematic block diagram of a computer system suitable for use with a mobile device or server implementing 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.

Referring to fig. 1, a main flowchart of an order processing method according to an embodiment of the present invention is shown, which includes the following steps:

s101: when the first order is monitored to be located at a first processing node currently, a first receiving address and first item details in the information of the first order are obtained;

s102: filtering out a second order set, wherein the receiving address is in a preset range of the first receiving address and the item details and the first item details accord with preset conditions, from a first order set currently located in a second processing node based on the first receiving address and the first item details; wherein the second processing node is located before the first processing node in the order processing process;

s103: calculating the priority of each order in the second order set, determining the second order with the highest priority and the matched item detail of the first order, and sending the matched item detail to a distribution station terminal corresponding to the first order so as to process the items in the first order through the distribution station terminal and obtain the packages corresponding to the matched item detail.

In the above embodiment, the supply chain management technique refers to a management method for efficiently organizing suppliers, manufacturers, warehouses, distribution centers, distributors, and the like together to manufacture, transfer, distribute, and sell products in order to minimize the overall supply chain system cost under the condition that a certain service level is satisfied in steps S101 and S102. This scheme mainly relates to delivery logistics field.

After detecting that the package is rejected (i.e. the first processing node), the system extracts an order number from the information of the package, and an order corresponding to the order number is called a first order.

The information of the first order comprises a first receiving address and first article details, and a second order set, in which the receiving address and the first receiving address are in a preset range and the article details and the first article details accord with preset conditions, is screened/filtered from a first order set of a same merchant which is not packaged and delivered out of a warehouse currently (namely a second processing node, and the second processing node is positioned before the first processing node in an order processing process); the unpacked ex-warehouse does not include packed orders, the packed orders represent that ex-warehouse is about to occur, and if unpacking is performed again, various costs are high.

If the second order set is not acquired, the acquisition may continue to be attempted after the wait time has elapsed. If not, the original delivery place is returned according to the existing return flow, if the merchant delivers the goods, the original delivery place is returned to the merchant, and if the warehouse of the self-supporting order delivers the goods, the original delivery place is returned to the warehouse, so that the problem that the actual cost is higher than that of directly returning the goods and then sending a new package due to overlong waiting time is solved. The waiting time can be set manually, and can also be obtained by comprehensively considering the goods returning transportation cost and the storage cost of the waiting time at the terminal of the distribution station through an algorithm.

It should be noted that the shipping addresses of the first order and the unpacked outbound order need not be determined here, and the items required for both may be sent from different shipping addresses. For example, warehouse 1 and warehouse 2 both produce item a, and assuming that rejected order 1 contains item a, a first order set that has not been packed out of the warehouse is grabbed, and the receiving address is closer to order 1 and the desired item is also order 2 for item a. If the order 2 is originally produced in the warehouse 2, the rejected items can be converted by adopting the scheme, and the warehouse 2 may not produce the item a required by the order 2 at this time.

Wherein, the shipping address is in the preset range of the first shipping address of the first order, including:

1) the distance between the receiving address and the first receiving address is smaller than a preset length value; the distance can be a straight line distance or a route distance based on a map; and/or

2) The delivery address is located in the same delivery unit area as the first delivery address, for example, in the delivery range of the same delivery station terminal and the coverage of the same final sorting center, where the final sorting center refers to the last logistics node of the delivery station terminal, and packages are sorted to the delivery station terminals through the final sorting center.

The preset range can be set manually, for example, the heat of the articles in the package is comprehensively considered through an algorithm, if the heat of the articles is high, the number of representative orders is large, the range can be properly reduced, and the cost is reduced under the condition of ensuring the matching rate; if the heat of the article is low, the range can be expanded appropriately, and the matching rate can be increased.

Wherein, the article detail accords with preset conditions with the first article detail of first order, includes: considering the condition that the first order is not split, for any one unpacked order in the current unpacked first order set, at least one item number in all item numbers is the same as at least one item number of the first item number in the first order. For example, if order 1 includes item a and order 2 includes item a and item b, then order 2 is determined to be eligible and a second order set is added.

As a special case of the preset condition, for a certain unpacked ex-warehouse order in the first order set, all item numbers exist in the first item number of the first order, and the item demand of all item numbers is less than or equal to the first item quantity in the first order. Through the limiting mode, the splitting probability of the second order is reduced, the order production efficiency is improved, and the matching probability is reduced to a certain extent due to the fact that the number of matched orders is reduced.

For example, if the order 1 includes an item a and the demand of the item a is 1, and the order 2 includes an item a and an item b, and the demand of the item a is 2, it is determined that the order 2 meets the condition and is added to the second order set.

As a special case of the above limitation, for a certain unpacked outbound order in the first order set, all item numbers are identical to the first item number of the first order, and the item demand amounts of all item numbers are equal to the first item amount in the first order. By this limiting, the second order need not be split and the package of the first order can be shipped directly to the user of the second order.

For step S103, the priority of each order in the second order set is calculated to update the second order set in order from high to low according to the order priority. And selecting the second order in the first order, and calculating the details of the matched items with the first order, including the number of the matched items and the quantity of the matched items, because only the first order in the second order set can occupy the items in the first order.

For example, rejected order 1 includes item a, the number of items is 1, order 2 and order 3, which have not been produced yet and have a receiving address close to that of order 1 and also are the items of the order a, are captured, the matching item number of order 2 is item a, the number of matching items is 1, the matching item number of order 3 is item a, the number of matching items is 0, and finally order 2 is selected.

After determining the item details matched between the second order and the first order, the item details may be compared with all item details included in the second order, so as to determine whether to split the second order according to a comparison result, which is specifically shown in subsequent fig. 3 and will not be described herein again.

The method provided by the embodiment enables the rejected order to be rapidly processed secondarily, can reduce reverse cost and improve delivery efficiency, can also reduce operators in the reverse direction of the warehouse, and releases manpower to pick, pack and deliver the forward packages.

Referring to fig. 2, a schematic flow chart of an alternative order processing method according to an embodiment of the present invention is shown, which includes the following steps:

s201: for any order in the second order set, calculating a first matching degree of the item details of the any order and the first item details of the first order;

s202: calculating a second matching degree of the order placing address of any order and the first receiving address of the first order;

s203: calculating a third matching degree of the expected receiving time of any order and the secondary processing finishing time of the order; the time for finishing the secondary processing of the order is the time for finishing the secondary processing of the terminal of the distribution station after the order is rejected;

s204: and carrying out weighted summation on the first matching degree, the second matching degree and the third matching degree to obtain the priority of any order.

In the above embodiment, the present embodiment is used to describe how to calculate the priority of each order in the second order set for steps S201 to S204. The priority is obtained by weighted calculation according to various data of the order, wherein the various data comprise the matching degree of the details of the order and the details of the first item in the first order, the relation between the order placing address and the first receiving address in the first order, the relation between the expected receiving time of the order and the secondary processing finishing time of the package, other information of the order, such as user information and the like.

Such as: the priority is x, the matching degree priority value of the order item details and the first order item details is + y, the relation priority value of the order placing address and the first order receiving address is + z, and the relation priority value of the expected receiving time of the order and the secondary processing finishing time of the package is obtained. And x \ y \ z is a preset weight value and is adjusted according to the actual operation condition.

1) Calculating a first matching degree of the order item details and the first item details in the first order

The first matching degree means that if the item details of a certain order are identical to the first item details of the first order, that is, the item number and the corresponding demand are identical, the matching degree is 1, and if the item numbers and the corresponding demand are completely different, the matching degree is 0, which of course does not exist because the order of that kind has been filtered before.

The calculation formula is as follows: (number of skus hit/number of sku hit in second order) × (required amount of sku hit in first order/required amount of sku hit in second order)

For example, rejected order 1 includes item a, demand 1, item b, demand 2, and order 2, order 3, which has a shipping address close to order 1 in the first order set that has not yet been produced and the order item is also item a, wherein:

order 2 includes items sku1 (demand 3), sku2 (demand 2), and sku 3;

order 3 includes items sku1 (demand 2) and sku2 (demand 4);

the matching degree between the item details of order 2 and the item details of order 1 (hit sku number 2/sku number 3 of order 2) × (each hit sku requires a required amount of order 1/required amount of that sku in order 2) × (2/3) × (1/3) × (2/2) ═ 2/9;

the matching degree between the item details of order 3 and the item details of order 1 (2 hit sku counts/2 sku counts of order 3) × (the required amount of sku in order 1/the required amount of sku in order 3 for each hit sku) × (2/2) × (1/2) × (2/4) × (1/4).

2) Calculating a second matching degree between the order placing address of the order and the first receiving address in the first order

The second matching degree may be a relationship between an order placing address and a first receiving address of the first order, or a relationship between a distribution station terminal point corresponding to the order placing address and a distribution station terminal point corresponding to the first receiving address, where the smaller the distance, the higher the matching degree of the item.

The calculation formula is as follows: preset value (e.g., 1) -maximum value of straight distance/preset range between order placement address and first shipping address. If the straight-line distance between the order placing address and the first order address is 0, the matching degree is 1; and if the straight-line distance between the order placing address and the first order address is equal to the maximum value of the preset range, the matching degree is 0.

It should be noted that, screening out the second order set that the relationship between the shipping address and the first shipping address is within the preset range and the item details and the first item details meet the preset conditions is only a preliminary screening to take the order within the preset range as the order to be selected. The step is to calculate the distance matching degree of the to-be-selected order and the first order, the closer the distance is, the more convenient the replacement is, and the value of the corresponding matching degree is higher.

3) Calculating a third matching degree between the expected receiving time of the order and the time of finishing the secondary processing of the package

The third matching degree means that if the matching degree of the expected receiving time of the order and the secondary processing finish time of the package is the highest, the matching degree is higher; the secondary processing finishing time of the packages refers to the time after the packages are returned to the terminal of the distribution station for secondary processing after being rejected, is obtained according to the rejection time of the packages and the average secondary processing time of the historical packages, and is obtained by comprehensive calculation according to the expected receiving time, the secondary processing finishing time of the packages and the time length of the packages transported to the order receiving address.

Taking an order in the second order set as an example, if the time for completing the secondary processing of the package plus the time for transporting the package to the order is equal to the expected receiving time of the order, the matching degree of the item is 1, which indicates that the package can be directly delivered to the receiving address of the order without consuming the storage cost of the terminal of the delivery station.

And if the time for finishing the secondary processing of the packages, the time for transporting the packages to the order and the preset longest storage time threshold value of the packages at the terminal of the delivery station are equal to the expected receiving time of the order, the matching degree is 0.

If the time the package has been reprocessed + the length of time the package has been shipped to the order is greater than the expected time to receive the order, the order is removed directly from the second order set because the order cannot be filled to the delivery destination before the expected time to receive the order.

The calculation formula is then [ expected delivery time- (package post-processing time + time for package delivery to order delivery address) ]/preset maximum storage time threshold for the package at the terminal of the delivery station.

4) Other information of the order, such as user information, is higher in priority if the user account is higher in rank. Of course, the specific options are not limited to user information, nor are the specific formulas.

The method provided by the embodiment considers the factors of the orders which are not taken out of the warehouse from the aspects of order item details, order placing addresses, expected receiving time of the orders and the like, so that the matching degree of the orders with the first orders is calculated more accurately and comprehensively.

Referring to fig. 3, a schematic flow chart of an alternative order processing method according to an embodiment of the present invention is shown, which includes the following steps:

s301: when the first order is monitored to be located at a first processing node currently, a first receiving address and first item details in the information of the first order are obtained;

s302: filtering out a second order set, wherein the receiving address is in a preset range of the first receiving address and the item details and the first item details accord with preset conditions, from a first order set currently located in a second processing node based on the first receiving address and the first item details; wherein the second processing node is located before the first processing node in the order processing process; (ii) a

S303: calculating the priority of each order in the second order set, and determining the matched item details of the second order with the highest priority and the first order;

s304: if the matched item details are consistent with all item details of the second order, determining that the second order does not need to be split;

s305: otherwise, splitting the second order into a third order and a fourth order; the item details of the third order are the matched item details, and the item details of the fourth order are the remaining item details of the second order after the matched item details are removed from all the item details;

s306: and sending the second order which does not need to be split or the split third order to a distribution station terminal corresponding to the first order, so as to process the articles in the first order through the distribution station terminal, and obtain a package corresponding to the second order or the third order.

In the above embodiment, the descriptions of steps S101 to S103 shown in fig. 1 can be referred to for steps S301 to S303, and are not repeated herein.

In the above embodiment, for steps S304 to S306, it is determined whether the second order needs to be split according to the matching item details and all item details in the second order;

1) if the matching item details are consistent with the detail information of all item numbers of the second order, determining that the second order does not need to be split;

2) otherwise, splitting the second order into two orders according to the details of the matched articles: a third order and a fourth order; and all the item details of the third order are matched item details, and all the item details of the fourth order are the remaining item details obtained by subtracting the matched item details from all the item details of the second order.

And sending the calculated second order or third order to a terminal point terminal of the distribution station corresponding to the first order, so that terminal point personnel of the distribution station can unpack, distribute and pack the first order again according to the order information to generate a package corresponding to the second order or the third order.

In addition, whether the second order has a corresponding production order (representing that the order enters a warehouse for production) can be judged; and if the second order already has a corresponding production order, updating the item details of the production order into all the item details in the fourth order.

The method provided by the embodiment fully considers whether the second order needs to be split or not, so that different operations are carried out at the terminal of the distribution station, and the condition that the articles in the second order can reach the user through different channels is guaranteed to the maximum extent.

According to the method provided by the embodiment of the invention, the rejected packages are matched with the orders which are not delivered from the warehouse in the same area, so that the rejected packages/orders processing speed is increased, the reverse flow processing pressure of the warehouse is reduced, and the logistics cost is reduced. The scheme is particularly suitable for the large promotion period, the distribution efficiency is improved, the reverse cost is reduced, reverse operators of a warehouse in the large promotion period are reduced, and manpower is released to carry out forward package sorting, packaging and delivery.

Meanwhile, the scheme is also suitable for third-party merchants (such as online operators who do not have good luck), because most of the third-party merchants only have one delivery place. By the scheme, value-added service can be provided, if a certain package is rejected, other orders near the order receiving address can be matched, and the other orders are certain orders in the order to be sent of the same merchant and then are transported. Therefore, the operation loss of a third-party merchant is reduced, the operation enthusiasm of the merchant is improved, and the competitiveness of the online operation platform in the non-direct-operation market field is improved. Since the third party merchant's order is mostly a single item (an order contains only one item number), it is more suitable for this logic and can be matched quickly. The scheme is also very suitable for high-value articles such as mobile phones, wines and the like, and can reduce the loss of the articles in the transportation process.

Referring to fig. 4, a schematic diagram of main modules of an order processing apparatus 400 according to an embodiment of the present invention is shown, including:

the detecting module 401 is configured to, when it is monitored that a first order is currently located at a first processing node, obtain a first receiving address and first item details in information of the first order;

a filtering module 402, configured to filter, based on the first shipping address and the first item details, a second order set in which the shipping address is in a preset range of the first shipping address and the item details and the first item details meet preset conditions from a first order set currently located in a second processing node; wherein the second processing node is located before the first processing node in the order processing process;

a processing module 403, configured to calculate a priority of each order in the second order set, determine a second order with a highest priority and matching item details of the first order, send the matching item details to a distribution station terminal corresponding to the first order, so as to process, by using the distribution station terminal, an item in the first order, and obtain a package corresponding to the matching item details.

In the apparatus for implementing the present invention, the screening module 402 is configured to: the distance between the delivery address and the first delivery address is smaller than a preset length value and/or is in the same distribution unit area.

In the implementation device of the invention, the article details comprise article numbers;

the screening module 402 is configured to: and for any order in the first order set, acquiring all item numbers in any order information, wherein at least one item number in all the item numbers is the same as at least one item number in the first item number.

In the implementation device of the invention, the article details further comprise article demand;

the screening module 402 is configured to: the first item number comprises all the item numbers, and the item demand of each item number is less than or equal to the first item demand.

In the apparatus for implementing the present invention, the screening module 402 is configured to: the number of all the goods is the same as the number of the first goods, and the goods demand of each goods number is equal to the first goods demand.

In the device for implementing the present invention, the processing module 403 is configured to:

and judging whether a production order corresponding to the second order exists at present, and if so, updating the item details of the production order based on the item details in the fourth order.

In addition, the detailed implementation of the device in the embodiment of the present invention has been described in detail in the above method, so that the repeated description is not repeated here.

Fig. 5 illustrates an exemplary system architecture 500 to which embodiments of the invention may be applied.

As shown in fig. 5, the system architecture 500 may include

terminal devices

501, 502, 503, a network 504, and a server 505 (by way of example only). The network 504 serves to provide a medium for communication links between the

terminal devices

501, 502, 503 and the server 505. Network 504 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.

The user may use the

terminal devices

501, 502, 503 to interact with a server 505 over a network 504 to receive or send messages or the like. Various communication client applications may be installed on the

terminal devices

501, 502, 503.

The

terminal devices

501, 502, 503 may be various electronic devices having display screens and supporting web browsing, and the server 505 may be a server providing various services.

It should be noted that the method provided by the embodiment of the present invention is generally executed by the server 505, and accordingly, the apparatus is generally disposed in the server 505.

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

Referring now to FIG. 6, a block diagram of a computer system 600 suitable for use with a terminal device implementing an embodiment of the invention is shown. The terminal device shown in fig. 6 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. 6, the computer system 600 includes a Central Processing Unit (CPU)601 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage section 608 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data necessary for the operation of the system 600 are also stored. The CPU 601, ROM 602, and RAM 603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.

The following components are connected to the I/O interface 605: an input portion 606 including a keyboard, a mouse, and the like; an output portion 607 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 608 including a hard disk and the like; and a communication section 609 including a network interface card such as a LAN card, a modem, or the like. The communication section 609 performs communication processing via a network such as the internet. The driver 610 is also connected to the I/O interface 605 as needed. A removable medium 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 610 as necessary, so that a computer program read out therefrom is mounted in the storage section 608 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 product 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 may be downloaded and installed from a network through the communication section 609, and/or installed from the removable medium 611. The computer program performs the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 601.

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 program products 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 comprises a detection module, a screening module and a processing module. Where the names of these modules do not in some cases constitute a limitation on the module itself, for example, a screening module may also be described as a "screening order module".

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, cause the device to comprise:

According to the technical scheme of the embodiment of the invention, the rejected order can be rapidly processed for the second time through the matching of the rejected order and the current order which is not taken out of the warehouse, so that the order processing speed is improved, the reverse flow processing pressure of the warehouse is reduced, and the logistics cost is reduced. If in a short period, the scheme is used, so that the distribution efficiency is improved, the reverse cost is reduced, the personnel for reverse operation of the storehouse can be reduced, and manpower is released to pick, pack and deliver the forward packages.

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. An order processing method, comprising:

2. The method of claim 1, wherein the shipping address is within the first shipping address preset range, comprising: the distance between the delivery address and the first delivery address is smaller than a preset length value and/or is in the same distribution unit area.

3. The method of claim 1, wherein the item details comprise an item number;

4. The method of claim 3, wherein the item details further include an item demand;

5. The method of claim 4, wherein the first item number includes all item numbers and the item demand is less than or equal to a first item demand, comprising: the number of all the goods is the same as the number of the first goods, and the goods demand of each goods number is equal to the first goods demand.

6. The method of claim 1, wherein calculating the priority of each order in the second order set comprises:

7. The method of claim 6, wherein said calculating a first degree of match of the item details of said any order with said first item details comprises:

8. The method of claim 6, wherein said calculating a second degree of match between the order placement address and the first shipping address for said any order comprises:

9. The method of claim 6, wherein said calculating a third degree of match between expected ship-to time and package post-processing time for said any one order comprises:

10. The method of claim 1, wherein sending the matching item details to a distribution station terminal corresponding to the first order for processing of the items in the first order by the distribution station terminal to obtain a package corresponding to the matching item details comprises:

11. The method of claim 10, further comprising, after splitting the second order into a third order and a fourth order:

12. An order processing apparatus, comprising:

13. An electronic device, comprising:

one or more processors;

a storage device for storing one or more programs,

when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-11.

14. 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-11.