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

By judging whether the rider performs business according to the path plan and reschedule the rider's orders in advance, the problems of low efficiency and high uncertainty in order rescheduling in the existing technology are solved, and more efficient delivery and better user experience are achieved.

CN112434986BActive Publication Date: 2024-11-26BEIJING SANKUAI ONLINE TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN201910789239.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2019-08-26
Publication Date
2024-11-26
Estimated Expiration
2039-08-26

AI Technical Summary

Technical Problem

The prior art changes in order matching due to uncertain factors during rider delivery, resulting in reduced delivery efficiency and poor user experience, and low order relocation efficiency and high uncertainty.

Method used

By judging whether the rider plans to perform business according to his own path, if so, determine the orders that meet the specified conditions from the orders processed by him. If otherwise, all of his orders will be reassigned to avoid orders that have been assigned in advance. and order reassignment is carried out based on the re-determined assignment relationship.

Benefits of technology

It reduces the uncertainty of order reassignment, improves the effect of reassignment, reduces the risk of delivery timeout, and improves delivery efficiency and user experience.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN112434986B_ABST
    Figure CN112434986B_ABST
Patent Text Reader

Abstract

This specification discloses a method, device, computer-readable storage medium, and electronic device for reassigning orders. First, according to the order processing situation, a rider who has an assignment relationship with the order to be processed is determined as the target rider. Then, it is determined whether the target rider performs the business according to his own path planning. If so, from the orders processed by the target rider, orders that meet the specified conditions are determined for reassignment. If not, all the orders processed by the target rider are reassigned. By advancing the process of reassigning orders to before assigning them to riders, various problems caused by reassigning orders that have been assigned to riders are avoided. The uncertainty of the order reassignment process is reduced, and the effect of order reassignment is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

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

[0002] At present, in order to improve delivery efficiency, food delivery platforms assign orders to riders according to the matching degree between orders and riders and the scheduling cycle. Generally, before assigning an order to a rider, the platform can also determine the orders that can be processed according to the preset order processing conditions, and perform the order processing, and assign other orders to riders. The order processing is: temporarily do not assign the order to the rider, but still maintain the assignment relationship between the order and the rider, waiting for subsequent scheduling. This provides the possibility of a more optimized delivery method when scheduling again in the future.

[0003] In addition, in order to facilitate the riders to perform delivery business more effectively, the platform will send the corresponding route planning to the riders when assigning the undisplayed orders to the riders according to the scheduling cycle. The route planning includes the riders' delivery route, the order of picking up and delivering the meals for each order, and other information.

[0004] In the actual delivery process, the riders will inevitably be affected by some uncertain factors that interfere with delivery, resulting in changes in the matching degree between the orders assigned to the rider and the rider, which will reduce the efficiency of the rider's delivery business and affect the user experience. For example, if the rider fails to deliver the orders in sequence, the merchant fails to prepare the delivery items on time, the rider's driving speed does not reach the expected value due to road conditions, etc., the rider may need to spend more time to complete the order, resulting in reduced delivery efficiency, and may also cause delivery timeouts, reducing the user experience.

[0005] In the prior art, generally, for the orders that have been assigned to the riders, the matching degree between the assigned orders and the riders is determined, and the orders that need to be reassigned are determined and reassigned, so as to reduce the impact of the matching degree change on the delivery efficiency and user experience.

[0006] However, the order reassignment in the prior art is aimed at the already assigned orders. Therefore, when the rider who originally delivered the assigned order disagrees with the order reassignment, the platform cannot reassign the order according to the order reassignment plan. Since the determined order reassignment plan may not be executed, the reassignment efficiency is low and the uncertainty of reassignment is high, making the effect of the existing order reassignment method less than ideal. Summary of the invention

[0007] The order reassignment method, device, computer-readable storage medium, and electronic device provided in the embodiments of this specification are used to partially solve the problems existing in the prior art.

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

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

[0010] Determine the rider who has an assignment relationship with the order that has been suppressed as the target rider;

[0011] Determine whether the target rider performs the service according to its own route planning;

[0012] If so, an order meeting the specified conditions is determined from the orders that the target rider has placed on hold as a reassignment order, and the reassignment order is reassigned;

[0013] If not, it is determined that all the orders that the target rider has placed on hold are reassignment orders, and the reassignment orders are reassigned.

[0014] Optionally, the determining whether the target rider performs the service according to its own path planning includes:

[0015] If the target rider does not accept the assigned orders of other riders within the specified time period, and the target rider performs the service in the delivery order of the assigned orders in the route planning, and the distance between the target rider and the earliest task point that needs to be reached in the route planning is less than the distance between the target rider and any other task point, then it is determined that the target rider performs the service according to his own route planning;

[0016] If the target rider accepts assigned orders from other riders within a specified time period, or the target rider fails to perform business in accordance with the delivery order of the assigned orders in the route planning, or the distance between the target rider and the earliest task point that needs to be reached in the route planning is not less than the distance between the target rider and any other task point, it is determined that the target rider fails to perform business in accordance with his own route planning.

[0017] Optionally, determining an order that meets a specified condition from the orders that are being held back by the target rider as a reassignment order includes:

[0018] After determining to assign the order to be processed by the target rider to the target rider, the target rider's updated route planning;

[0019] According to the updated route planning, from the orders that the target rider has placed on hold, orders that meet specified conditions are determined as reassignment orders;

[0020] The specified conditions include at least one of the following: delivery timeout, reverse delivery, and other orders with undetermined assignment relationships meeting order consolidation conditions.

[0021] Optionally, the method further comprises:

[0022] Orders that do not meet the specified conditions will be assigned to the target rider.

[0023] Optionally, the reassigning the reassignment order includes:

[0024] Determine a pool of orders to be assigned based on the unassigned orders and the reassigned orders received within a specified time period;

[0025] Re-determine the assignment relationship between the reassigned order and the rider according to a preset assignment algorithm and the orders in the to-be-assigned order pool;

[0026] The reassignment order is assigned according to the re-determined assignment relationship.

[0027] Optionally, assigning the reassignment order according to the re-determined assignment relationship includes:

[0028] According to the re-determined assignment relationship, a rider having an assignment relationship with the reassigned order is determined as the assigned rider;

[0029] According to each order having an assignment relationship with the assigned rider, judging whether the reassignment meets the order suppression processing conditions;

[0030] If so, the reassignment order is suppressed;

[0031] If not, the reassigned order is assigned to the assigned rider.

[0032] Optionally, the step of determining a rider who has an assignment relationship with the order that has been subjected to order suppression as a target rider includes:

[0033] Determine the riders who have an assignment relationship with the orders that have been suppressed as candidate riders;

[0034] From among the candidate riders, a rider whose rider status is not in the specified status is determined as a target rider;

[0035] The specified status includes at least: busy and offline.

[0036] The order reassignment device provided in this manual includes:

[0037] A rider determination module, configured to determine a rider who has an assignment relationship with the order that has been subjected to order suppression processing as a target rider;

[0038] A re-dispatch module is configured to determine whether the target rider performs business according to his own route planning. If so, orders that meet specified conditions are determined from the orders that the target rider has pressed orders for, as re-dispatch orders, and the re-dispatch orders are re-dispatched. If not, it is determined that all the orders that the target rider has pressed orders for are re-dispatch orders, and the re-dispatch orders are re-dispatched.

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

[0040] 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 is characterized in that the above-mentioned order reassignment method is implemented when the processor executes the program.

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

[0042] First, according to the order-pressing processing situation, the rider who has an assignment relationship with the order to be pressed is determined as the target rider. Then, it is determined whether the target rider performs the business according to his own path planning. If so, the orders that meet the specified conditions are determined from the orders that the target rider has pressed to reassign. If not, all the orders that the target rider has pressed to reassign are reassigned. By advancing the process of reassigning orders before assigning them to riders, various problems caused by the need to reassign assigned orders can be avoided. In addition, by judging whether the rider is performing the business according to his own delivery path, it can be determined whether the rider is affected by uncertain factors that interfere with delivery, so as to determine the reassignment of orders using different methods. If the rider performs the business according to his own path planning, the possibility of changes in the matching degree between the rider and the order is still low, so the reassignment of the order can be determined according to the specified conditions. If the rider does not perform the business according to his own path planning, it means that the matching degree between the rider and the order has begun to change. In order to reduce the risk of delivery timeouts and other situations, all orders that the rider has pressed to reassign can be reassigned. It reduces the uncertainty of order reassignment and improves the effect of order reassignment. BRIEF DESCRIPTION OF THE DRAWINGS

[0043] 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:

[0044] Figure 1 The process of reassigning existing orders;

[0045] Figure 2 A flowchart of a method for reassigning an order provided in an embodiment of this specification;

[0046] Figure 3 A schematic diagram of determining whether a target rider performs business according to its own delivery route provided in an embodiment of this specification;

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

[0048] Figure 5 A schematic diagram of an electronic device for implementing an order reassignment method provided in an embodiment of this specification. DETAILED DESCRIPTION

[0049] 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.

[0050] In the prior art, the process of reassigning an order is as follows: Figure 1 As shown, the following steps may be included:

[0051] S100: From the orders that have been assigned to the riders, determine the orders that can be reassigned to other riders as the reassigned orders, and use the riders who currently have an assignment relationship with the reassigned orders as the original riders.

[0052] S102: Determine a rider who can execute the reassigned order from other riders as an optional rider.

[0053] S104: Determine an order reassignment plan based on the matching degree between the reassigned order and the available riders.

[0054] S106: When the original rider agrees to reassign the order, the platform will reassign the order to the available rider according to the order reassignment plan.

[0055] Among them, reassigned orders are usually orders that the rider has not started to execute yet, but are expected to be timed out, and reassigned to other riders to avoid timeouts. Optional riders are usually riders with fewer assigned orders. The reassignment plan can determine which reassigned order to which optional rider.

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

[0057] Figure 2The flowchart of the method for order reassignment provided in the embodiment of this specification may include one or more of the following steps:

[0058] S202: Determine a rider who has an assignment relationship with the order that has been suppressed as the target rider.

[0059] In this specification, the order reassignment process can be executed by the server of the distribution platform. In order to avoid the problem of low efficiency and high uncertainty in reassignment of orders for assigned orders, the server can determine the reassigned orders from the orders that have not yet been assigned to the riders. In addition, since the orders that are subject to order suppression are usually because the matching degree between the orders and the riders is not ideal, the server can first determine the rider who has an assignment relationship with the orders that have been subject to order suppression as the target rider. The subsequent steps can then determine the orders to be reassigned from the orders that the target riders have subjected to order suppression. Among them, the specific method of order suppression is to temporarily not assign the order to the rider, so as to reserve the possibility for the order to find a better matching rider later. For example, the subsequent receipt of other orders that can be combined with the order is equivalent to finding a delivery method with better delivery efficiency for the order.

[0060] Specifically, the server usually determines the assignment relationship between the order and the rider according to the scheduling cycle and the calculated matching degree between the rider and the order, and the premise of pressing the order is that the assignment relationship between the order and the rider has been determined. Therefore, the server can determine the orders that have been pressed in the current scheduling cycle, and determine the rider who has the assignment relationship with the original order that has been pressed as the target rider.

[0061] Of course, the server may simultaneously process the order and determine the rider as the target rider when determining that the order meets the conditions for processing the order, or after determining the orders that have been processed for the current scheduling cycle, determine the rider with whom each order has an assigned relationship. The specific method is not limited in this manual.

[0062] Since the reason for suppressing the order is that the match between the order and the rider is not ideal, the target rider determined by step S202 can be considered as a rider with potential problems in the execution of the delivery business. The potential problem may be simply because there is no more suitable rider to deliver the order, or it may be because there is a problem with the rider's delivery, such as delivery timeout or an accident during delivery. Therefore, by determining the target rider, the complexity of subsequent steps can be reduced, and the efficiency of order reassignment can be improved. At the same time, one of the purposes of suppressing orders is to find a more efficient delivery method. Therefore, determining how to reassign orders based on the standard rider is also in line with the original intention of suppressing orders.

[0063] S204: Determine whether the target rider performs the service according to his own path planning. If so, execute step S206; otherwise, execute step S208.

[0064] In this specification, after the server has identified the target rider from the riders, it can determine, for at least one target rider, whether the target rider is performing services according to the path planning provided to the rider by the platform, and perform asynchronous steps based on the judgment result. In order to improve the delivery efficiency of the riders, the platform will optimize the rider's delivery path according to the orders that have been assigned to the riders. In other words, if the rider performs services according to the path planning, the delivery efficiency is guaranteed. However, since the riders have their own delivery preferences and the actual delivery environment is relatively complex, the riders may not perform services according to their own path planning. At this time, the risk of delivery timeout for the orders that have been assigned to the rider is increasing.

[0065] Therefore, for the orders that have been suppressed by the target rider, the purpose of suppressing the orders is to hope that a better delivery method for the order may appear in the future. However, if the target rider does not execute the business according to his own route planning, it means that an abnormality has occurred in the delivery process of the target rider. When an abnormality occurs in the delivery process of the target rider, the risk of delivery timeout of the assigned orders begins to increase, and the risk of delivery timeout of the orders that have been suppressed by the target rider will also increase. Even because the matching degree of the orders that have been assigned to the target rider is usually higher than the matching degree of the orders that have been suppressed and the target rider, the risk of delivery timeout of the orders that have been suppressed increases to a higher degree.

[0066] Specifically, when the server determines whether the target rider performs the service according to its own delivery route, it can determine in turn whether the target rider accepts the assigned orders of other riders within the specified time period, whether the target rider performs the service according to the delivery order of the assigned orders in its own route planning, and whether the distance between the target rider and the earliest task point that needs to be reached in its own route planning is less than the distance between the target rider and any other task point. If the above judgment results are all yes, it is determined that the target rider performs the service according to its own route planning. If any of the above judgment results is no, it is determined that the target rider does not perform the service according to its own route planning. Figure 3 shown.

[0067] Figure 3 This is a schematic diagram of the process of judging whether the target rider performs the business according to his own delivery route. Of course, the order of each judgment step can be set as needed. Figure 3 The figure is for illustration only.

[0068] Determine whether the target rider accepts the assigned orders of other riders within the specified time period. After accepting the transfer request of other riders, the rider needs to execute the order that is not assigned to him / her. Therefore, such riders can no longer execute the business according to the path planning provided by the platform, and need to execute step S206.

[0069] Among them, the designated time period can be set as needed (such as the time period corresponding to the previous scheduling cycle, the last 10 minutes, etc.), and the purpose of this judgment step is to determine whether the target rider has accepted the transfer request of other riders. When the target rider receives the transfer request of other riders, since the transfer of other riders is not in the path planning determined for the rider, the target rider must no longer be able to perform business according to his own path planning. Since the current distribution platform allows riders to transfer the assigned orders as needed, or the person in charge of the distribution area transfers the orders of the riders delivering in the distribution area as needed, but the server will not assign orders to the riders before the scheduling time arrives. Therefore, if the target rider does not accept the transfer request of other riders, the number of orders with the target rider having an assignment relationship within the specified time period will not increase. Therefore, the server can determine whether the number of orders that have an assignment relationship with the target rider at the starting time point of the specified time period is less than the number of orders that have an assignment relationship with the target rider at the end time point of the specified time period. If so, it means that the target rider has accepted the order transfer request from other riders and executes step S206; otherwise, it has not been accepted.

[0070] For judging whether the target rider performs the business in the order of delivery of the assigned orders in the route planning. The server can first determine the order of delivery of the delivery business that the target rider has performed, and then determine whether the order of delivery of the delivery business that has been performed is consistent with the order of delivery of the assigned orders in the route planning. If so, it is determined that the target rider performs the business in the order of delivery of the assigned orders in the route planning. Otherwise, the business is performed in the order of delivery of the assigned orders in the route planning. When the rider does not deliver according to the order in the route planning, it will also lead to a decrease in the initial delivery efficiency and increase the risk of order timeout. Among them, the server can determine the delivery order of the target rider according to the order in which the target rider arrives at the task points corresponding to each assigned order.

[0071] It is determined whether the distance between the target rider and the earliest task point that needs to be reached in the path planning is less than the distance between the target rider and any other task point. Since there is still a situation where the delivery order of the target rider's business is consistent with the delivery order in the path planning, but the assigned order corresponding to the delivery task performed by the target rider later is different from the assigned order that needs to be executed earliest in the path planning. For example, suppose that the delivery order of the assigned orders of the target rider X is: Order A, Order B, Order C, Order D in the path planning. Assuming that the delivery order of the delivery tasks that the target rider X has executed is Order A and Order B, the server can determine that the target rider X performs the business according to the delivery order of the assigned orders in the path planning. If the target rider X does not continue to perform the delivery task of Order C, but performs the delivery task of Order D, but does not reach the task point corresponding to the pickup location of Order D, then by judging whether the distance between the target rider X's position and the task point corresponding to the pickup location of Order C is less than the distance between the target rider X and any other task point, it can be determined whether the target rider X will perform the delivery task in the delivery order in the path planning. If so, the target rider performs the service according to his own route planning; otherwise, the target rider does not perform the service according to his own route planning.

[0072] S206: Determine the orders that meet the specified conditions from the orders that the target rider has placed on hold as reassignment orders, and reassign the reassignment orders.

[0073] In this specification, if the server determines that the target rider is performing business according to his own route planning, it means that the target rider is less likely to have order delivery timeouts in the future. The server can determine the reassigned orders from the orders that the target rider has pressed according to the specified conditions, and reassign the reassigned orders. Since the purpose of pressing orders is to seek better delivery methods and improve delivery efficiency in the future, the server can reassign orders when there are orders that meet the specified conditions. Of course, if there are no orders that meet the specified conditions, the server can determine to assign the orders that have been pressed to the target rider at the next scheduling time.

[0074] Specifically, when determining whether the orders to be processed by the target rider meet the specified conditions, the server can first determine the target rider's updated route plan after assigning the orders to be processed by the target rider, and then determine the orders that meet the specified conditions as the reassigned orders from the orders to be processed by the target rider according to the updated route plan. The specified conditions may include: delivery timeout, reverse delivery, and other orders with undetermined assignment relationships meeting the order combination conditions.

[0075] In this specification, when the specified condition is delivery timeout, the server can first determine the estimated delivery time of each order to be processed in the updated route planning, and then for each order to be processed, determine whether the estimated delivery time of the order is later than the promised delivery time of the order. If so, it is determined that the order meets the specified condition. Of course, if the target rider has only one order to be processed, it only needs to determine whether the delivery of the order to be processed has timed out.

[0076] When the specified condition is reverse delivery, the server can determine whether the order being processed will cause the target rider to need reverse delivery in the updated route planning. If so, it is determined that the order being processed meets the specified condition. Among them, since there are relatively mature methods for identifying reverse delivery orders in the prior art, and this specification does not involve improvements to the reverse delivery identification method, the reverse delivery identification process will not be described in detail.

[0077] When the specified condition is to meet the order combination condition, since the goal of order suppression is to find a better delivery method to improve delivery efficiency, when the order to be suppressed meets the order combination condition with other orders that have a certain assignment relationship, the efficiency of merging the order to be suppressed with other orders is higher than executing the delivery task corresponding to the order to be suppressed alone. Therefore, the order that meets the order combination condition can be used as a reassignment order.

[0078] In this specification, as long as the order to be processed meets at least one of the above specified conditions, the server can reassign the order as a reassignment order. That is to say, when the target rider performs business according to his own delivery route, he only needs to consider whether the order to be processed is reasonable for the rider to deliver. If it is unreasonable (that is, it meets the specified conditions), only the unreasonable order to be processed will be reassigned. For the order to be processed that does not meet the specified conditions, there is no need to reassign it.

[0079] S208: Determine that all the orders that the target rider has placed on hold are reassignment orders, and reassign the reassignment orders.

[0080] In this specification, if the target rider does not perform the business according to his own route planning, it is difficult to predict the subsequent behavior of the target rider, and it is also difficult to determine whether the delivery efficiency can be guaranteed after the orders for which orders are being pressed are still assigned to the target rider. Therefore, the server can determine that all orders for which the target rider is pressing orders are reassigned orders, and reassign them. In other words, regardless of whether the specified conditions are met, the server can reassign all orders for which the target rider is pressing orders. At this time, the consideration is no longer whether the order will time out, but that the target rider is no longer suitable for assigning orders, so all orders for which the target rider is pressing orders can be treated as reassigned orders.

[0081] based on Figure 2 The method of order reassignment shown avoids various problems caused by the need to reassign already assigned orders by advancing the process of reassigning orders to before assigning them to riders. In addition, by judging whether the rider is performing business according to his own delivery route, it is possible to determine whether the rider is affected by uncertain factors that interfere with delivery, and thus adopt different methods to determine the reassignment of orders. If the rider performs business according to his own route planning, the possibility of changes in the matching degree between the rider and the order is still low, then the reassignment of the order can be determined according to the specified conditions. If the rider does not perform business according to his own route planning, it means that the matching degree between the rider and the order has begun to change. In order to reduce the risk of delivery timeouts and other situations, all orders that the rider has suppressed can be reassigned. The uncertainty of order reassignment is reduced and the effect of order reassignment is improved.

[0082] In addition, in the present specification, the server may perform the same process of reassigning the determined reassignment orders in step S106 and step S108. Specifically, the server determines a pool of orders to be assigned based on the unassigned orders received within a specified period and the determined reassignment orders. It should be noted that when it is determined that the order to be pressed by the target rider is a reassignment order, the reassignment order no longer has an assignment relationship with the target rider, but is an order that does not have an assignment relationship. Therefore, it needs to be placed in the pool of orders to be assigned to facilitate the server to determine how to reassign.

[0083] Afterwards, the server can use a method that predetermines the assignment relationship between orders and riders, and determine the assignment relationship between riders and orders based on a preset assignment algorithm and the orders in the pool of orders to be assigned. Among them, since the reassigned order is also included in the pool of orders to be assigned, the assignment relationship between the reassigned order and the rider is also determined.

[0084] Finally, for the reassignment order, the server can assign the reassignment order according to the determined assignment relationship.

[0085] Furthermore, in the present specification, when the server assigns the reassigned order according to the re-determined assignment relationship, the server may continue to process the reassigned order if the assignment relationship between the reassigned order and the rider is still not ideal and meets the order pressing processing conditions. This is to avoid the situation where the order being pressed is delivered by a rider whose assignment relationship is not ideal after being treated as a reassigned order. In other words, no matter what kind of order it is, as long as it meets the order pressing processing conditions, it can be processed. Even if the order had an assignment relationship with other riders before, such as the target rider in the present specification, and it has also been processed, as long as it still meets the order pressing processing conditions in the future, it can continue to be processed.

[0086] Specifically, the server can determine the rider who has an assignment relationship with the reassigned order as the assigned rider based on the re-determined assignment relationship. Afterwards, based on the orders that have an assignment relationship with the direct-shot starter, determine whether the reassigned order meets the order suppression processing conditions. If so, continue to suppress the order for the reassigned order, and assign the reassigned order to the assigned rider. For example, the assigned rider still "takes a detour" when delivering the reassigned order, and the promised delivery time of the reassignment is still a long time away from the current moment, that is, the probability of the reassigned order being overdue for delivery after the order suppression processing is small, then the reassigned order can continue to be suppressed, so as to find a better delivery method for the reassigned order later.

[0087] Furthermore, in step S202 of this specification, when the server determines the target rider, if the target rider is offline, it means that the actual status of the target rider may be different from the status recorded by the server. For example, if the rider enters the square below to deliver goods, the delivery status of the rider's order cannot be updated in time due to signal interference, and it is impossible to accurately determine whether the rider is performing the business according to his own delivery path. Then, the order of such a rider is reassigned, which may lead to a decrease in the rider's delivery efficiency.

[0088] Therefore, in this specification, the server may first determine the riders who have an assignment relationship with the orders that have been pressed as candidate riders, and then determine the riders whose status is not in the specified state from among the candidate riders as target riders. The specified status includes at least: busy and offline. As mentioned above, the target riders are all riders who have orders to be pressed, and when the rider status cannot be determined, then whether these riders are executing the business according to their own route planning is also uncertain for the platform, so the server may not reassign orders for riders who are busy and offline.

[0089] Among them, since the server needs to monitor the status of the rider, in addition to the rider operating the terminal to perform business, the terminal usually regularly uploads information such as the rider's location to the server. Therefore, the server can judge the rider's status based on the frequency of the rider's terminal uploading information. For example, assuming that the rider's terminal should upload information at intervals of 10 seconds, but a rider's terminal has not uploaded information for 2 consecutive minutes, the server can determine that the rider is offline.

[0090] Since the server will also send notifications, orders and other information to the rider, if the rider responds to these messages, it means that the rider is not busy. However, due to the particularity of the delivery business, sometimes the rider is unable to respond to the messages sent by the server when he is busy. When the server determines that the rider has not responded to the messages sent or the rider has not operated the terminal, it can be determined that the rider is busy.

[0091] Of course, it should be noted that whether the rider is offline or busy can also be determined by other means, which can be set according to needs and this manual does not limit this.

[0092] based on Figure 2 The order reassignment method shown in the embodiment of the present specification also corresponds to a structural schematic diagram of an order reassignment device, such as Figure 4 shown.

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

[0094] A rider determination module 300 is configured to determine a rider who has an assignment relationship with the order that has been subjected to order suppression processing as a target rider;

[0095] The re-dispatch module 302 is configured to determine whether the target rider performs business according to his own route planning. If so, the orders that meet the specified conditions are determined from the orders that the target rider has pressed orders for, as re-dispatch orders, and the re-dispatch orders are re-dispatched. If not, it is determined that all the orders that the target rider has pressed orders for are re-dispatch orders, and the re-dispatch orders are re-dispatched.

[0096] Optionally, the reassignment module 302 is configured to determine that the target rider performs the business according to its own path planning if the target rider does not accept the assigned orders of other riders within a specified time period, and the target rider performs the business in the delivery order of the assigned orders in the path planning, and the distance between the target rider and the earliest task point that needs to be reached in the path planning is less than the distance between the target rider and any other task point. If the target rider accepts the assigned orders of other riders within a specified time period, or the target rider does not perform the business in the delivery order of the assigned orders in the path planning, or the distance between the target rider and the earliest task point that needs to be reached in the path planning is not less than the distance between the target rider and any other task point, then it is determined that the target rider does not perform the business according to its own path planning.

[0097] Optionally, the reassignment module 302 is configured to determine that after the orders to be processed by the target rider are assigned to the target rider, the target rider's updated route planning, based on the updated route planning, orders that meet specified conditions from the orders to be processed by the target rider are determined as reassigned orders, wherein the specified conditions include at least one of the following: delivery timeout, reverse delivery, and other orders with undetermined assignment relationships satisfying the order consolidation conditions.

[0098] Optionally, the reassignment module 302 is configured to assign orders that do not meet the specified conditions to the target rider.

[0099] Optionally, the reassignment module 302 is configured to determine a pool of orders to be assigned based on the unassigned orders received within a specified time period and the reassigned orders, redetermine the assignment relationship between the reassigned orders and the riders based on a preset assignment algorithm and the orders in the pool of orders to be assigned, and assign the reassigned orders based on the re-determined assignment relationship.

[0100] Optionally, the reassignment module 302 is configured to determine a rider who has an assignment relationship with the reassigned order based on the re-determined assignment relationship, and as the assigned rider, determine whether the reassignment meets the order suppression processing conditions based on each order having an assignment relationship with the assigned rider. If so, suppress the order, if not, assign the reassigned order to the assigned rider.

[0101] Optionally, the rider determination module 300 is configured to determine a rider who has an assignment relationship with the order that has been subjected to order suppression processing as a candidate rider, and from among the candidate riders, determine a rider whose rider status is not in a specified status as a target rider, wherein the specified status includes at least: busy and offline.

[0102] based on Figure 4 The order reassignment device shown avoids various problems caused by the need to reassign already assigned orders by advancing the process of reassigning orders to before assigning them to riders. In addition, by judging whether the rider is performing his duties according to his own delivery route, it is possible to determine whether the rider is affected by uncertain factors that interfere with delivery, thereby using different methods to determine the reassignment of orders. If the rider performs his duties according to his own route planning, the possibility of a change in the matching degree between the rider and the order is still low, and the order can be reassigned according to specified conditions. If the rider does not perform his duties according to his own route planning, it means that the matching degree between the rider and the order has begun to change. In order to reduce the risk of delivery timeouts and the like, all orders that the rider has suppressed can be reassigned. The uncertainty of order reassignment is reduced and the effect of order reassignment is improved.

[0103] The embodiments of the present specification also provide a computer-readable storage medium, which stores a computer program. The computer program can be used to execute any one of the order reassignment methods provided above.

[0104] based on Figure 2 The method for reassigning an order shown in the specification also proposes Figure 5 The schematic structure diagram of the electronic device shown in FIG. Figure 5 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.

[0105] 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.

[0106] In the 1990s, improvements to a technology could be clearly distinguished as hardware improvements (for example, improvements to the circuit structure of diodes, transistors, switches, etc.) or software improvements (improvements to the method flow). However, with the development of technology, many improvements to the method flow today can be regarded as direct improvements to the hardware circuit structure. Designers almost always obtain the corresponding hardware circuit structure by programming the improved method flow into the hardware circuit. Therefore, it cannot be said that an improvement in a method flow cannot be implemented using a hardware entity module. For example, a programmable logic device (PLD) (such as a field programmable gate array (FPGA)) is such an integrated circuit whose logical function is determined by the user's programming of the device. Designers can "integrate" a digital system on a PLD by programming it themselves, without having to ask a chip manufacturer to design and produce a dedicated integrated circuit chip. Moreover, nowadays, instead of manually making integrated circuit chips, this kind of programming is mostly implemented by "logic compiler" software, which is similar to the software compiler used when developing and writing programs, and the original code before compilation must also be written in a specific programming language, which is called hardware description language (HDL). There is not only one HDL, but many kinds, such as ABEL (Advanced Boolean Expression Language), AHDL (Altera Hardware Description Language), Confluence, CUPL (Cornell University Programming Language), HDCal, JHDL (Java Hardware Description Language), Lava, Lola, MyHDL, PALASM, RHDL (Ruby Hardware Description Language), etc. The most commonly used ones are VHDL (Very-High-Speed ​​Integrated Circuit Hardware Description Language) and Verilog. Those skilled in the art should also know that it is only necessary to program the method flow slightly in the above-mentioned hardware description languages ​​and program it into the integrated circuit, and then it is easy to obtain the hardware circuit that implements the logic method flow.

[0107] The controller can be implemented in any appropriate manner, for example, the controller can take the form of a microprocessor or processor and a computer-readable medium storing a computer-readable program code (such as software or firmware) that can be executed by the (micro)processor, a logic gate, a switch, an application-specific integrated circuit (ASIC), a programmable logic controller, and an embedded microcontroller. Examples of controllers include, but are not limited to, the following microcontrollers: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20, and Silicone Labs C8051F320. The memory controller can also be implemented as part of the control logic of the memory. Those skilled in the art also know that in addition to implementing the controller in a purely computer-readable program code manner, the controller can be implemented in the form of a logic gate, a switch, an application-specific integrated circuit, a programmable logic controller, and an embedded microcontroller by logically programming the method steps. Therefore, this controller can be considered as a hardware component, and the devices included therein for implementing various functions can also be regarded as structures within the hardware component. Or even, the devices for implementing various functions can be regarded as both software modules for implementing the method and structures within the hardware component.

[0108] The systems, devices, modules or units described in the above embodiments may be implemented by computer chips or entities, or by products with certain functions. A typical implementation device is a computer. Specifically, the computer may be, for example, a personal computer, a laptop computer, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.

[0109] For the convenience of description, the above device is described in various units according to their functions. Of course, when implementing this specification, the functions of each unit can be implemented in the same or multiple software and / or hardware.

[0110] Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0111] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0112] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0113] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0114] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.

[0115] The memory may include non-permanent storage in a computer-readable medium, random access memory (RAM) and / or non-volatile memory in the form of read-only memory (ROM) or flash RAM. The memory is an example of a computer-readable medium.

[0116] Computer readable media include permanent and non-permanent, removable and non-removable media that can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include temporary computer readable media (transitory media), such as modulated data signals and carrier waves.

[0117] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.

[0118] Those skilled in the art will appreciate that the embodiments of this specification may be provided as methods, systems or computer program products. Therefore, this specification may take the form of a complete hardware embodiment, a complete software embodiment or an embodiment combining software and hardware. Moreover, this specification may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0119] This specification may be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. This specification may also be practiced in distributed computing environments where tasks are performed by remote processing devices connected through a communication network. In a distributed computing environment, program modules may be located in local and remote computer storage media, including storage devices.

[0120] Each embodiment in this specification is described in a progressive manner, and the same or similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

[0121] 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: Determine the rider who has an assignment relationship with the order that has been suppressed as the target rider; Determine whether the target rider performs the service according to its own route planning; If so, an order meeting the specified conditions is determined from the orders that the target rider has placed on hold as a reassignment order, and the reassignment order is reassigned; If not, it is determined that all the orders that the target rider has placed on hold are reassignment orders, and the reassignment orders are reassigned; The step of judging whether the target rider performs the service according to its own route planning includes: If the target rider does not accept the assigned orders of other riders within the specified time period, and the target rider performs the service in the delivery order of the assigned orders in the route planning, and the distance between the target rider and the earliest task point that needs to be reached in the route planning is less than the distance between the target rider and any other task point, then it is determined that the target rider performs the service according to his own route planning; If the target rider accepts the assigned orders of other riders within the specified time period, or the target rider does not perform the business according to the delivery order of the assigned orders in the route planning, or the distance between the target rider and the earliest task point that needs to be reached in the route planning is not less than the distance between the target rider and any other task point, it is determined that the target rider does not perform the business according to his own route planning; The step of determining an order that meets a specified condition from the orders that the target rider has placed on hold as a reassignment order includes: After determining to assign the order to be processed by the target rider to the target rider, the target rider's updated route planning; According to the updated route planning, from the orders that the target rider has placed on hold, orders that meet specified conditions are determined as reassignment orders; The specified conditions include at least one of the following: delivery timeout, reverse delivery, and other orders with undetermined assignment relationships meeting order consolidation conditions.

2. The method according to claim 1, characterized in that The method further comprises: Orders that do not meet the specified conditions will be assigned to the target rider.

3. The method according to claim 1, characterized in that The reassigning of the reassignment order comprises: Determine a pool of orders to be assigned based on the unassigned orders and the reassigned orders received within a specified time period; Re-determine the assignment relationship between the reassigned order and the rider according to a preset assignment algorithm and the orders in the to-be-assigned order pool; Assigning the reassignment order according to the re-determined assignment relationship; Wherein, assigning the reassignment order according to the re-determined assignment relationship includes: According to the re-determined assignment relationship, a rider having an assignment relationship with the reassigned order is determined as the assigned rider; According to each order having an assignment relationship with the assigned rider, judging whether the reassignment meets the order suppression processing conditions; If so, the reassignment order is suppressed; If not, the reassigned order is assigned to the assigned rider.

4. The method according to claim 1, characterized in that The step of determining a rider who has an assignment relationship with the order that has been suppressed as a target rider includes: Determine the riders who have an assignment relationship with the orders that have been suppressed as candidate riders; From among the candidate riders, a rider whose rider status is not in the specified status is determined as a target rider; The specified status includes at least: busy and offline.

5. A device for reassigning an order, characterized in that: The device comprises: A rider determination module, configured to determine a rider who has an assignment relationship with the order that has been subjected to order suppression processing as a target rider; A re-dispatch module is configured to determine whether the target rider executes the business according to its own route planning. If so, the orders that meet the specified conditions are determined from the orders that the target rider has pressed as re-dispatch orders, and the re-dispatch orders are re-dispatched. If not, it is determined that all the orders that the target rider has pressed are re-dispatch orders, and the re-dispatch orders are re-dispatched. The step of judging whether the target rider performs the service according to its own route planning includes: If the target rider does not accept the assigned orders of other riders within the specified time period, and the target rider performs the service in the delivery order of the assigned orders in the route planning, and the distance between the target rider and the earliest task point that needs to be reached in the route planning is less than the distance between the target rider and any other task point, then it is determined that the target rider performs the service according to his own route planning; If the target rider accepts the assigned orders of other riders within the specified time period, or the target rider does not perform the business according to the delivery order of the assigned orders in the route planning, or the distance between the target rider and the earliest task point that needs to be reached in the route planning is not less than the distance between the target rider and any other task point, it is determined that the target rider does not perform the business according to his own route planning; The step of determining an order that meets a specified condition from the orders that the target rider has placed on hold as a reassignment order includes: After determining to assign the order to be processed by the target rider to the target rider, the target rider's updated route planning; According to the updated route planning, from the orders that the target rider has placed on hold, orders that meet specified conditions are determined as reassignment orders; The specified conditions include at least one of the following: delivery timeout, reverse delivery, and other orders with undetermined assignment relationships meeting order consolidation conditions.

6. 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 4 is implemented.

7. 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 4 is implemented.