Order processing method, device, storage medium and server

Abstract

The present disclosure provides a method, device, storage medium and server for order processing, which belongs to the field of computer technology. The method includes: when performing order processing, target orders can be periodically obtained, wherein the target orders include orders that are not currently assigned to delivery personnel and orders that are currently assigned to delivery personnel but have not been confirmed by the delivery personnel, and a list of candidate delivery personnel corresponding to each order in the target orders is determined. For each order in the target orders, the delivery personnel corresponding to the order is assigned in the list of candidate delivery personnel corresponding to the order, and the updated list of candidate delivery personnel is stored, wherein the updated list of candidate delivery personnel is a list after deleting the delivery personnel corresponding to the order from the list of candidate delivery personnel corresponding to the order, and when the delivery personnel corresponding to the order refuses to deliver the order, the delivery personnel corresponding to the order is reallocated in the list of candidate delivery personnel corresponding to the order currently stored. The present disclosure can improve the efficiency of order processing.

Description

Technical Field

[0001] The present disclosure relates to the field of computer technology, and in particular to an order processing method, device, storage medium and server. Background Art

[0002] With the development of computer technology and network technology, people's lives are becoming more and more convenient. People can install food delivery applications on their terminals and then place orders. The background server of the food delivery application will assign a delivery person to the order, and the assigned delivery person will deliver the food.

[0003] In the related technology, whenever the backend server receives an order, the most suitable deliveryman is selected from all the deliverymen corresponding to the order, and the deliveryman delivers the order. If the deliveryman refuses to deliver the order, all the deliverymen corresponding to the order are retrieved again, and the most suitable deliveryman is selected from all the deliverymen.

[0004] Every time a deliveryman refuses to deliver an order, all deliverymen need to be retrieved and recalculated, resulting in low order processing efficiency. Summary of the invention

[0005] In order to solve the problem of low order processing efficiency, the embodiment of the present disclosure provides an order processing method, device, storage medium and server. The technical solution is as follows:

[0006] In a first aspect, a method for order processing is provided, the method comprising:

[0007] Periodically acquiring target orders, wherein the target orders include orders for which no delivery personnel are currently assigned and orders for which delivery personnel are currently assigned but have not been confirmed by the delivery personnel;

[0008] Determine a list of candidate delivery personnel corresponding to each order in the target order;

[0009] For each order in the target order, assign the deliveryman corresponding to the order in the candidate deliveryman list corresponding to the order, and store the updated candidate deliveryman list, wherein the updated candidate deliveryman list is a list after deleting the deliveryman corresponding to the order from the candidate deliveryman list corresponding to the order;

[0010] In the event that the delivery person corresponding to the order refuses to deliver the order, the delivery person corresponding to the order is reallocated from the list of candidate delivery persons corresponding to the order currently stored.

[0011] Optionally, the method further includes:

[0012] Determine that the delivery person corresponding to the order refuses to deliver the order, using one of the following methods:

[0013] Upon receiving a rejection message sent by a terminal of the delivery person corresponding to the order, determining that the delivery person corresponding to the order refuses to deliver the order;

[0014] If no rejection message or approval message is received from the terminal within a first period of time after a delivery notification is sent to the terminal of the delivery person corresponding to the order, it is determined that the delivery person corresponding to the order refuses to deliver the order.

[0015] Optionally, for each order of the target order, allocating a delivery person corresponding to the order from the list of candidate delivery persons corresponding to the order includes:

[0016] Determine the delivery score of each delivery person in the candidate delivery person list corresponding to each order in the target order;

[0017] A deliveryman is assigned to each order according to the delivery score of each deliveryman in the candidate deliveryman list corresponding to each order.

[0018] Optionally, allocating a delivery person to each order according to the delivery score of each delivery person in the candidate delivery person list corresponding to each order includes:

[0019] Selecting the first deliveryman corresponding to each order in the candidate deliveryman list corresponding to each order in the target order, wherein for any order, the first deliveryman is the deliveryman with the highest delivery score in the candidate deliveryman list corresponding to any order;

[0020] If there are identical couriers among the first couriers corresponding to the orders, assigning couriers to the orders according to the delivery scores of the couriers in the candidate couriers list corresponding to the orders;

[0021] If there is no identical deliveryman among the first deliverymen corresponding to the orders, then for any order, the first deliveryman corresponding to any order is determined as the deliveryman for any order.

[0022] Optionally, allocating a delivery person to each order according to the delivery score of each delivery person in the candidate delivery person list corresponding to each order includes:

[0023] Determine the target delivery person with the highest delivery score among the first delivery persons corresponding to all orders in the target order;

[0024] Determine the target delivery person as the delivery person for a first order, wherein the first order is an order corresponding to a list of candidate delivery persons to which the target delivery person belongs;

[0025] The process of determining the delivery score of each delivery person in the list of candidate delivery persons corresponding to other orders in the target order except the first order is re-executed.

[0026] Optionally, determining the delivery score of each delivery person in the candidate delivery person list corresponding to each order in the target order includes:

[0027] Determine the first dimension score, the second dimension score, and the third dimension score of each deliveryman in the candidate deliveryman list corresponding to each order in the target order, and determine the delivery score of each deliveryman according to the first dimension score, the second dimension score, and the third dimension score of each deliveryman;

[0028] Among them, the first dimension score is the score of the order dimension, the second dimension score is the score of the deliveryman dimension, and the third dimension score is the score of the route planning dimension.

[0029] Optionally, for each deliveryman, the first dimension score of the deliveryman is determined by the priority of the order corresponding to the list of candidate deliverymen to which the deliveryman belongs and the time it takes to receive the order, the second dimension score of the deliveryman is determined by the level of the deliveryman and the number of orders that the deliveryman currently has not completed, and the third dimension score of the deliveryman is determined by the first increment, the second increment and the en route coefficient, the first increment being the increment of the delivery distance after the deliveryman accepts the order corresponding to the list of candidate deliverymen to which the deliveryman belongs, and the second increment being the increment of the delivery time after the deliveryman accepts the order corresponding to the list of candidate deliverymen to which the deliveryman belongs.

[0030] Optionally, in the case where the delivery person corresponding to the order refuses to deliver the order, reallocating the delivery person corresponding to the order from the currently stored list of candidate delivery persons corresponding to the order includes:

[0031] If it is determined that the delivery person corresponding to the order refuses to deliver the order, determine the time from the current moment to the next periodic order processing;

[0032] If the duration is greater than the second duration, a delivery person corresponding to the order is reselected from the list of candidate delivery persons corresponding to the order currently stored.

[0033] Optionally, the method further includes:

[0034] If the duration is less than or equal to the second duration, obtain the list of candidate delivery personnel for the order obtained in the next periodic order dispatching process, and reselect the delivery personnel corresponding to the order from the list of candidate delivery personnel for the order obtained in the next periodic order dispatching process.

[0035] Optionally, determining a list of candidate delivery personnel corresponding to each order in the target order includes:

[0036] For each order in the target order, determining the distance between the merchant and the delivery person in the order;

[0037] The couriers whose distance is less than the target value are included in the candidate couriers list corresponding to the order.

[0038] In a second aspect, a device for order processing is provided, the device comprising:

[0039] An acquisition module, used for periodically acquiring target orders, wherein the target orders include orders for which no delivery personnel are currently assigned and orders for which delivery personnel are currently assigned but have not been confirmed by the delivery personnel;

[0040] A determination module, used to determine a list of candidate delivery personnel corresponding to each order in the target order;

[0041] An allocation module, configured to allocate, for each order in the target order, a delivery person corresponding to the order from a list of candidate delivery persons corresponding to the order;

[0042] A storage module, used for storing an updated list of candidate delivery personnel, wherein the updated list of candidate delivery personnel is a list after deleting the delivery personnel corresponding to the order from the list of candidate delivery personnel corresponding to the order;

[0043] The allocation module is further configured to reallocate a delivery person corresponding to the order from a currently stored list of candidate delivery persons corresponding to the order when the delivery person corresponding to the order refuses to deliver the order.

[0044] Optionally, the determining module is further used to:

[0045] Determine that the delivery person corresponding to the order refuses to deliver the order, using one of the following methods:

[0046] Upon receiving a rejection message sent by a terminal of the delivery person corresponding to the order, determining that the delivery person corresponding to the order refuses to deliver the order;

[0047] If no rejection message or approval message is received from the terminal within a first period of time after a delivery notification is sent to the terminal of the delivery person corresponding to the order, it is determined that the delivery person corresponding to the order refuses to deliver the order.

[0048] Optionally, the allocation module is used to:

[0049] Determine the delivery score of each delivery person in the candidate delivery person list corresponding to each order in the target order;

[0050] A deliveryman is assigned to each order according to the delivery score of each deliveryman in the candidate deliveryman list corresponding to each order.

[0051] Optionally, the allocation module is used to:

[0052] Selecting the first deliveryman corresponding to each order in the candidate deliveryman list corresponding to each order in the target order, wherein for any order, the first deliveryman is the deliveryman with the highest delivery score in the candidate deliveryman list corresponding to any order;

[0053] If there are identical couriers among the first couriers corresponding to the orders, assigning couriers to the orders according to the delivery scores of the couriers in the candidate couriers list corresponding to the orders;

[0054] If there is no identical deliveryman among the first deliverymen corresponding to the orders, then for any order, the first deliveryman corresponding to any order is determined as the deliveryman for any order.

[0055] Optionally, the allocation module is used to:

[0056] Determine the target delivery person with the highest delivery score among the first delivery persons corresponding to all orders in the target order;

[0057] Determine the target delivery person as the delivery person for a first order, wherein the first order is an order corresponding to a list of candidate delivery persons to which the target delivery person belongs;

[0058] The process of determining the delivery score of each delivery person in the list of candidate delivery persons corresponding to other orders in the target order except the first order is re-executed.

[0059] Optionally, the allocation module is used to:

[0060] Determine the first dimension score, the second dimension score, and the third dimension score of each deliveryman in the candidate deliveryman list corresponding to each order in the target order, and determine the delivery score of each deliveryman according to the first dimension score, the second dimension score, and the third dimension score of each deliveryman;

[0061] Among them, the first dimension score is the score of the order dimension, the second dimension score is the score of the deliveryman dimension, and the third dimension score is the score of the route planning dimension.

[0062] Optionally, for each deliveryman, the first dimension score of the deliveryman is determined by the priority of the order corresponding to the list of candidate deliverymen to which the deliveryman belongs and the time it takes to receive the order, the second dimension score of the deliveryman is determined by the level of the deliveryman and the number of orders that the deliveryman currently has not completed, and the third dimension score of the deliveryman is determined by the first increment, the second increment and the en route coefficient, the first increment being the increment of the delivery distance after the deliveryman accepts the order corresponding to the list of candidate deliverymen to which the deliveryman belongs, and the second increment being the increment of the delivery time after the deliveryman accepts the order corresponding to the list of candidate deliverymen to which the deliveryman belongs.

[0063] Optionally, the allocation module is further used to:

[0064] If it is determined that the delivery person corresponding to the order refuses to deliver the order, determine the time from the current moment to the next periodic order processing;

[0065] If the duration is greater than the second duration, a delivery person corresponding to the order is reselected from the list of candidate delivery persons corresponding to the order currently stored.

[0066] Optionally, the allocation module is further used to:

[0067] If the duration is less than or equal to the second duration, obtain the list of candidate delivery personnel for the order obtained in the next periodic order dispatching process, and reselect the delivery personnel corresponding to the order from the list of candidate delivery personnel for the order obtained in the next periodic order dispatching process.

[0068] Optionally, the determining module is used to:

[0069] For each order in the target order, determining the distance between the merchant and the delivery person in the order;

[0070] The couriers whose distance is less than the target value are included in the candidate couriers list corresponding to the order.

[0071] In a third aspect, a computer-readable storage medium is provided, wherein a computer program is stored in the storage medium, and when the computer program is executed by a processor, the order processing method described in the first aspect is implemented.

[0072] In a fourth aspect, a server is provided, comprising a processor and a memory, wherein the memory is used to store computer programs; and the processor is used to execute the programs stored in the memory to implement the order processing method described in the first aspect.

[0073] The beneficial effects brought by the technical solution provided by the embodiments of the present disclosure include at least:

[0074] In the disclosed embodiment, when dispatching orders, target orders can be periodically obtained, wherein the target orders include orders that are not currently assigned to delivery personnel and orders that are currently assigned to delivery personnel but have not been confirmed by delivery personnel, and a list of candidate delivery personnel corresponding to each order in the target orders is determined. For each order in the target orders, the delivery personnel corresponding to the order is assigned from the list of candidate delivery personnel corresponding to the order, and an updated list of candidate delivery personnel is stored, wherein the updated list of candidate delivery personnel is a list after deleting the delivery personnel corresponding to the order from the list of candidate delivery personnel corresponding to the order, and when the delivery personnel corresponding to the order refuses to deliver the order, the delivery personnel corresponding to the order is reallocated from the list of candidate delivery personnel corresponding to the currently stored order. In this way, each time dispatching orders is performed, a list of candidate delivery personnel corresponding to the order is stored, and when the delivery personnel refuses to deliver the order, the stored list of candidate delivery personnel can be directly obtained and the delivery personnel can be reselected without having to reacquire all the delivery personnel, so that the order can be processed as quickly as possible, which can improve the efficiency of order processing. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0076] Figure 1 It is a schematic diagram of a process of an order processing method provided by an embodiment of the present disclosure;

[0077] Figure 2 is a display schematic diagram of an order allocation notification provided by an embodiment of the present disclosure;

[0078] Figure 3 is a schematic diagram of an order processing system provided by an embodiment of the present disclosure;

[0079] Figure 4 It is a flowchart of an order processing provided by an embodiment of the present disclosure;

[0080] Figure 5 is a structural schematic diagram of an order processing device provided by an embodiment of the present disclosure;

[0081] Figure 6 It is a structural diagram of a server provided in an embodiment of the present disclosure. DETAILED DESCRIPTION

[0082] In order to make the objectives, technical solutions and advantages of the present disclosure more clear, the embodiments of the present disclosure will be further described in detail below with reference to the accompanying drawings.

[0083] Before implementation, the application scenarios of the embodiments of the present disclosure and the noun concepts that may be involved in the embodiments of the present disclosure are first introduced:

[0084] The disclosed embodiments may be applied in order processing scenarios, such as order processing after online shopping, etc. After a user places an order online, a delivery person is selected for the order and notified to the delivery person, who can then deliver the items in the order.

[0085] The delivery person is responsible for delivering the ordered items to the ordering party.

[0086] A list of candidate couriers is a collection of couriers that can be selected for a certain order.

[0087] The embodiment of the present disclosure provides a method for order processing, and the execution subject of the method can be a server. The server can be a background server of a shopping application, or a server associated with the background server, which is specifically used for order processing, wherein the server may include a processor, a memory, a transceiver, etc. The processor can be used to process the process of order processing, such as selecting a delivery person, the memory can be used to store the data required and generated during the order processing, such as storing a list of candidate delivery persons, and the transceiver can be used to receive and send data, such as receiving orders and sending delivery notifications to the delivery person's terminal.

[0088] The present disclosure provides a method for order processing. Figure 1 As shown, the execution flow of this method can be as follows:

[0089] Step 101, periodically obtain target orders.

[0090] Among them, the target orders include orders that have not yet been assigned a deliveryman and orders that have been assigned a deliveryman but have not been confirmed by the deliveryman. Orders that have not yet been assigned a deliveryman refer to orders that have not yet been assigned a deliveryman. Orders that have been assigned a deliveryman but have not been confirmed by the deliveryman refer to orders that have been assigned a deliveryman and notified to the deliveryman, but the deliveryman has not yet decided whether to deliver the order. The cycle can be preset, such as 1 minute.

[0091] In practice, a user can install a shopping application in a terminal, log in to the shopping application using a registered account and password, and then place an order to purchase items. After the transaction is completed, the terminal where the shopping application is located can send order information to the backend server of the shopping application (hereinafter referred to as the server). In this way, the server can receive multiple orders.

[0092] The server can periodically determine among all orders the orders for which no delivery personnel are currently assigned and the orders for which delivery personnel are currently assigned but have not been confirmed by the delivery personnel. These orders are the target orders.

[0093] It should be noted that when determining the orders that have been assigned to the deliveryman but not confirmed by the deliveryman, it is generally determined that the server has not received a rejection message sent by the deliveryman's terminal, nor has it received an approval message sent by the deliveryman's terminal. Such orders are orders that have been assigned to the deliveryman but not confirmed by the deliveryman.

[0094] In addition, the above cycle can also be automatically adjusted, such as different time periods corresponding to different cycles, such as different types of object orders have different cycles. For example, for food orders, the cycle is short during meal time and long during non-meal time. For other items, all orders of items use the same cycle.

[0095] Step 102, determine a list of candidate delivery personnel corresponding to each order in the target order.

[0096] In implementation, after obtaining the target order, the server can obtain preset filtering conditions, obtain delivery personnel according to the preset filtering conditions, and then select a corresponding list of candidate delivery personnel from the delivery personnel for each order in the target order.

[0097] Optionally, a list of candidate couriers can be selected for each order based on the distance between the merchant and the couriers. The process can be as follows:

[0098] For each order in the target order, the distance between the merchant and the delivery person in the order is determined, and the delivery persons whose distance is less than the target value are included in the candidate delivery person list corresponding to the order.

[0099] The target value can be preset and stored in the server, such as a target value of 3 kilometers. In practice, when the deliveryman starts working, he will log in to the terminal with his account and password, and change his status to online on the terminal. When the terminal detects the status change instruction, it can send an online notification to the server. After receiving the notification, the server can record the account as online and arrange the order. In addition, each deliveryman's terminal can periodically obtain its own location based on LBS (Location Based Services) and report it to the server, so that the server can also know the location of each deliveryman in a timely manner.

[0100] When selecting a deliveryman for each order, the server can determine the longitude and latitude coordinates of the merchant in the order, and then obtain the longitude and latitude coordinates of the deliveryman who is online, and then use the two longitude and latitude coordinates to determine the distance between the merchant and each deliveryman. In addition, the map program can be directly called to read the distance from each deliveryman to the merchant from the map program, which is not limited in the embodiment of the present disclosure. Then for any order, the deliveryman whose distance between the merchant and the deliveryman in the order is less than the target value can be selected, and the selected deliverymen are formed into a candidate deliveryman list, and the candidate deliveryman list is matched with the order, that is, the candidate deliveryman list corresponding to the order is obtained, and the deliveryman list includes the account identifier of the deliveryman's account.

[0101] Step 103, for each order in the target order, assign the deliveryman corresponding to the order in the candidate deliveryman list corresponding to the order, and store the updated candidate deliveryman list, wherein the updated candidate deliveryman list is a list after deleting the deliveryman corresponding to the order from the candidate deliveryman list corresponding to the order.

[0102] In implementation, after determining the candidate deliveryman list for each order in the target order, the server can assign a deliveryman to any order in the target order from the candidate deliveryman list corresponding to the order, and then send an order assignment notification to the terminal logged in by the deliveryman's account. After receiving the order assignment notification, the terminal can display the information of the order and display the rejection option and the acceptance option accordingly. For example, Figure 2 As shown, order A is a food order from *** restaurant, and a rejection option and an approval option may be displayed below the order information.

[0103] If the delivery person clicks the reject option, the terminal will receive the reject option click instruction and send a reject message to the server. If the delivery person clicks the agree option, the terminal will receive the agree option click instruction and send an agree message to the server. In this way, the delivery person knows that there is an order assigned to him and can process it. After sending the order assignment notification, the server can delete the account ID of the delivery person's account in the candidate delivery person list corresponding to the order, and obtain an updated candidate delivery person list. The server can store the updated candidate delivery person list.

[0104] Step 104, when the delivery person corresponding to the order refuses to deliver the order, the delivery person corresponding to the order is reallocated from the list of candidate delivery persons corresponding to the order currently stored.

[0105] In implementation, when the server determines that the delivery person corresponding to the order refuses to deliver the order, the server can obtain the candidate delivery person list corresponding to the order currently stored in the cache, and reselect a delivery person from the candidate delivery person list as the delivery person corresponding to the order. Then, an order allocation notification is sent to the delivery person, and the subsequent processing is described in step 103.

[0106] Optionally, in the embodiment of the present disclosure, a process is provided in which the delivery person corresponding to the determined order refuses to deliver the order. The following two processing methods are provided:

[0107] Method 1: upon receiving a rejection message sent by a terminal of the delivery person corresponding to the order, it is determined that the delivery person corresponding to the order refuses to deliver the order.

[0108] In the implementation, in the description of step 103, after determining the delivery person corresponding to the order, the server can send an order allocation notification to the terminal logged in by the delivery person's account. After receiving the order allocation notification, the terminal can display the information of any order and display the rejection option and the approval option accordingly. If the delivery person clicks the rejection option, the terminal will receive the click instruction of the rejection option and send a rejection message to the server. When the server receives the rejection message, it can be determined that the delivery person corresponding to any order refuses to deliver the order.

[0109] In addition, if the delivery person clicks the consent option, the terminal will receive the click instruction of the consent option and send a consent message to the server. When the server receives the consent message, it can be determined that the delivery person corresponding to any order agrees to deliver the order. The server can delete the candidate delivery person list corresponding to the order in the cache to save cache storage space.

[0110] Method 2: if no rejection message or approval message is received from the terminal within a first period of time after the delivery notification is sent to the terminal of the delivery person corresponding to the order, it is determined that the delivery person corresponding to the order refuses to deliver the order.

[0111] The first duration may be preset and stored in the server, such as 2 minutes.

[0112] In the implementation, in the description of step 103, after determining the delivery person corresponding to the order, the server can send an order allocation notification to the terminal logged in by the delivery person's account. After receiving the order allocation notification, the terminal can display the information of any order and display the rejection option and the consent option accordingly. At the same time, the server can count when sending the order allocation notification. At the end of the first time period, if the server has not received a rejection message or a consent message sent by the delivery person, it can be determined that the delivery person corresponding to any order refuses to deliver the order.

[0113] In addition, after receiving the order allocation notification, the terminal also has a timer, which is a countdown timer. At the end of the countdown, if the delivery person has not clicked the agree option or the reject option, the terminal will display a prompt message that the order has expired.

[0114] In this way, through the above two methods, it can be determined that the delivery person refuses to deliver any order.

[0115] Optionally, for the above step 103, the delivery score of each delivery person may be determined, and based on the delivery score, the delivery person corresponding to the order may be selected, and the processing may be as follows:

[0116] Determine the delivery score of each deliveryman in the candidate deliveryman list corresponding to each order in the target order, and assign a deliveryman to each order according to the delivery score of each deliveryman in the candidate deliveryman list corresponding to each order.

[0117] In implementation, the server can obtain information about each order and related information about the couriers, and determine the delivery score of each couriers in the candidate couriers list corresponding to each order. Then, for any order, a candidate couriers can be assigned to the order based on the order of the delivery scores of the couriers in the candidate couriers list.

[0118] Optionally, the delivery score can reflect the degree of match between the deliveryman and the order. It can be determined by the distance between the deliveryman and the merchant to which the order belongs. The smaller the distance, the higher the delivery score, and the larger the distance, the smaller the delivery score. It can also be determined by the number of orders that the deliveryman currently has not completed. The smaller the number of orders, the higher the delivery score, and the larger the number of orders, the smaller the delivery score.

[0119] Optionally, in order to more accurately determine the distribution score, the distribution score may be determined according to multiple dimensions, and the corresponding processing may be as follows:

[0120] Determine the first dimension score, second dimension score and third dimension score of each deliveryman in the list of candidate deliverymen corresponding to each order in the target order, and determine the delivery score of each deliveryman based on the first dimension score, second dimension score and third dimension score of each deliveryman, where the first dimension score is the score of the order dimension, the second dimension score is the score of the deliveryman dimension, and the third dimension score is the score of the route planning dimension.

[0121] In implementation, for each deliveryman, there can be scores in three dimensions to obtain the delivery score. For any order, the score of any deliveryman in the candidate deliveryman list corresponding to the order can be obtained in the order dimension, that is, the first dimension score. For any deliveryman, the first dimension score is determined by the priority of the order corresponding to the deliveryman and the order receiving time. The formula can be:

[0122] The first dimension score = order receiving time * weight 1 + order priority score * weight 2. The sum of weight 1 and weight 2 is equal to 1. For example, weight 1 is 0.4 and weight 2 is 0.6. The order receiving time refers to the time from when the order is received by the server to the current time point. The order priority is used to indicate the priority level of the order. For example, if the order has an on-time delivery mark, the order priority is level 2 and the corresponding score is 20 points. If the order does not have an on-time delivery mark, the corresponding priority is level 1 and the corresponding score is 10 points.

[0123] For any deliveryman, determine the score of the deliveryman dimension, that is, the second dimension score. The second dimension score is determined by the deliveryman's level and the number of orders that the deliveryman has not completed. The formula can be as follows:

[0124] The score of the second dimension = the score of the deliveryman's level * weight 3 + the score of the number of orders that the deliveryman has not completed * weight 4. Among them, the sum of weight 3 and weight 4 is equal to 1. For example, weight 3 is 0.3 and weight 4 is 0.7. Each deliveryman has a level, which is generally determined based on the cumulative number of delivery orders and the delivery evaluation. It can be obtained by weighting the number of delivery orders and the proportion of positive reviews of the delivery evaluation. Each level of the deliveryman corresponds to a different score. Generally, the higher the level, the higher the score. The score of the number of orders that the deliveryman has not completed is inversely proportional to the number of orders that the deliveryman has not completed. For example, if the number of orders of the deliveryman is 8, the corresponding score is 1 point, and the number of orders of the deliveryman is 2, the corresponding score is 16.

[0125] For any delivery person, determine the score in the path planning dimension, that is, the score of the third dimension. The score of the third dimension is determined by the first increment, the second increment and the co-route coefficient. For each delivery person in the candidate delivery person list of any order, the first increment is the increment of the delivery distance after the delivery person accepts any order (see the difference between the first distance and the second distance below), and the second increment is the increment of the delivery time after the delivery person accepts any order (the difference between the first time and the second time, the first time is the time to deliver all orders after accepting any order, and the second time is the time to deliver all orders when any order is not accepted). The formula can be as follows:

[0126] The third dimension score = weight 5 * score corresponding to the first increment + weight 6 * score corresponding to the second increment + weight 7 * co-ordination coefficient, where the sum of weight 5, weight 6 and weight 7 is equal to 1, and weight 5, weight 6 and weight 7 can be 0.5, 0.2 and 0.3 respectively. First, determine the distance that any delivery person has to walk to deliver all his orders after accepting the order, and obtain the first distance, and determine the distance that any delivery person has to walk to deliver all his orders when he has not accepted the order, and obtain the second distance, and then subtract the second distance from the first distance to obtain the third distance, and determine the ratio of the third distance to the second distance, which is the co-ordination coefficient. When determining the score corresponding to the first increment, the server may store a correspondence between the increment range and the score. The server may determine the score corresponding to the increment range to which the first increment belongs in the correspondence, and determine the score as the score corresponding to the first increment. The server may also determine the score corresponding to the increment range to which the second increment belongs in the correspondence, and determine the score as the score corresponding to the second increment. In this way, the score corresponding to the first increment and the score corresponding to the second increment may be determined, and then the above formula may be used to determine the score of the third dimension.

[0127] Then add the first dimension score, the second dimension score and the third dimension score to get the delivery score of any delivery person.

[0128] Optionally, using the delivery score, the process of selecting a delivery person can be as follows:

[0129] In the list of candidate deliverymen corresponding to each order in the target order, the first deliveryman corresponding to each order is selected respectively, where, for any order, the first deliveryman is the deliveryman with the highest delivery score in the list of candidate deliverymen corresponding to any order; if there is the same deliveryman among the first deliverymen corresponding to various orders, a deliveryman is assigned to each order according to the delivery score of each deliveryman in the list of candidate deliverymen corresponding to each order; if there is no same deliveryman among the first deliverymen corresponding to various orders, then for any order, the first deliveryman corresponding to any order is determined as the deliveryman for any order.

[0130] In implementation, for any order in the target order, the server can sort the couriers in the candidate couriers list corresponding to the order in descending order according to the delivery scores, and then select the couriers at the top of the list as the first couriers corresponding to the order. The first couriers corresponding to each order are determined in the same way.

[0131] Then, it is determined whether there is a same deliveryman among the determined first deliverymen. If there is no same deliveryman, the first deliveryman corresponding to any order can be determined as the deliveryman for any order. If there is a same deliveryman, the delivery score of each deliveryman in the candidate deliveryman list corresponding to each order can be used to assign a deliveryman to each order.

[0132] Optionally, the process of assigning delivery personnel to orders according to delivery scores can be as follows:

[0133] Determine the target deliveryman with the highest delivery score among the first deliverymen corresponding to all orders in the target order, and determine the target deliveryman as the deliveryman for the first order, wherein the first order is the order corresponding to the list of candidate deliverymen to which the target deliveryman belongs, and re-execute the process of determining the delivery scores of each deliveryman in the list of candidate deliverymen corresponding to other orders in the target order except the first order.

[0134] In practice, after determining the first couriers corresponding to all orders, the couriers with the highest score among all the first couriers can be determined, which can be called the target couriers. Then the order corresponding to the candidate couriers list to which the target couriers belong is determined (the target couriers may exist in multiple candidate couriers lists, and the order selected here is the order with the delivery score calculated to the target couriers), which can be called the first order later.

[0135] Then, the other orders except the first order are re-determined in the target order, and the delivery scores of each deliveryman are re-determined in the candidate deliveryman list corresponding to these orders. Then, the deliverymen in each candidate deliveryman list are sorted in order of delivery scores from high to low, and the first deliveryman corresponding to each order is determined. The current target deliveryman is re-determined, and the current target deliveryman is determined as the deliveryman of the order corresponding to the candidate deliveryman list to which the current target deliveryman belongs. Then, the candidate deliveryman list is updated, and the updated candidate deliveryman list is stored. In this way, each order can be assigned a deliveryman according to this cycle.

[0136] It should be noted that redetermining the delivery score here can make the selected delivery personnel more reasonable. This is because some orders of the delivery personnel during this period may have been delivered, or they may have received other orders. In this way, the calculated delivery score may be different from the previous one. The delivery personnel selected for each order are more in line with the current actual situation, so the selected delivery personnel are also more reasonable.

[0137] Optionally, in the embodiment of the present disclosure, when it is determined that the delivery person refuses to deliver the order, the delivery person may be reselected based on the time until the next periodic order processing. The corresponding processing may be as follows:

[0138] When it is determined that the deliveryman corresponding to the order refuses to deliver the order, determine the time from the current moment to the next periodic order processing. If the time is greater than the second time, reselect the deliveryman corresponding to the order from the list of candidate deliverymen corresponding to the currently stored order.

[0139] Among them, the second time length is related to the cycle of order processing. Generally, the longer the cycle of order processing is, the longer the second time length is. For example, if the cycle of order processing is 2 minutes, the second time length is 20 seconds; if the cycle of order processing is 1 minute, the second time length is 10 seconds; or the second time length has nothing to do with the cycle of order processing and can be a fixed value, such as 10 seconds.

[0140] In implementation, for any order, if the server determines that the delivery person corresponding to the order refuses to deliver the order, the server can determine the current time point, obtain the time point of the next periodic order processing, and determine the time from the current time point to the next order processing. Then obtain the second time, and determine the relationship between the time from the current time point to the next order processing and the second time. If the time is greater than the second time, the server can directly obtain the currently stored list of candidate delivery persons corresponding to the order, and reselect the delivery person corresponding to the order from the list of candidate delivery persons.

[0141] In this way, since the couriers in the stored candidate couriers list can be directly obtained and reassigned to the orders rejected by the couriers without recollecting the couriers, the order processing efficiency can be improved. In addition, since the order processing cycle is relatively short and the positions of the couriers do not change much, the couriers in the stored candidate couriers list are similar to the recollected couriers, so it will not affect the selection of couriers.

[0142] It should be noted that each time the candidate deliveryman list is updated, the updated deliveryman list will be stored, so the latest candidate deliveryman list is stored. Each update refers to the update during the periodic dispatch processing, and after the deliveryman is assigned to the order, the deliveryman is deleted from the candidate deliveryman list corresponding to the order.

[0143] Optionally, when the time between the current time point and the next dispatch processing is relatively short, you can wait for the list of candidate delivery personnel for periodic dispatch processing. The corresponding processing can be as follows:

[0144] If the duration is less than or equal to the second duration, a list of candidate delivery personnel for the order obtained in the next periodic order dispatch processing is obtained, and a delivery person corresponding to the order is reselected from the list of candidate delivery personnel for the order obtained in the next periodic order dispatch processing.

[0145] In implementation, for any order that is rejected for delivery, when the time from the current time point to the next order processing is less than or equal to the second time point, you can wait, and when waiting for the next periodic order processing, re-collect the list of candidate couriers for the order, and then re-select a couriers for the order from the list of candidate couriers (the selection method is described in the previous process, which can be repeated here). After selecting the couriers, store the updated list of candidate couriers (delete the list of candidate couriers for the couriers).

[0146] In this way, when the time from the current time point to the next order processing is relatively short, even if you wait for the list of candidate deliverymen obtained by the next periodic order processing, the waiting time will not be very long, and the selected list of candidate deliverymen is closer to the current situation, so the selected deliverymen are also more reasonable.

[0147] In addition, in the implementation of the present disclosure, for a certain order, after the server receives the consent message sent by the terminal of the delivery person of the order, the server can delete the list of candidate delivery persons corresponding to the order in the cache, so that the storage space of the cache can be saved.

[0148] In addition, a system diagram is also provided in the embodiment of the present disclosure, such as Figure 3 As shown, the server selects a delivery person for the order, and the delivery person determines whether to accept the order through the delivery person's terminal.

[0149] In addition, in order to better understand the embodiments of the present disclosure, the embodiments of the present disclosure also provide the following Figure 4 The flowchart shown:

[0150] Step 1: Periodic order processing;

[0151] Step 2, collect target orders;

[0152] Step 3: Determine the list of candidate delivery personnel corresponding to each order;

[0153] Step 4: Determine the delivery person corresponding to each order and notify the delivery person;

[0154] Step 5: Update the candidate delivery personnel list corresponding to the order stored in the cache;

[0155] Step 6, determining whether the delivery person refuses the delivery order;

[0156] Step 7: If the delivery person does not reject the delivery order, the list of candidate delivery persons corresponding to the order is deleted from the cache;

[0157] Step 8, when the delivery person refuses the delivery order, determining whether the time from the current time point to the next periodic order processing is greater than the second time period;

[0158] Step 9: when the duration is greater than the second duration, read the candidate delivery person list corresponding to the order from the cache;

[0159] Step 10: reselect a delivery person from the newly acquired candidate delivery person list, and update the candidate delivery person list corresponding to the order in the cache (return to step 5);

[0160] Step 11, when the duration is less than or equal to the second duration, wait for the next periodic order processing and return to execute step 1.

[0161] In the disclosed embodiment, when dispatching orders, target orders can be periodically obtained, wherein the target orders include orders that are not currently assigned to delivery personnel and orders that are currently assigned to delivery personnel but have not been confirmed by delivery personnel, and a list of candidate delivery personnel corresponding to each order in the target orders is determined. For each order in the target orders, the delivery personnel corresponding to the order is assigned from the list of candidate delivery personnel corresponding to the order, and an updated list of candidate delivery personnel is stored, wherein the updated list of candidate delivery personnel is a list after deleting the delivery personnel corresponding to the order from the list of candidate delivery personnel corresponding to the order, and when the delivery personnel corresponding to the order refuses to deliver the order, the delivery personnel corresponding to the order is reallocated from the list of candidate delivery personnel corresponding to the currently stored order. In this way, each time dispatching orders is performed, a list of candidate delivery personnel corresponding to the order is stored, and when the delivery personnel refuses to deliver the order, the stored list of candidate delivery personnel can be directly obtained and the delivery personnel can be reselected without having to reacquire all the delivery personnel, so that the order can be processed as quickly as possible, which can improve the efficiency of order processing.

[0162] Based on the same technical concept, the embodiment of the present disclosure also provides an order processing device, such as Figure 5 As shown, the device comprises:

[0163] An acquisition module 510 is used to periodically acquire target orders, wherein the target orders include orders for which a delivery person is not currently assigned and orders for which a delivery person is currently assigned but has not been confirmed by the delivery person;

[0164] A determination module 520 is used to determine a list of candidate delivery personnel corresponding to each order in the target order;

[0165] An allocation module 530 is used to allocate, for each order in the target order, a delivery person corresponding to the order in the candidate delivery person list corresponding to the order;

[0166] The storage module 540 is used to store the updated candidate deliveryman list, wherein the updated candidate deliveryman list is a list after deleting the deliveryman corresponding to the order from the candidate deliveryman list corresponding to the order;

[0167] The allocation module 530 is further configured to reallocate a delivery person corresponding to the order from a currently stored list of candidate delivery persons corresponding to the order when the delivery person corresponding to the order refuses to deliver the order.

[0168] Optionally, the determining module 520 is further configured to:

[0169] Determine that the delivery person corresponding to the order refuses to deliver the order, using one of the following methods:

[0170] Upon receiving a rejection message sent by a terminal of the delivery person corresponding to the order, determining that the delivery person corresponding to the order refuses to deliver the order;

[0171] If no rejection message or approval message is received from the terminal within a first period of time after a delivery notification is sent to the terminal of the delivery person corresponding to the order, it is determined that the delivery person corresponding to the order refuses to deliver the order.

[0172] Optionally, the allocation module 530 is used to:

[0173] Determine the delivery score of each delivery person in the candidate delivery person list corresponding to each order in the target order;

[0174] A deliveryman is assigned to each order according to the delivery score of each deliveryman in the candidate deliveryman list corresponding to each order.

[0175] Optionally, the allocation module 530 is used to:

[0176] Selecting the first deliveryman corresponding to each order in the candidate deliveryman list corresponding to each order in the target order, wherein for any order, the first deliveryman is the deliveryman with the highest delivery score in the candidate deliveryman list corresponding to any order;

[0177] If there are identical couriers among the first couriers corresponding to the orders, assigning couriers to the orders according to the delivery scores of the couriers in the candidate couriers list corresponding to the orders;

[0178] If there is no identical deliveryman among the first deliverymen corresponding to the orders, then for any order, the first deliveryman corresponding to any order is determined as the deliveryman for any order.

[0179] Optionally, the allocation module 530 is used to:

[0180] Determine the target delivery person with the highest delivery score among the first delivery persons corresponding to all orders in the target order;

[0181] Determine the target delivery person as the delivery person for a first order, wherein the first order is an order corresponding to a list of candidate delivery persons to which the target delivery person belongs;

[0182] The process of determining the delivery score of each delivery person in the list of candidate delivery persons corresponding to other orders in the target order except the first order is re-executed.

[0183] Optionally, the allocation module 530 is used to:

[0184] Determine the first dimension score, the second dimension score, and the third dimension score of each deliveryman in the candidate deliveryman list corresponding to each order in the target order, and determine the delivery score of each deliveryman according to the first dimension score, the second dimension score, and the third dimension score of each deliveryman;

[0185] Among them, the first dimension score is the score of the order dimension, the second dimension score is the score of the deliveryman dimension, and the third dimension score is the score of the route planning dimension.

[0186] Optionally, for each deliveryman, the first dimension score of the deliveryman is determined by the priority of the order corresponding to the list of candidate deliverymen to which the deliveryman belongs and the time it takes to receive the order, the second dimension score of the deliveryman is determined by the level of the deliveryman and the number of orders that the deliveryman currently has not completed, and the third dimension score of the deliveryman is determined by the first increment, the second increment and the en route coefficient, the first increment being the increment of the delivery distance after the deliveryman accepts the order corresponding to the list of candidate deliverymen to which the deliveryman belongs, and the second increment being the increment of the delivery time after the deliveryman accepts the order corresponding to the list of candidate deliverymen to which the deliveryman belongs.

[0187] Optionally, the allocation module 530 is further configured to:

[0188] If it is determined that the delivery person corresponding to the order refuses to deliver the order, determine the time from the current moment to the next periodic order processing;

[0189] If the duration is greater than the second duration, a delivery person corresponding to the order is reselected from the list of candidate delivery persons corresponding to the order currently stored.

[0190] Optionally, the allocation module 530 is further configured to:

[0191] If the duration is less than or equal to the second duration, obtain the list of candidate delivery personnel for the order obtained in the next periodic order dispatching process, and reselect the delivery personnel corresponding to the order from the list of candidate delivery personnel for the order obtained in the next periodic order dispatching process.

[0192] Optionally, the determining module 520 is used to:

[0193] For each order in the target order, determining the distance between the merchant and the delivery person in the order;

[0194] The couriers whose distance is less than the target value are included in the candidate couriers list corresponding to the order.

[0195] In the disclosed embodiment, when dispatching orders, target orders can be periodically obtained, wherein the target orders include orders that are not currently assigned to delivery personnel and orders that are currently assigned to delivery personnel but have not been confirmed by delivery personnel, and a list of candidate delivery personnel corresponding to each order in the target orders is determined. For each order in the target orders, the delivery personnel corresponding to the order is assigned from the list of candidate delivery personnel corresponding to the order, and an updated list of candidate delivery personnel is stored, wherein the updated list of candidate delivery personnel is a list after deleting the delivery personnel corresponding to the order from the list of candidate delivery personnel corresponding to the order, and when the delivery personnel corresponding to the order refuses to deliver the order, the delivery personnel corresponding to the order is reallocated from the list of candidate delivery personnel corresponding to the currently stored order. In this way, each time dispatching orders is performed, a list of candidate delivery personnel corresponding to the order is stored, and when the delivery personnel refuses to deliver the order, the stored list of candidate delivery personnel can be directly obtained and the delivery personnel can be reselected without having to reacquire all the delivery personnel, so that the order can be processed as quickly as possible, which can improve the efficiency of order processing.

[0196] It should be noted that: the device for performing order processing provided in the above embodiment only uses the division of the above functional modules as an example when performing order processing. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above. In addition, the device for performing order processing provided in the above embodiment and the method embodiment for performing order processing belong to the same concept. The specific implementation process is detailed in the method embodiment and will not be repeated here.

[0197] Figure 6 It is a structural diagram of a server provided in an embodiment of the present invention. The server 600 may have relatively large differences due to different configurations or performances, and may include one or more processors 601 and one or more memories 602, wherein the memory 602 stores at least one instruction, and the at least one instruction is loaded and executed by the processor 601 to implement each step in the above-mentioned order processing method.

[0198] In an embodiment of the present disclosure, a computer-readable storage medium is further provided, in which a computer program is stored. When the computer program is executed by a processor, the above-mentioned method for order processing is implemented.

[0199] In an embodiment of the present disclosure, a server is also provided, which includes a processor and a memory, wherein the memory is used to store computer programs; and the processor is used to execute the programs stored in the memory to implement the above-mentioned method of order processing.

[0200] A person skilled in the art will understand that all or part of the steps to implement the above embodiments may be accomplished by hardware or by instructing related hardware through a program, and the program may be stored in a computer-readable storage medium, and the above-mentioned storage medium may be a read-only memory, a disk or an optical disk, etc.

[0201] The above description is only a preferred embodiment of the present disclosure and is not intended to limit the present disclosure. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present disclosure should be included in the protection scope of the present disclosure.

Claims

1. A method for order processing, characterized in that: The method comprises: Periodically acquiring target orders, wherein the target orders include orders for which no delivery personnel are currently assigned and orders for which delivery personnel are currently assigned but have not been confirmed by the delivery personnel; Determine a list of candidate delivery personnel corresponding to each order in the target order; For each order in the target order, assign the deliveryman corresponding to the order in the candidate deliveryman list corresponding to the order, and store the updated candidate deliveryman list, wherein the updated candidate deliveryman list is a list after deleting the deliveryman corresponding to the order from the candidate deliveryman list corresponding to the order; In the case where the delivery person corresponding to the order refuses to deliver the order, when it is determined that the delivery person corresponding to the order refuses to deliver the order, reallocating the delivery person corresponding to the order from the currently stored list of candidate delivery persons corresponding to the order; Wherein, for each order in the target order, allocating a delivery person corresponding to the order in the candidate delivery person list corresponding to the order includes: Determine the delivery score of each delivery person in the candidate delivery person list corresponding to each order in the target order; Allocating a delivery person to each order according to the delivery score of each delivery person in the candidate delivery person list corresponding to each order; Wherein, in the case where the delivery person corresponding to the order refuses to deliver the order, when it is determined that the delivery person corresponding to the order refuses to deliver the order, reallocating the delivery person corresponding to the order from the currently stored list of candidate delivery persons corresponding to the order includes: If it is determined that the delivery person corresponding to the order refuses to deliver the order, determine the time from the current moment to the next periodic order processing; If the duration is greater than the second duration, a delivery person corresponding to the order is reselected from the list of candidate delivery persons corresponding to the order currently stored.

2. The method according to claim 1, characterized in that The method further comprises: Determine that the delivery person corresponding to the order refuses to deliver the order, using one of the following methods: Upon receiving a rejection message sent by a terminal of the delivery person corresponding to the order, determining that the delivery person corresponding to the order refuses to deliver the order; If no rejection message or approval message is received from the terminal within a first period of time after a delivery notification is sent to the terminal of the delivery person corresponding to the order, it is determined that the delivery person corresponding to the order refuses to deliver the order.

3. The method according to claim 1, characterized in that: The allocating a delivery person to each order according to the delivery score of each delivery person in the candidate delivery person list corresponding to each order comprises: Selecting the first deliveryman corresponding to each order in the candidate deliveryman list corresponding to each order in the target order, wherein for any order, the first deliveryman is the deliveryman with the highest delivery score in the candidate deliveryman list corresponding to any order; If there are identical couriers among the first couriers corresponding to the orders, assigning couriers to the orders according to the delivery scores of the couriers in the candidate couriers list corresponding to the orders; If there is no identical deliveryman among the first deliverymen corresponding to the orders, then for any order, the first deliveryman corresponding to any order is determined as the deliveryman for any order.

4. The method according to claim 1 or 3, characterized in that: The allocating a delivery person to each order according to the delivery score of each delivery person in the candidate delivery person list corresponding to each order comprises: Determine the target delivery person with the highest delivery score among the first delivery persons corresponding to all orders in the target order; Determine the target delivery person as the delivery person for a first order, wherein the first order is an order corresponding to a list of candidate delivery persons to which the target delivery person belongs; The process of determining the delivery score of each delivery person in the list of candidate delivery persons corresponding to other orders in the target order except the first order is re-executed.

5. The method according to claim 1, characterized in that: The determining of the delivery score of each delivery person in the candidate delivery person list corresponding to each order in the target order includes: Determine the first dimension score, the second dimension score, and the third dimension score of each deliveryman in the candidate deliveryman list corresponding to each order in the target order, and determine the delivery score of each deliveryman according to the first dimension score, the second dimension score, and the third dimension score of each deliveryman; Among them, the first dimension score is the score of the order dimension, the second dimension score is the score of the deliveryman dimension, and the third dimension score is the score of the route planning dimension.

6. An order processing device, characterized in that: The device comprises: An acquisition module, used for periodically acquiring target orders, wherein the target orders include orders for which no delivery personnel are currently assigned and orders for which delivery personnel are currently assigned but have not been confirmed by the delivery personnel; A determination module, used to determine a list of candidate delivery personnel corresponding to each order in the target order; An allocation module, configured to allocate, for each order in the target order, a delivery person corresponding to the order from a list of candidate delivery persons corresponding to the order; A storage module, used for storing an updated list of candidate delivery personnel, wherein the updated list of candidate delivery personnel is a list after deleting the delivery personnel corresponding to the order from the list of candidate delivery personnel corresponding to the order; The allocation module is further configured to reallocate a delivery person corresponding to the order from a currently stored list of candidate delivery persons corresponding to the order, if the delivery person corresponding to the order refuses to deliver the order; Wherein, for each order in the target order, allocating a delivery person corresponding to the order in the candidate delivery person list corresponding to the order includes: Determine the delivery score of each delivery person in the candidate delivery person list corresponding to each order in the target order; Allocating a delivery person to each order according to the delivery score of each delivery person in the candidate delivery person list corresponding to each order; Wherein, when the delivery person corresponding to the order refuses to deliver the order, reallocating the delivery person corresponding to the order from the currently stored list of candidate delivery persons corresponding to the order includes: If it is determined that the delivery person corresponding to the order refuses to deliver the order, determine the time from the current moment to the next periodic order processing; If the duration is greater than the second duration, a delivery person corresponding to the order is reselected from the list of candidate delivery persons corresponding to the order currently stored.

7. A server, characterized in that: The server includes a processor and a memory, wherein the memory stores at least one instruction, and the instruction is loaded and executed by the processor to implement the order processing method according to any one of claims 1 to 5.

8. A computer-readable storage medium, characterized in that: The storage medium stores at least one instruction, which is loaded and executed by the processor to implement the order processing method according to any one of claims 1 to 5.

Images