Order reassignment method, device, computer-readable storage medium and electronic device

Abstract

The present specification discloses a method, apparatus, computer-readable storage medium and electronic device for order reassignment. In the process of determining the order to be reassigned, various alternative orders can be screened out from various unexecuted orders through computing devices such as servers, and the status of the original delivery capacity corresponding to each alternative order can be comprehensively analyzed to analyze the impact of whether the alternative order is reassigned on the delivery efficiency of the original delivery capacity. Finally, based on the analysis results, the order to be reassigned is determined from the alternative orders and the corresponding reassignment is performed, thereby not introducing errors caused by manual screening and matching, and effectively alleviating the order execution pressure of the original delivery capacity corresponding to the order to be reassigned, thereby improving the comprehensive benefits of order reassignment.

Description

Technical Field

[0001] The present application relates to the field of Internet technology, and in particular to a method, device, computer-readable storage medium, and electronic device for order reassignment. Background Art

[0002] At present, in social production and life, logistics and distribution control the purposeful flow of material entities within a preset spatial range. The scope of logistics and distribution extends to the upstream and downstream departments of the supply chain, playing a leading role in supply chain management.

[0003] For example, in the scenario where the delivery capacity is executing order delivery, the delivery capacity executes the order according to the pre-planned order execution plan. Since the order execution status and the order execution environment are both somewhat random, the order timeout caused by unexpected conditions will be difficult to predict, and the problem of unexpected increase in the possibility of order timeout will inevitably occur. At this time, if the original delivery capacity corresponding to the order with increased timeout possibility is still used to execute the order, it will affect the execution effect of the original delivery capacity on other unexecuted orders. For example, the unexecuted orders after the order with increased timeout possibility will also have the problem of increased timeout possibility.

[0004] In the prior art, in response to this phenomenon, orders with a high probability of timeout are generally reassigned to other delivery capacity through manual screening and matching. It can be seen that the order reassignment method in the prior art relies too much on manual judgment. In the process of manual screening and matching, large errors or even misjudgments will occur due to subjective factors, which will lead to many problems such as the impact on order execution effect. Summary of the invention

[0005] The embodiments of this specification provide a method, device, computer-readable storage medium, and electronic device for order reassignment to partially solve the above-mentioned problems existing in the prior art.

[0006] The embodiments of this specification adopt the following technical solutions:

[0007] The order reassignment methods provided in this manual include:

[0008] Get information about unexecuted orders;

[0009] Determine alternative orders from the unexecuted orders according to the information of the unexecuted orders and the information of the originally scheduled delivery capacity corresponding to the unexecuted orders;

[0010] For each alternative order, determine the degree of improvement in the delivery efficiency of the original delivery capacity corresponding to the alternative order under the condition that the alternative order is reassigned;

[0011] According to the degree of improvement in delivery efficiency determined for each candidate order, determine each order to be re-dispatched from among the candidate orders;

[0012] Allocate each order to be reassigned to the target delivery capacity.

[0013] Optionally, determining the alternative orders from the unexecuted orders includes:

[0014] For each unexecuted order, determine the timeout risk of the unexecuted order based on the route planning of the original delivery capacity corresponding to the unexecuted order;

[0015] According to the timeout risk of each unexecuted order, an alternative order is determined from the unexecuted orders.

[0016] Optionally, the determining of the degree of improvement in the delivery efficiency of the original delivery capacity corresponding to the alternative order under the condition that the alternative order is reassigned includes:

[0017] Determine, based on the information of the alternative order and the current position of the original delivery capacity corresponding to the alternative order, at least one of a reduction in the number of overdue orders, a reduction in the total overtime duration, and a reduction in the distance of the original delivery capacity under the condition that the alternative order is reassigned;

[0018] The degree of improvement in delivery efficiency of the original delivery capacity corresponding to the alternative order is determined based on at least one of the determined reduction in the number of overtime orders, the reduction in the total overtime duration, and the reduction in distance.

[0019] Optionally, determining each order to be reassigned from each candidate order according to the degree of improvement in delivery efficiency determined for each candidate order includes:

[0020] For each originally scheduled delivery capacity, according to the degree of improvement in delivery efficiency of each candidate order corresponding to the originally scheduled delivery capacity, a target order corresponding to the originally scheduled delivery capacity is determined among the candidate orders corresponding to the originally scheduled delivery capacity;

[0021] In each target order, determine each order to be reassigned.

[0022] Optionally, determining each order to be reassigned in each target order includes:

[0023] For each target order, the original delivery capacity corresponding to the target order is used to determine the time when the target delivery capacity arrives at the next task point according to the route planning of the target delivery capacity.

[0024] Determine the response efficiency of the original delivery transport capacity to the re-dispatch instruction based on the time when the original delivery transport capacity arrives at the next task point;

[0025] For each target order, the orders to be re-dispatched are determined in each target order according to the degree of improvement in the delivery efficiency of the target order and the response efficiency of the original delivery capacity corresponding to the target order to the re-dispatching instruction.

[0026] Optionally, before allocating each to-be-reassigned order to a target delivery capacity, the method further includes:

[0027] Determine the target delivery capacity, except for the original delivery capacity corresponding to the orders to be reassigned.

[0028] Optionally, allocating each to-be-reassigned order to a target delivery capacity includes:

[0029] For each order to be reassigned, determine the matching degree of the order to be reassigned with respect to each target delivery capacity;

[0030] According to the matching degree of each order to be reassigned with respect to each target delivery capacity, the weight value of each order to be reassigned and each target delivery capacity is determined respectively;

[0031] According to the weight value of each order to be reassigned, the weight value of each target delivery capacity and the matching degree of each order to be reassigned relative to each target delivery capacity, a bipartite graph algorithm is used to allocate each order to be reassigned to the target delivery capacity.

[0032] Optionally, determining the matching degree of the order to be reassigned with respect to each target delivery capacity includes:

[0033] For each target delivery transport capacity, according to the current position of the target delivery transport capacity and the information of the order to be reassigned, determine at least one of the total overtime duration increase, the distance increase and the robustness characterization value of the target delivery transport capacity under the condition that the order to be reassigned is reassigned to the target delivery transport capacity;

[0034] The matching degree of the order to be reassigned relative to the target delivery capacity is determined based on at least one of the determined total timeout duration increase, the distance increase and the robustness characterization value.

[0035] Optionally, determining the robustness representation value of the target delivery capacity under the condition that the order to be reassigned is reassigned to the target delivery capacity includes:

[0036] Under the condition that the to-be-reassigned order is reassigned to the target delivery transport capacity, according to the route planning of the target delivery transport capacity, the order to be delivered in advance is determined among all the orders corresponding to the target delivery transport capacity;

[0037] For each early delivery order, determine the early delivery time length corresponding to the early delivery order;

[0038] Among the advance delivery time lengths corresponding to the respective advance delivery orders, the minimum value of the advance delivery time lengths is determined as the robustness representation value of the target delivery capacity.

[0039] This manual provides a device for order re-dispatch, including:

[0040] An information acquisition module configured to acquire information of unexecuted orders;

[0041] An alternative order determination module, configured to determine alternative orders from the unexecuted orders according to the information of the unexecuted orders and the information of the originally scheduled delivery capacity respectively corresponding to the unexecuted orders;

[0042] An efficiency determination module is configured to determine, for each candidate order, a degree of improvement in the delivery efficiency of the original delivery capacity corresponding to the candidate order under the condition that the candidate order is reassigned;

[0043] A module for determining orders to be reassigned, configured to determine each order to be reassigned from each candidate order according to the degree of improvement in delivery efficiency determined for each candidate order;

[0044] The allocation module is configured to allocate each order to be reassigned to a target delivery capacity.

[0045] The computer-readable storage medium provided in this specification stores a computer program, and when the computer program is executed by a processor, the above-mentioned order reassignment method is implemented.

[0046] The electronic device provided in this specification includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the above-mentioned order reassignment method when executing the program.

[0047] At least one of the above technical solutions adopted in the embodiments of this specification can achieve the following beneficial effects:

[0048] The method in this specification can, in the process of determining the orders to be reassigned, screen out various alternative orders from various unexecuted orders through computing devices such as servers, and comprehensively consider the status of the original delivery capacity corresponding to each alternative order, analyze the impact of whether the alternative order is reassigned on the delivery efficiency of the original delivery capacity, and finally determine the orders to be reassigned from the alternative orders based on the analysis results, and perform corresponding reassignments, thereby avoiding the introduction of errors caused by manual screening and matching, and effectively alleviating the order execution pressure of the original delivery capacity corresponding to the orders to be reassigned, thereby improving the comprehensive benefits of order reassignment. BRIEF DESCRIPTION OF THE DRAWINGS

[0049] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0050] Figure 1 The process of order re-dispatch method provided for this specification;

[0051] Figure 2 The process of determining the degree of improvement in the delivery efficiency of the original delivery capacity corresponding to the alternative orders provided in this specification;

[0052] Figure 3 The process of determining each order to be reassigned among the alternative orders provided for this specification;

[0053] Figure 4 The process of allocating each order to be reassigned to the target delivery capacity provided in this manual;

[0054] Figure 5 A schematic diagram of the structure of an order reassignment device provided in an embodiment of this specification;

[0055] Figure 6 The embodiments of this specification provide corresponding to Figure 1 Schematic diagram of electronic equipment. DETAILED DESCRIPTION

[0056] In order to make the purpose, technical solutions and advantages of this specification more clear, the technical solutions of this application will be clearly and completely described below in combination with the specific embodiments of this specification and the corresponding drawings. Obviously, the described embodiments are only part of the embodiments of this application, not all of them. Based on the embodiments in this specification, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0057] The technical solutions provided by various embodiments of the present application are described in detail below in conjunction with the accompanying drawings.

[0058] Figure 1 The order reassignment process provided in the embodiments of this specification may include one or more of the following steps:

[0059] S100: Obtaining information of unexecuted orders.

[0060] In the method of the embodiment of this specification, the unexecuted order may include: an order that has been assigned to the delivery capacity, and a route plan including the order has been determined for the delivery capacity, but the delivery capacity has not yet implemented the execution steps for the order. The execution steps may include: picking up the goods or preparing to pick up the goods (for example, the delivery capacity is heading to the pickup location; or the server can determine that the delivery capacity can go to the pickup location within the preset preparation time). Orders may include: take-out orders, express delivery orders, or purchase orders, etc.

[0061] The information of the unexecuted order may include: the pickup location, pickup time, delivery location, agreed delivery time, delivery requirements and at least one of the blacklisted delivery capacity corresponding to the order. The delivery requirements may include: the delivery requirements determined by the properties of the goods corresponding to the order, such as: refrigeration requirements, etc.; they may also include the delivery requirements determined by the consignee corresponding to the order, such as: the consignee requires the delivery capacity to contact the consignee within a predetermined time before the order is delivered, etc.

[0062] There are many ways to obtain the information, for example, filtering the information stored on the server to obtain the information of unexecuted orders.

[0063] S102: Determine alternative orders from the unexecuted orders based on the information of the unexecuted orders and the information of the originally scheduled delivery capacity corresponding to the unexecuted orders.

[0064] In the method of the embodiment of this specification, the delivery capacity can be any one of: a rider, a delivery robot, a drone and an unmanned vehicle. The original delivery capacity is: the delivery capacity assigned to execute the unexecuted order, and the current route planning of the original delivery capacity includes the unexecuted order. Each original delivery capacity can correspond to at least one unexecuted order. Two or more of the determined alternative orders may correspond to the same original delivery capacity. If the correspondence between the order and the delivery capacity has changed substantially (for example, the server has transferred the order from the delivery capacity), a new route planning must be determined for the delivery capacity.

[0065] The information of the original delivery capacity may include: the current location of the original delivery capacity, the number of unexecuted orders corresponding to the original delivery capacity, the time when the original delivery capacity last uploaded its location, and at least one of the order-taking capacity of the original delivery capacity. The location where the original delivery capacity last uploaded its location may be used as the current location of the original delivery capacity. The upload operation may be completed by the mobile terminal corresponding to the original delivery capacity or the application loaded in the mobile terminal. The upload may be to the server; the upload may be periodic automatic upload, or manual upload under the control of the delivery capacity. The order-taking capacity of the original delivery capacity may include the upper limit of the number of orders set by the server for the original delivery capacity.

[0066] In the method of the embodiment of this specification, the alternative order is a part of the unexecuted orders. Optionally, for each unexecuted order, if the information of the unexecuted order meets the preset conditions corresponding to the order information, and the information of the original distribution capacity corresponding to the unexecuted order meets the preset conditions corresponding to the distribution capacity information, then the order is determined as an alternative order. This step is the first stage of screening to determine the orders to be reassigned, which narrows the scope of the objects screened in the subsequent steps. In addition, this step screens each unexecuted order according to the information of the unexecuted order and the information of the original distribution capacity corresponding to the unexecuted order, respectively, and can at least comprehensively analyze each unexecuted order from two aspects: the execution effect of the unexecuted order and the execution ability of the original distribution capacity for the order, and determine the alternative order from each unexecuted order. Compared with other unexecuted orders, the alternative order has the strongest demand for reassignment, and the degree of relief of the order execution pressure of the distribution capacity corresponding to the alternative order after reassignment is the greatest.

[0067] S104: For each candidate order, determine the degree of improvement in the delivery efficiency of the original delivery capacity corresponding to the candidate order under the condition that the candidate order is reassigned.

[0068] In the method of the embodiment of this specification, when determining the degree of improvement in the delivery efficiency of the original delivery capacity by reassigning the alternative order, the reassignment operation can be implemented as: transferring the alternative order from the original delivery capacity.

[0069] The degree of improvement in the delivery efficiency of the original delivery capacity may be: the incremental delivery efficiency obtained by the original delivery capacity executing all the corresponding orders after the alternative order is transferred out from the original delivery capacity, compared with before the alternative order is transferred out from the original delivery capacity. The degree of improvement in the delivery efficiency of the original delivery capacity is related to the re-determined route planning for the original delivery capacity after the alternative order is transferred out. In some cases, the degree of improvement in delivery efficiency may be: the sum of the delivery efficiency improvements of all unexecuted orders in the re-determined route planning corresponding to the original delivery capacity.

[0070] The delivery efficiency may include at least one of the distance traveled by the delivery transport to execute all the corresponding orders, the degree of detours taken by the delivery transport to execute all the corresponding orders, the number of timed orders in the execution of all the corresponding orders by the delivery transport, and the cumulative timeout duration of the execution of all the corresponding orders by the delivery transport. If the difference between the actual delivery time or the estimated delivery time of an order and the agreed delivery time does not meet the corresponding conditions, the order times out. For example, if the difference between the estimated delivery time and the agreed delivery time of the order is greater than zero and does not meet the corresponding conditions, the order times out. The estimated delivery time can be determined based on the current location of the delivery transport and the current path planning corresponding to the delivery transport.

[0071] This step can be implemented for each alternative order separately. If one original delivery capacity corresponds to two or more alternative orders, the number of times the delivery efficiency improvement degree for the original delivery capacity is determined is equal to the number of alternative orders corresponding to the original delivery capacity.

[0072] This step can also be implemented separately for each distribution capacity. If two or more of the determined alternative orders have a certain correlation, the two or more alternative orders with the correlation can also be taken as a whole for comprehensive analysis. For example: If an original distribution capacity corresponds to two or more alternative orders, and there is a certain correlation between at least some of the two or more alternative orders, then when implementing the method in this specification, each alternative order with a certain correlation can be taken as an alternative order, and then the degree of improvement in the distribution efficiency of the original distribution capacity corresponding to the one alternative order is determined. Make the number of determinations of the degree of improvement in the distribution efficiency of the original distribution capacity less than the number of alternative orders corresponding to the original distribution capacity.

[0073] Among them, the association relationship may include: the pickup locations of two or more alternative orders are close or the same, the delivery locations of two or more alternative orders are close or the same, or the overlap degree of two or more alternative orders in the path planning of the original distribution capacity (the path planning includes the two or more orders with an association relationship) reaches a preset corresponding threshold. When analyzing orders with a certain association relationship, the pickup location closest to the starting point of the path planning of the original distribution capacity among the two or more orders with an association relationship can be used as the common pickup location of the two or more orders with an association relationship; the delivery location closest to the end point of the path planning of the original distribution capacity can be used as the common delivery location of the two or more orders with an association relationship; the agreed delivery time corresponding to the order with the closest agreed delivery time to the current time among the two or more orders with an association relationship can be used as the common agreed delivery time of the two or more orders with an association relationship.

[0074] In the method of the embodiment of this specification, when determining the degree of improvement in the delivery efficiency of the original delivery capacity due to the reassignment of an order, the order analyzed is the alternative order corresponding to the original delivery capacity, rather than all the unexecuted orders corresponding to the original delivery capacity, which greatly reduces the number of orders that need to be analyzed. In addition, the method of the embodiment of this specification, for the original delivery capacity, reassigns any of its corresponding alternative orders to other delivery capacities, re-determines the path planning for the original delivery capacity, and the delivery capacity executes all its corresponding orders according to the re-planned path, and obtains the overall degree of improvement in delivery efficiency. The method in this specification, for the reassignment of the order to be reassigned, can effectively alleviate the order execution pressure of the original delivery capacity corresponding to the order to be reassigned, and improve the comprehensive benefits of order reassignment. The comprehensive benefits may include: the delivery effect benefits brought to all orders corresponding to the original delivery capacity (including the alternative order) and the delivery efficiency benefits of the original delivery capacity.

[0075] S106: According to the distribution efficiency improvement degree determined for each candidate order, determine each order to be reassigned from each candidate order.

[0076] In the method of the embodiment of this specification, in the process of determining the order to be reassigned, various alternative orders can be screened out from the unexecuted orders through computing devices such as servers, and the status of the original distribution capacity corresponding to each alternative order can be comprehensively analyzed to analyze the impact of whether the alternative order is reassigned on the distribution efficiency of the original distribution capacity. Finally, according to the analysis results, the order to be reassigned is determined in each alternative order, and the corresponding reassignment is performed, so as not to introduce errors caused by manual screening and matching. The order to be reassigned is part of the alternative order. Through this step, the scope of the order to be reassigned can be further narrowed and the efficiency of reassignment can be improved. In addition, in the process of screening out the reassigned order from the alternative orders, based on the degree of improvement in the distribution efficiency of the alternative order, among the alternative orders, the alternative order that is suitable for the alternative order and the original distribution capacity corresponding to the alternative order is determined as the order to be reassigned, which can significantly improve the efficiency of reassignment and obtain the maximum comprehensive benefit of reassignment.

[0077] S108: Allocate each order to be reassigned to the target delivery capacity.

[0078] In the method of the embodiment of this specification, each order to be reassigned is assigned to a target delivery capacity, so that the target delivery capacity corresponding to the order to be reassigned executes the order to be reassigned. The range of the target delivery capacity can be all delivery capacities including the original delivery capacity corresponding to the order to be reassigned; it can also be the target delivery capacity determined by screening all the delivery capacities corresponding to the server.

[0079] In an optional embodiment of the present specification, determining the candidate order in step S102 may include:

[0080] For each unexecuted order, determine the timeout risk of the unexecuted order based on the path planning of the original delivery capacity corresponding to the unexecuted order. According to the timeout risk of each unexecuted order, determine the alternative order from the unexecuted orders. The path planning in this step is: the path planning determined for the original delivery capacity before the reassignment is implemented.

[0081] The timeout risk of the unexecuted order can be: the duration between the current time and the agreed delivery time of the unexecuted order, determined according to the route planning of the original delivery capacity corresponding to the unexecuted order. The smaller the value corresponding to the timeout risk of the unexecuted order, the greater the possibility of the unexecuted order timing out. For example, the current time is 12:00, the agreed delivery time of the unexecuted order is 12:02, and the duration between the current time and the agreed delivery time of the unexecuted order is two minutes, so the possibility of the unexecuted order timing out is high.

[0082] According to the timeout risk of each unexecuted order, when determining the candidate orders from the unexecuted orders, the timeout risk ranking of each unexecuted order can be determined by comparing the timeout risk corresponding to each unexecuted order, and the first few unexecuted orders with smaller timeout risk values ​​in the timeout risk ranking are selected as the candidate orders. The number of determined candidate orders can be obtained by the server side's own judgment or by manual control. For example, the server side is set to determine ten candidate orders from each unexecuted order in each order reassignment cycle.

[0083] Alternatively, the relationship between the timeout risk corresponding to each unexecuted order and the threshold value corresponding to the timeout risk may be compared respectively, and the alternative order may be determined from the unexecuted orders according to the comparison result. For example, the threshold value corresponding to the timeout risk may be set to ten minutes, and the timeout risk of the unexecuted order may be five minutes. The value corresponding to the timeout risk is less than the threshold value corresponding to the timeout risk, indicating that the unexecuted order is more likely to time out, so that the unexecuted order is more likely to be determined as an alternative order.

[0084] In an optional embodiment of the present specification, determining the candidate order in step S102 may include:

[0085] For each unexecuted order, determine the timeout risk of the unexecuted order based on the path planning of the original delivery capacity corresponding to the unexecuted order. Determine the alternative order from the unexecuted orders based on the timeout risk of each unexecuted order and the offline status score of the original delivery capacity corresponding to the unexecuted order. The path planning in this step is: the path planning determined for the original delivery capacity before the reassignment is implemented.

[0086] The offline status score is used to characterize the communication capability between the original delivery capacity and the server. The smaller the offline status score, the better the communication capability between the original delivery capacity and the server. The unexecuted orders corresponding to the original delivery capacity with a smaller offline status score should be selected as the candidate orders. For the original delivery capacity corresponding to the unexecuted order, the offline status score of the original delivery capacity can be determined based on the current time, the time between the last time the original delivery capacity uploaded its location, and the threshold value corresponding to the offline status score of the delivery capacity. For example, the current time is 12:00, the last time the original delivery capacity uploaded its location was 11:30, and the threshold corresponding to the offline status score of the delivery capacity is ten minutes. The time from the last time the original delivery capacity uploaded its location to the current time exceeds the threshold corresponding to the offline status score of the delivery capacity. In this case, the communication capability between the original delivery capacity and the server is poor, and the offline status score of the original delivery capacity is higher, which reduces the probability that the unexecuted orders corresponding to the original delivery capacity will be determined as alternative orders.

[0087] The offline status score of the delivery capacity can be determined by a variety of factors. For example, if the mobile terminal corresponding to the delivery capacity is not turned on or the delivery capacity is located in an area with weak mobile terminal signals for a long time, the offline status score of the delivery capacity is higher. When the original delivery capacity is in a state with poor contactability for a long time, even if the reassignment-related information (for example, reassignment instructions, re-determined route planning for the original delivery capacity, etc.) is sent to the original delivery capacity, the original delivery capacity may not be able to receive the reassignment-related information in time, and may not be able to respond accordingly based on the reassignment-related information. A higher offline status score will reduce the probability of the unexecuted order corresponding to the original delivery capacity being determined as an alternative order.

[0088] Optionally, the alternative orders may be determined from the unexecuted orders by taking a weighted sum of the timeout risk and the offline status score.

[0089] In an optional embodiment of this specification, if Figure 2 As shown, the determination in step S104 of the degree of improvement in the delivery efficiency of the original delivery capacity corresponding to the alternative order under the condition that the alternative order is reassigned may include:

[0090] S200: Based on the information of the alternative order and the current position of the original delivery capacity corresponding to the alternative order, determine at least one of the reduction in the number of overtime orders, the reduction in total overtime duration, and the reduction in distance of the original delivery capacity under the condition that the alternative order is reassigned.

[0091] When analyzing the degree of improvement in the delivery efficiency of the original delivery capacity corresponding to the alternative order, it is assumed that a re-dispatch is implemented for the alternative order, and the alternative order is transferred from the original delivery capacity corresponding to the alternative order, and the path planning for the original delivery capacity is re-determined, and the original delivery capacity is analyzed under the condition that all orders are executed according to the re-determined path planning, and one or more of the reduction in the number of overtime orders, the reduction in total overtime duration, and the reduction in distance are obtained. The reduction in the number of overtime orders, the reduction in total overtime duration, and the reduction in distance can be used to determine the degree of improvement in the delivery efficiency of the original delivery capacity corresponding to the alternative order. Other parameters can also be introduced when determining the degree of improvement in delivery efficiency.

[0092] S202: Determine the degree of improvement in the delivery efficiency of the original delivery capacity corresponding to the alternative order based on at least one of the determined reduction in the number of overtime orders, the reduction in the total overtime duration, and the reduction in the distance.

[0093] In the embodiment of this specification, it is assumed that the alternative order is reassigned, the alternative order is transferred from the original delivery capacity, and the path planning is re-determined for the original delivery capacity, so that the re-determined path planning includes all orders corresponding to the original delivery capacity except the alternative order. Determine the degree of improvement in delivery efficiency obtained by the original delivery capacity executing each order according to the reassigned path planning compared to before the reassignment.

[0094] The degree of improvement in delivery efficiency can be characterized by at least one of the reduction in the number of overtime orders, the reduction in total overtime duration, and the reduction in distance traveled.

[0095] The number of reduced overtime orders can be expressed as the difference between the number of overtime orders in all the orders that the original delivery capacity executes according to the route planning before the reassignment and the number of overtime orders in all the orders that the original delivery capacity executes according to the reassigned route planning. The number of reduced overtime orders can be used to characterize the degree to which the reassigned route planning can reduce the number of overtime orders for the original delivery capacity. Optionally, the number of reduced overtime orders can be calculated and determined by formula (1):

[0096]

[0097] r∈R,w∈W Formula (1)

[0098] Where:

[0099] T c : Reduce the quantity of overtime orders;

[0100] The original delivery capacity will be executed according to the route planning before the reassignment.

[0101] The number of overdue orders among the orders;

[0102] The number of overdue orders among all orders corresponding to the original delivery capacity executed according to the re-determined route plan after the reassignment;

[0103] R: the set to which each original delivery capacity belongs;

[0104] r: the original delivery capacity;

[0105] W: the set to which each alternative order belongs;

[0106] w: the alternative order.

[0107] The total reduction in timeout duration can be expressed as: the difference between the sum of the timeout durations of all the corresponding orders of the original delivery capacity executed according to the route planning before the reassignment and the sum of the timeout durations of all the corresponding orders of the original delivery capacity executed according to the reassigned route planning. The total reduction in timeout duration can be used to characterize: the degree of reduction in timeout duration that the reassigned route planning can bring to the original delivery capacity. Optionally, the total reduction in timeout duration can be calculated and determined by formula (2):

[0108]

[0109] r∈R,w∈W Formula (2)

[0110] Where:

[0111] T m : The total timeout duration is reduced;

[0112] The sum of the overtime durations of all overdue orders among all orders corresponding to the original delivery capacity executed according to the route plan before the reassignment;

[0113] The original delivery capacity is executed according to the re-determined route plan after the re-dispatch, and the sum of the overtime durations of all the overdue orders in all the corresponding orders.

[0114] The distance reduction can be expressed as: the distance traveled by the original delivery capacity according to the route planning determined before the reassignment to execute all its corresponding orders, compared with the distance traveled by the original delivery capacity according to the reassigned route planning to execute all its corresponding orders, and the ratio of the distance between the pickup location and the delivery location of the alternative order. The distance reduction can be used to characterize: the change in the degree of detour caused by the reassigned route planning compared with the route planning before the reassignment. Optionally, the distance reduction can be calculated and determined by formula (3):

[0115]

[0116] r∈R,w∈W Formula (3)

[0117] Where:

[0118] L: distance reduction;

[0119] The original delivery capacity shall travel the distance of all corresponding orders according to the route planning before the reassignment;

[0120] The original delivery capacity shall travel the distance of all corresponding orders according to the re-determined route planning after the reassignment;

[0121] D w : The distance between the pickup location and the delivery location for this alternative order.

[0122] Optionally, the degree of improvement in delivery efficiency can be obtained by taking a weighted sum of at least one of the reduction in the number of overtime orders, the reduction in the total overtime duration, and the reduction in the distance. Optionally, the degree of improvement in delivery efficiency can be calculated and determined by formula (4):

[0123] S rw =α·T c +β·T m +γ·L Formula (4)

[0124] Where: S rw is the degree of improvement in distribution efficiency; α, β and γ are coefficients.

[0125] In an optional embodiment of this specification, if Figure 3 As shown, the step S106 of determining each order to be reassigned from each candidate order according to the degree of improvement in delivery efficiency determined for each candidate order may include:

[0126] S300: For each original delivery capacity, according to the degree of improvement in delivery efficiency of each candidate order corresponding to the original delivery capacity, a target order corresponding to the original delivery capacity is determined among the candidate orders corresponding to the original delivery capacity.

[0127] In the embodiments of the present specification, for each original delivery capacity corresponding to an alternative order, according to the degree of improvement in delivery efficiency of each alternative order corresponding to the original delivery capacity, an alternative order with an appropriate degree of improvement in delivery efficiency is determined among the alternative orders corresponding to the original delivery capacity as the target order corresponding to the original delivery capacity, thereby further narrowing the scope of the reassigned orders.

[0128] Optionally, in this step, the target orders corresponding to the original delivery capacity can be determined among the alternative orders based on the relationship between the delivery efficiency improvement degree of each alternative order and a preset delivery efficiency improvement threshold. In this case, the number of target orders corresponding to one or several of the original delivery capacities may be different from the number of target orders corresponding to other original delivery capacities.

[0129] Optionally, this step can determine, for each original delivery capacity corresponding to an alternative order, one of the alternative orders according to the degree of improvement in delivery efficiency of the alternative orders corresponding to the original delivery capacity, as the target order corresponding to the original delivery capacity. For example, for each original delivery capacity corresponding to an alternative order, among the alternative orders corresponding to the original delivery capacity, the alternative order with the greatest degree of improvement in delivery efficiency is determined as the target order corresponding to the original delivery capacity, so that each original delivery capacity corresponds to an alternative order, and the reassignment of the alternative order to the original delivery capacity and other orders corresponding to the original delivery capacity brings the greatest benefit.

[0130] S302: For each target order, the original delivery capacity corresponding to the target order is used to determine the time for the target delivery capacity to arrive at the next task point according to the path planning of the target delivery capacity.

[0131] The path planning in this step is: the path planning determined for the original delivery capacity before the reassignment is implemented. The time when the original delivery capacity arrives at the next task point can be determined by the server based on the path planning of the original delivery capacity and the current location of the original delivery capacity.

[0132] S304: Determine the response efficiency of the original delivery transport capacity to the re-dispatch instruction based on the time when the original delivery transport capacity arrives at the next task point.

[0133] In the embodiments of this specification, the response efficiency of the original distribution capacity to the re-dispatch instruction can be used to represent: the time between the time when the server issued the re-dispatch instruction to the original distribution capacity and the time when the original distribution capacity consulted the re-dispatch instruction. The shorter the time corresponding to the response efficiency of the original distribution capacity to the re-dispatch instruction, the higher the response efficiency of the original distribution capacity to the re-dispatch instruction, and the more timely the original distribution capacity can implement corresponding measures according to the re-dispatch instruction.

[0134] The task point can be the pickup location or delivery location corresponding to the order that the original delivery transport capacity is executing. When the original delivery transport capacity arrives at the pickup location or delivery location corresponding to the order being executed, it will check its corresponding mobile terminal or other device connected to the server side. At this time, it is more feasible for the original delivery transport capacity to obtain the re-dispatch instruction and / or new route planning information sent by the server side. The shorter the time it takes for the original delivery transport capacity to arrive at the next task point, the more efficient the original delivery transport capacity is in responding to the re-dispatch instruction and / or new route planning information.

[0135] S306: For each target order, determine each order to be re-dispatched in each target order according to the degree of improvement in the delivery efficiency of the target order and the response efficiency of the original delivery capacity corresponding to the target order to the re-dispatching instruction.

[0136] When the original delivery capacity can promptly learn of the re-dispatch instructions and / or new route planning information, re-dispatch of orders can be implemented for the original delivery capacity. This can improve the efficiency of conveying the re-dispatch instructions, improve the re-dispatch efficiency of the target order, and also improve the delivery efficiency of other orders corresponding to the original delivery capacity and improve the execution efficiency of the orders by the original delivery capacity, thereby improving the overall benefits.

[0137] Optionally, for the original delivery capacity corresponding to each target order, the response efficiency score of the original delivery capacity can be determined according to the response efficiency of the original delivery capacity to the re-dispatch instruction. For each target order, the re-dispatch score of the target order is determined according to the degree of improvement in the delivery efficiency of the target order and the response efficiency score of the original delivery capacity. Among each target order, each order to be re-dispatched is determined according to the re-dispatch score of each target order. Optionally, the re-dispatch score of the target order can be obtained by taking the weighted sum of the degree of improvement in the delivery efficiency of the target order and the response efficiency score of the original delivery capacity.

[0138] Optionally, among the target orders, the orders to be reassigned are determined, and the target orders are sorted according to the reassignment scores. In the sequence obtained by sorting, the orders to be reassigned corresponding to the first few orders of the reassignment scores are selected as the orders to be reassigned.

[0139] Alternatively, among the target orders, the target orders whose redispatching scores reach the redispatching score threshold may be selected as the orders to be redispatched based on the redispatching score and a preset redispatching score threshold.

[0140] In an optional embodiment of the present specification, before step S108, the order reassignment method further includes: determining each delivery capacity other than the original delivery capacity corresponding to each order to be reassigned as the target delivery capacity.

[0141] In the embodiments of the present specification, all delivery capacities except the original delivery capacities corresponding to the orders to be reassigned are used as target delivery capacities, which narrows the scope of delivery capacities that need to be analyzed in the process of determining the corresponding target delivery capacities for the orders to be reassigned, and can improve the reassignment efficiency.

[0142] For each order to be reassigned, when determining the target delivery capacity corresponding to the order to be reassigned, if the target delivery capacity corresponding to the order to be reassigned cannot be determined among the delivery capacities other than the original delivery capacity corresponding to the order to be reassigned, then the original delivery capacity corresponding to the order to be reassigned shall be the target delivery capacity corresponding to the order to be reassigned, and the order to be reassigned shall still be executed by the original delivery capacity.

[0143] Alternatively, all the delivery capacities corresponding to the server side can be used as the target delivery capacity, and for each order to be reassigned, the target delivery capacity corresponding to the order to be reassigned can be determined within the scope of all delivery capacities. When determining the target order corresponding to the order to be reassigned, if all the delivery capacities except the original delivery capacity corresponding to the order to be reassigned are not suitable for executing the order to be reassigned, the order to be reassigned will still be reassigned to the original delivery capacity corresponding to the order to be reassigned, so that the order to be reassigned can be executed.

[0144] In an optional embodiment of this specification, if Figure 4 As shown, allocating each to-be-reassigned order to a target delivery capacity in step S108 may include:

[0145] S400: For each order to be reassigned, determine the matching degree of the order to be reassigned with respect to each target delivery capacity.

[0146] In the embodiments of this specification, the matching degree can be a numerical value, which can be used to characterize the comprehensive impact of the target delivery capacity executing the order to be reassigned on the target delivery capacity, all other orders corresponding to the target delivery capacity, and the order to be reassigned. It can be assumed that the order to be reassigned has been reassigned to the target delivery capacity, and the server has re-determined the path planning for the target delivery capacity. The target delivery capacity executes all its corresponding orders (including the order to be reassigned) according to the re-determined path planning, and then determines the matching degree of the order to be reassigned relative to the target delivery capacity.

[0147] S402: Determine the weight values ​​of each order to be reassigned and each target delivery capacity according to the matching degree of each order to be reassigned relative to each target delivery capacity; wherein, for each order to be reassigned, the sum of the weight value of the order to be reassigned and the weight value of any target delivery capacity is equal to the maximum value of the matching degree of the order to be reassigned relative to each target delivery capacity.

[0148] Optionally, the orders to be reassigned may be taken as a set, and the target delivery capacities may be taken as a set. For each order to be reassigned in the set of orders to be reassigned, the maximum value of the matching degree of the order to be reassigned corresponding to each target delivery capacity is selected as the weight value of the order to be reassigned. It is determined that the weight of each target delivery capacity is zero.

[0149] S404: According to the weight value of each order to be reassigned, the weight value of each target delivery capacity and the matching degree of each order to be reassigned relative to each target delivery capacity, a bipartite graph algorithm is used to assign each order to be reassigned to a target delivery capacity.

[0150] Optionally, when allocating each order to be reassigned to a target delivery capacity, any target delivery capacity that meets the specified conditions may be selected for each order to be reassigned in accordance with a preset order, based on the weight value of the order to be reassigned and the weight values ​​of each target delivery capacity, as the target delivery capacity corresponding to the order to be reassigned. The specified conditions may include: the sum of the weight value of the order to be reassigned and the weight value of the target delivery capacity is equal to the matching degree of the order to be reassigned relative to the target delivery capacity.

[0151] When determining the target delivery capacity for each order to be re-dispatched according to the preset order, determine whether the order to be re-dispatched conflicts with the order to be re-dispatched for which the target delivery capacity has been determined, and determine whether adjustment is required based on the result of the determination. The existence of a conflict may be: if the target delivery capacity corresponding to at least a preset number of orders to be re-dispatched is the same, then there is a conflict between the preset number of orders to be re-dispatched. And, if the result of the determination as to whether there is a conflict is yes, adjust the target delivery capacity corresponding to the order to be re-dispatched for which the target delivery capacity has been determined until there is no conflict. Optionally, the preset order is: the order obtained by sorting the orders to be re-dispatched from large to small according to their weight values.

[0152] The preset number may be an integer greater than one. Optionally, the preset number is two, which indicates that each target delivery capacity can only accept at most one reassigned order. If, during the process of determining the target delivery capacity for an order to be reassigned, two orders to be reassigned appear for the target delivery capacity, it indicates that there is a conflict, and the order to be reassigned of the target delivery capacity determined earlier among the two orders to be reassigned needs to be adjusted.

[0153] Optionally, the preset number is three, which indicates that two orders to be reassigned having the same target delivery capacity are allowed, indicating that the target delivery capacity can be increased by two orders based on the orders corresponding to the route planning determined before the reassignment.

[0154] Alternatively, for different target delivery capacity, the preset number corresponding to the target delivery capacity can be determined according to the ability of the target delivery capacity to accept orders. The ability of the delivery capacity to accept orders can include at least one of: the execution status of the orders that have been executed by the delivery capacity, the upper limit of the order acceptance of the delivery capacity, and the time when the delivery capacity is expected to complete all the corresponding orders. For example, the execution status of the orders that have been executed by the target delivery capacity is relatively smooth, and the cumulative time for early delivery is one hour. Then the target delivery capacity executes its corresponding unexecuted orders according to the path planning determined before the reassignment, and it is expected to obtain a surplus of one hour. In this case, the ability of the target delivery capacity to accept orders is better, and for this target delivery capacity, its corresponding preset number can be appropriately increased to three. For another example, the upper limit of the order acceptance set by the server for the target delivery capacity is ten orders, and the path planning determined before the reassignment of the target delivery capacity only contains six orders. In this case, the ability of the target delivery capacity to accept orders is better, and for this target delivery capacity, the preset number can be increased to five.

[0155] The step of adjusting the target delivery capacity corresponding to the to-be-reassigned order for which the target delivery capacity has been determined until no conflict exists may include: for each target delivery capacity, determining a preset number of to-be-reassigned orders corresponding to the target delivery capacity as conflicting orders. For any one of the preset number of conflicting orders determined, reselecting a dispatch order corresponding to the conflicting order according to a specified condition until no conflict exists.

[0156] Optionally, for any one of the preset number of conflicting orders, according to the specified conditions, reselecting the assigned order corresponding to the conflicting order includes: sorting the preset number of conflicting orders from small to large according to the weight values ​​corresponding to the conflicting orders, determining the order of the conflicting orders, and adjusting the weight values ​​of the first item, the second item and the target delivery capacity in the order of the conflicting orders. According to the adjusted weight values ​​of the first item, the second item and the target delivery capacity, reselecting the target delivery capacity for the adjusted first item and the second item according to the specified conditions until there is no conflict.

[0157] Optionally, adjusting the weight values ​​of the first item, the second item and the target delivery capacity in the order of the conflicting order may include: according to a preset step value, reducing the weight values ​​of the first item and the second item by the step value, and increasing the weight value of the target delivery capacity by the step value. Optionally, the step value is one.

[0158] In an optional embodiment of the present specification, determining the matching degree of the to-be-reassigned order with respect to each target delivery capacity may include:

[0159] For each target delivery transport capacity, according to the current position of the target delivery transport capacity and the information of the order to be reassigned, determine at least one of the total overtime duration increase, the distance increase and the robustness characterization value of the target delivery transport capacity under the condition that the order to be reassigned is reassigned to the target delivery transport capacity;

[0160] The matching degree of the order to be reassigned relative to the target delivery capacity is determined based on at least one of the determined total timeout duration increase, the distance increase and the robustness characterization value.

[0161] In an embodiment of the present specification, under the condition that the order to be reassigned is reassigned to the target delivery capacity, the path planning is re-determined for the target delivery capacity, so that the re-determined path planning includes the order to be reassigned and all unexecuted orders corresponding to the target delivery capacity. The matching degree is determined based on the impact of the target delivery capacity executing each order according to the re-determined path planning compared to the target delivery capacity executing each order according to the path planning before the reassignment. The matching degree of the order to be reassigned relative to the target delivery capacity can be obtained by summing the total timeout increase, the distance increase, and the robustness characterization value.

[0162] The matching degree can be used to express the feasibility of reassigning the order to be reassigned to the target delivery capacity. The matching degree can be characterized by at least one of the total overtime increase, the distance increase, and the robustness characterization value.

[0163] The total increase in timeout duration can be expressed as the difference between the sum of the timeout durations of all the timeout orders in all the orders corresponding to the target delivery capacity executed according to the re-determined route planning after the reassignment and the sum of the timeout durations of all the timeout orders in all the orders corresponding to the target delivery capacity executed according to the route planning before the reassignment. The total increase in timeout duration can be used to characterize the degree of increase in timeout duration that the re-determined route planning can bring to the original delivery capacity. Optionally, the total increase in timeout duration can be calculated and determined by formula (5):

[0164]

[0165] i∈I,j∈J Formula (5)

[0166] Where:

[0167] T ij : The total timeout duration increase;

[0168] The target delivery capacity is executed according to the re-determined route plan after the reassignment, and the sum of the overtime durations of all the overtime orders in all the corresponding orders;

[0169] The target delivery capacity executes the sum of the overtime durations of all overdue orders in all orders corresponding to it according to the route planning before the reassignment;

[0170] I: the set of orders to be reassigned;

[0171] i: the order to be reassigned;

[0172] J: the set corresponding to each target delivery capacity;

[0173] j: The target delivery capacity.

[0174] The distance increase can be expressed as: the target delivery capacity executes all its corresponding orders according to the re-determined route plan after the reassignment, and the target delivery capacity travels more distance than before the reassignment. Optionally, the distance increase can be calculated and determined by formula (6):

[0175]

[0176] i∈I,j∈J Formula (6)

[0177] Where:

[0178] D ij : Increase in distance;

[0179] The target delivery capacity executes the distance traveled by all corresponding orders according to the newly determined route planning after re-dispatching;

[0180] The target delivery capacity is the distance traveled by all corresponding orders according to the route planning before the reassignment.

[0181] In an optional embodiment of the present specification, determining the robustness representation value of the target delivery capacity under the condition that the order to be reassigned is reassigned to the target delivery capacity includes:

[0182] Under the condition that the order to be reassigned is reassigned to the target delivery capacity, according to the path planning of the target delivery capacity, the orders that are delivered in advance are determined among all the orders corresponding to the target delivery capacity. For each order that is delivered in advance, the length of the advance delivery time corresponding to the order that is delivered in advance is determined. Among the lengths of the advance delivery time corresponding to each order that is delivered in advance, the minimum value of the length of the advance delivery time is determined as the robustness characterization value of the target delivery capacity.

[0183] In the embodiments of this specification, the robustness characterization value can be used to characterize: under the condition that the order to be reassigned is reassigned to the target delivery capacity, the path planning for the target delivery capacity is re-determined, and the delivery capacity is expected to execute the allowable delivery time range of the order with the highest possibility of timeout among all its corresponding orders. For example, under the condition that the order to be reassigned is reassigned to the target delivery capacity, the robustness characterization value of the target delivery capacity is thirty, which means that the estimated delivery time of the order with the highest possibility of timeout among the target delivery capacity has a surplus of thirty minutes from the agreed delivery time of the order. Under the condition that the order to be reassigned is reassigned to the target delivery capacity, if the delivery capacity encounters unexpected random events in the process of executing each order, there is still thirty minutes to remedy the situation.

[0184] Optionally, the robustness characterization value can be used as a judgment condition for screening the target distribution capacity. For example, the relationship between the robustness characterization value and the corresponding robustness threshold determined by the target distribution capacity under the condition of executing the order to be reassigned. If the relationship between the robustness characterization value and the preset robustness threshold meets the preset conditions, it indicates that reassigning the order to be reassigned to the target distribution capacity will cause at least one of the orders corresponding to the target distribution capacity to be a timed order. There is a high possibility that the corresponding relationship between the order to be reassigned and the target distribution capacity is directly denied, and the target distribution capacity will no longer be considered when determining the target distribution capacity for the order to be reassigned. Optionally, the preset robustness threshold is a number greater than or equal to zero. If the robustness characterization value is less than or equal to the preset robustness threshold, the matching degree between the order to be reassigned and the target distribution capacity is multiplied by the matching coefficient. Optionally, the matching coefficient is negative infinity.

[0185] Optionally, before determining the distance increase, the robustness characterization value of the target delivery capacity under the condition that the order to be reassigned is reassigned to the target delivery capacity can be determined. If the relationship between the robustness characterization value of the target delivery capacity and a preset robustness threshold satisfies a preset condition, the distance increase of the target delivery capacity for the order to be reassigned is no longer determined.

[0186] In an optional embodiment of the present specification, determining the matching degree of the to-be-reassigned order with respect to each target delivery capacity may further include:

[0187] According to the current position of the target distribution capacity and the information of the order to be reassigned, for the order to be reassigned, the judgment conditions satisfied by the target distribution capacity are determined according to the preset judgment conditions. According to the judgment conditions satisfied by the target distribution capacity, the judgment condition weight value of the target distribution capacity relative to the order to be reassigned is obtained. According to the determined judgment condition weight value, the matching coefficient of the order to be reassigned relative to the target distribution capacity is determined, and each order to be reassigned is assigned to the target distribution capacity according to the determined matching degree and matching coefficient. Optionally, the matching coefficient is negative infinity or one. For example, if for an order to be reassigned, the target distribution capacity does not meet any of the judgment conditions, then the matching degree between the order to be reassigned and the target distribution capacity is multiplied by the matching coefficient negative infinity. If for an order to be reassigned, the target distribution capacity meets all the judgment conditions, then the matching degree between the order to be reassigned and the target distribution capacity is multiplied by the matching coefficient one.

[0188] Analyzing the matching coefficient between the target delivery capacity and the order to be reassigned by judging the conditions may be performed before or after determining the matching degree of the order to be reassigned relative to the target delivery capacity.

[0189] The judgment condition includes at least one of the following:

[0190] The matching degree optimization condition can be used to determine the incremental matching degree obtained when the order to be reassigned is executed by the target delivery capacity compared to before the reassignment. If the incremental matching degree is greater than zero, that is, the matching degree between the order to be reassigned and the target delivery capacity is greater than the matching degree between the order to be reassigned and the original delivery capacity corresponding to the order to be reassigned, it indicates that the target delivery capacity meets the matching degree optimization condition.

[0191] The convenience condition can be used to determine the increment of the detour degree obtained when the order to be reassigned is executed by the target delivery capacity, compared with before the reassignment. The convenience condition can be used to characterize whether the change in the degree of detour brought to the original delivery capacity by the re-determined route planning compared with the route planning before the reassignment satisfies the corresponding relationship with the convenience condition threshold. The detour degree can be expressed as: the ratio of the additional distance traveled by the target delivery capacity when executing all its corresponding orders according to the re-determined route planning after the reassignment, compared with the distance traveled by the original delivery capacity when executing all its corresponding orders according to the route planning before the reassignment, to the distance between the pickup location and the delivery location of the order to be reassigned. If the detour degree of the target delivery capacity is less than the convenience condition threshold, it indicates that the target delivery capacity meets the convenience condition.

[0192] The blacklist condition can be used to determine whether the target delivery capacity is the blacklist delivery capacity corresponding to the order to be reassigned. If the target delivery capacity is not in the blacklist corresponding to the order to be reassigned, it means that the target delivery capacity meets the blacklist condition.

[0193] The delivery capacity acceptance condition can be used to determine whether the order to be reassigned to the target delivery capacity will exceed the order acceptance capacity of the target delivery capacity. If the number of orders corresponding to the target delivery capacity does not exceed the order acceptance capacity of the target delivery capacity, it means that the target delivery capacity meets the order acceptance condition.

[0194] based on Figure 1 The business execution method shown in the embodiment of this specification also corresponds to a structural schematic diagram of a device for providing order reassignment, such as Figure 5 shown.

[0195] Figure 5 A schematic diagram of the structure of an order reassignment device provided in an embodiment of this specification, the device comprising:

[0196] An information acquisition module 500, configured to acquire information of unexecuted orders;

[0197] The alternative order determination module 502 is configured to determine alternative orders from the unexecuted orders according to the information of the unexecuted orders and the information of the originally scheduled delivery capacity respectively corresponding to the unexecuted orders;

[0198] The efficiency determination module 504 is configured to determine, for each candidate order, the degree of improvement in the delivery efficiency of the original delivery capacity corresponding to the candidate order under the condition that the candidate order is reassigned;

[0199] The module 506 for determining orders to be reassigned is configured to determine each order to be reassigned from each candidate order according to the degree of improvement in delivery efficiency determined for each candidate order;

[0200] The allocation module 508 is configured to allocate each to-be-reassigned order to a target delivery capacity.

[0201] In this specification, the to-be-reassigned order determination module 506 is electrically connected to the candidate order determination module 502 , the efficiency determination module 504 and the allocation module 508 , respectively, and the candidate order determination module 502 is also electrically connected to the information acquisition module 500 .

[0202] Optionally, the alternative order determination module 502 may include: a timeout risk determination submodule 5020 and a alternative order determination submodule 5022, and the timeout risk determination submodule 5020 and the alternative order determination submodule 5022 are electrically connected.

[0203] The timeout risk determination submodule 5020 is configured to determine the timeout risk of each unexecuted order according to the path planning of the original distribution capacity corresponding to the unexecuted order. The alternative order determination submodule 5022 is configured to determine alternative orders from the unexecuted orders according to the timeout risk of each unexecuted order.

[0204] Optionally, the efficiency determination module 504 may include: an efficiency improvement degree submodule, and at least one of an overtime order quantity submodule, an overtime duration submodule, and a distance reduction quantum module. The efficiency improvement degree submodule is electrically connected to at least one of the overtime order quantity submodule, the overtime duration submodule, and the distance reduction quantum module.

[0205] The overtime order quantity submodule is configured to determine the reduction quantity of the overtime orders of the original delivery capacity under the condition that the alternative order is reassigned based on the information of the alternative order and the current position of the original delivery capacity corresponding to the alternative order.

[0206] The timeout duration submodule is configured to determine the reduction in the total timeout duration of the original delivery capacity under the condition that the alternative order is reassigned based on the information of the alternative order and the current position of the original delivery capacity corresponding to the alternative order.

[0207] The distance reduction quantum module is configured to determine the distance reduction amount of the original delivery capacity under the condition that the alternative order is reassigned based on the information of the alternative order and the current position of the original delivery capacity corresponding to the alternative order.

[0208] The efficiency improvement degree submodule is configured to determine the degree of improvement in the delivery efficiency of the original delivery capacity corresponding to the alternative order based on at least one of the determined reduction in the number of overtime orders, the reduction in total overtime duration, and the reduction in distance.

[0209] The order determination module 506 to be reassigned may include: a first determination submodule 5060 and a second determination submodule 5062, wherein the first determination submodule 5060 and the second determination submodule 5062 are electrically connected. The first determination submodule 5060 is configured to determine, for each originally scheduled delivery capacity, a target order corresponding to the original delivery capacity among the alternative orders corresponding to the original delivery capacity according to the degree of improvement in delivery efficiency of the alternative orders corresponding to the original delivery capacity. The second determination submodule 5062 is configured to determine the orders to be reassigned among the target orders.

[0210] Optionally, the second determination submodule 5062 may include: a response efficiency determination unit and a to-be-redispatched order determination unit. The response efficiency determination unit and the to-be-redispatched order determination unit are electrically connected. The response efficiency determination unit is configured to determine, for each target order, the original delivery capacity corresponding to the target order, based on the path planning of the original delivery capacity, the time for the original delivery capacity to arrive at the next task point, and determine the response efficiency of the original delivery capacity to the redispatching instruction based on the time for the original delivery capacity to arrive at the next task point. The to-be-redispatched order determination unit is configured to determine, for each target order, each to-be-redispatched order in each target order based on the degree of improvement in the delivery efficiency of the target order and the response efficiency of the original delivery capacity corresponding to the target order to the redispatching instruction.

[0211] Optionally, in this specification, the order reassignment device may further include: a target delivery capacity determination module configured to determine each delivery capacity other than the original delivery capacity corresponding to each order to be reassigned as the target delivery capacity. The target delivery capacity determination module is electrically connected to the allocation module.

[0212] Optionally, the allocation module 508 may include: a matching degree determination submodule 5080, a weight value determination submodule 5082, and an order allocation submodule 5084. The weight value determination submodule 5082 is electrically connected to the matching degree determination submodule 5080 and the order allocation submodule 5084, respectively.

[0213] Optionally, the matching degree determination submodule 5080 may include: at least one of a timeout duration increment determination unit, a distance increment determination unit, and a robustness characterization value determination unit, and a matching degree determination unit. The matching degree determination unit is electrically connected to at least one of the timeout duration increment determination unit, the distance increment determination unit, and the robustness characterization value determination unit.

[0214] Optionally, the robustness characterization value determination unit may include: an advance delivery order determination subunit, an advance delivery time determination subunit and a robustness characterization value determination subunit. The advance delivery time determination subunit is electrically connected to the advance delivery order determination subunit and the robustness characterization value determination subunit respectively.

[0215] The early delivery order determination subunit is configured to determine the early delivery orders among all the orders corresponding to the target delivery capacity according to the path planning of the target delivery capacity under the condition that the order to be reassigned is reassigned to the target delivery capacity. The early delivery time determination subunit is configured to determine the early delivery time length corresponding to each early delivery order. The robustness characterization value determination subunit is configured to determine the minimum value of the early delivery time length among the early delivery time lengths corresponding to the early delivery orders, as the robustness characterization value of the target delivery capacity.

[0216] The embodiments of the present specification also provide a computer-readable storage medium storing a computer program, which can be configured to execute any one of the above-mentioned order reassignment methods.

[0217] based on Figure 1 The method for executing the service shown in the figure, the embodiment of this specification also proposes the following Figure 6 The electronic equipment shown. Figure 6 At the hardware level, the electronic device includes a processor, an internal bus, a network interface, a memory, and a non-volatile memory, and may also include other hardware required for the business. The processor reads the corresponding computer program from the non-volatile memory into the memory and then runs it to implement any of the above-mentioned order reassignment methods.

[0218] Of course, in addition to software implementation, this specification does not exclude other implementation methods, such as logic devices or a combination of software and hardware, etc., that is to say, the executor of the following processing flow is not limited to each logic unit, but can also be hardware or logic devices.

[0219] The above description is only an embodiment of the present specification and is not intended to limit the present specification. For those skilled in the art, the present specification may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present specification shall be included in the scope of the claims of the present specification.

Claims

1. A method for reassigning an order, characterized in that: include: Get information about unexecuted orders; Determine alternative orders from the unexecuted orders according to the information of the unexecuted orders and the information of the originally scheduled delivery capacity corresponding to the unexecuted orders; For each alternative order, determine the degree of improvement in the delivery efficiency of the original delivery capacity corresponding to the alternative order under the condition that the alternative order is reassigned; According to the degree of improvement in delivery efficiency determined for each candidate order, determine each order to be re-dispatched from among the candidate orders; Allocate each order to be reassigned to the target delivery capacity; Wherein, determining the alternative orders from the unexecuted orders includes: For each unexecuted order, determine the timeout risk of the unexecuted order based on the route planning of the original delivery capacity corresponding to the unexecuted order; Determining alternative orders from among the unexecuted orders according to the timeout risk of the unexecuted orders; The step of determining the orders to be reassigned from the candidate orders according to the degree of improvement in delivery efficiency determined for each candidate order includes: For each originally scheduled delivery capacity, according to the degree of improvement in delivery efficiency of each candidate order corresponding to the originally scheduled delivery capacity, a target order corresponding to the originally scheduled delivery capacity is determined among the candidate orders corresponding to the originally scheduled delivery capacity; Among the target orders, determine the orders to be reassigned; The step of determining each order to be reassigned in each target order includes: For each target order, the original delivery capacity corresponding to the target order is used to determine the time when the target delivery capacity arrives at the next task point according to the route planning of the target delivery capacity. Determine the response efficiency of the original delivery capacity to the re-dispatch instruction based on the time when the original delivery capacity arrives at the next task point; For each target order, the orders to be re-dispatched are determined in each target order according to the degree of improvement in the delivery efficiency of the target order and the response efficiency of the original delivery capacity corresponding to the target order to the re-dispatching instruction.

2. The method according to claim 1, characterized in that The determination of the degree of improvement in the delivery efficiency of the original delivery capacity corresponding to the alternative order under the condition that the alternative order is reassigned includes: Determine, based on the information of the alternative order and the current position of the original delivery capacity corresponding to the alternative order, at least one of a reduction in the number of overdue orders, a reduction in the total overtime duration, and a reduction in the distance of the original delivery capacity under the condition that the alternative order is reassigned; The degree of improvement in delivery efficiency of the original delivery capacity corresponding to the alternative order is determined based on at least one of the determined reduction in the number of overtime orders, the reduction in the total overtime duration, and the reduction in distance.

3. The method according to claim 1 or 2, characterized in that The allocation of each to-be-reassigned order to the target delivery capacity includes: For each order to be reassigned, determine the matching degree of the order to be reassigned with respect to each target delivery capacity; According to the matching degree of each order to be reassigned with respect to each target delivery capacity, the weight value of each order to be reassigned and each target delivery capacity is determined respectively; According to the weight value of each order to be reassigned, the weight value of each target delivery capacity and the matching degree of each order to be reassigned relative to each target delivery capacity, a bipartite graph algorithm is used to allocate each order to be reassigned to the target delivery capacity.

4. The method according to claim 3, characterized in that Determining the matching degree of the order to be reassigned with respect to each target delivery capacity includes: For each target delivery transport capacity, according to the current position of the target delivery transport capacity and the information of the order to be reassigned, determine at least one of the total overtime duration increase, the distance increase and the robustness characterization value of the target delivery transport capacity under the condition that the order to be reassigned is reassigned to the target delivery transport capacity; The matching degree of the order to be reassigned relative to the target delivery capacity is determined based on at least one of the determined total timeout duration increase, the distance increase and the robustness characterization value.

5. The method according to claim 4, characterized in that Determine the robustness representation value of the target delivery capacity under the condition that the order to be reassigned is reassigned to the target delivery capacity, including: Under the condition that the to-be-reassigned order is reassigned to the target delivery transport capacity, according to the route planning of the target delivery transport capacity, the order to be delivered in advance is determined among all the orders corresponding to the target delivery transport capacity; For each early delivery order, determine the early delivery time length corresponding to the early delivery order; Among the advance delivery time lengths corresponding to the respective advance delivery orders, the minimum value of the advance delivery time lengths is determined as the robustness representation value of the target delivery capacity.

6. A device for reassigning an order, characterized in that: include: An information acquisition module configured to acquire information of unexecuted orders; An alternative order determination module, configured to determine alternative orders from the unexecuted orders according to the information of the unexecuted orders and the information of the originally scheduled delivery capacity respectively corresponding to the unexecuted orders; An efficiency determination module is configured to determine, for each candidate order, a degree of improvement in the delivery efficiency of the original delivery capacity corresponding to the candidate order under the condition that the candidate order is reassigned; A module for determining orders to be reassigned, configured to determine each order to be reassigned from each candidate order according to the degree of improvement in delivery efficiency determined for each candidate order; An allocation module configured to allocate each to-be-reassigned order to a target delivery capacity; Wherein, determining the alternative orders from the unexecuted orders includes: For each unexecuted order, determine the timeout risk of the unexecuted order based on the route planning of the original delivery capacity corresponding to the unexecuted order; Determining alternative orders from among the unexecuted orders according to the timeout risk of the unexecuted orders; The step of determining the orders to be reassigned from the candidate orders according to the degree of improvement in delivery efficiency determined for each candidate order includes: For each originally scheduled delivery capacity, according to the degree of improvement in delivery efficiency of each candidate order corresponding to the originally scheduled delivery capacity, a target order corresponding to the originally scheduled delivery capacity is determined among the candidate orders corresponding to the originally scheduled delivery capacity; Among the target orders, determine the orders to be reassigned; The step of determining each order to be reassigned in each target order includes: For each target order, the original delivery capacity corresponding to the target order is used to determine the time when the target delivery capacity arrives at the next task point according to the route planning of the target delivery capacity. Determine the response efficiency of the original delivery capacity to the re-dispatch instruction based on the time when the original delivery capacity arrives at the next task point; For each target order, the orders to be re-dispatched are determined in each target order according to the degree of improvement in the delivery efficiency of the target order and the response efficiency of the original delivery capacity corresponding to the target order to the re-dispatching instruction.

7. A computer-readable storage medium, characterized in that: The storage medium stores a computer program, and when the computer program is executed by a processor, the method described in any one of claims 1 to 5 is implemented.

8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, the method described in any one of claims 1 to 5 is implemented.

Images