CN112288346A

CN112288346A - Order form repacking method and device

Info

Publication number: CN112288346A
Application number: CN201910678055.0A
Authority: CN
Inventors: 查莹; 王圣尧; 包建东
Original assignee: Beijing Sankuai Online Technology Co Ltd
Current assignee: Beijing Sankuai Online Technology Co Ltd
Priority date: 2019-07-25
Filing date: 2019-07-25
Publication date: 2021-01-29

Abstract

The specification discloses an order repayment method and device, and the order to be repayment of each rider is determined from undisplayed orders subjected to order pressing by the rider for each rider. Secondly, according to the assigned orders of the rider, each alternative rider and non-to-be-relocated orders of the alternative riders (namely, other non-displayed orders which are not used as to-be-relocated orders in the non-displayed orders), determining various optional distribution paths corresponding to the alternative riders after the to-be-relocated orders of other riders are assigned to the alternative riders. And then determining the distribution efficiency of each optional distribution path corresponding to the alternative rider. And finally, determining the comprehensive delivery efficiency according to the delivery efficiency of each candidate rider relative to each newly added order, selecting an order from the orders to be reassigned for each candidate rider by taking the maximized comprehensive delivery efficiency as an optimization target through a specified optimization algorithm, and assigning the selected order as a new newly added order to the candidate rider.

Description

Order form repacking method and device

Technical Field

The present application relates to the field of computer technologies, and in particular, to a method and an apparatus for order reassignment.

Background

With the development of technology, the business model of Online To Offline (O2O) is becoming more mature and applied in more and more industries. Among these, a typical example is the rapidly growing takeaway distribution industry affected by O2O.

Generally, for the purpose of improving the delivery efficiency of a rider and improving the user experience of a user, a takeout delivery platform determines the matching degree between the rider and an order according to a received order of the user and a path optimization algorithm, determines a dispatching scheme including the assignment relationship between the order and the rider, and assigns the order to the rider according to a dispatching cycle and the dispatching scheme. Such an order that has been determined to be in an assigned relationship with the rider but has not yet been assigned to the rider is also referred to as an undisplayed order because it is saved in the background where it is not viewable or perceptible to the rider.

Meanwhile, in the actual delivery process, the rider may encounter uncertain factors, which causes the change of the matching degree between the orders and the rider in the order dispatching scheme, and the delivery efficiency of the rider is reduced, so in the prior art, the order pressing process can be executed for undisplayed orders which are easy to have uncertain factors, undisplayed orders with unsatisfactory matching degree, and undisplayed orders with small order pressing influence. That is, the orders to be pressed are all not displayed.

However, the prior art pressing method, which usually only temporarily assigns the undisplayed order to the rider, still appears to be inflexible.

Disclosure of Invention

The embodiments of the present specification provide a method and an apparatus for order reassignment, so as to partially solve the above problems in the prior art.

The embodiment of the specification adopts the following technical scheme:

the order reassignment method provided by the specification comprises the following steps:

determining undisplayed orders subjected to order pressing processing from undisplayed orders of each rider, and determining to-be-refitted orders of the rider according to the undisplayed orders subjected to order pressing processing;

for each order to be dispatched and each alternative rider, determining the distribution efficiency of the alternative rider relative to the order to be dispatched after the order to be dispatched is dispatched to the alternative rider according to the dispatched order of the alternative rider and the order not to be dispatched in the undisplayed orders of the alternative rider;

aiming at each alternative rider, adopting a specified optimization algorithm, taking the maximum comprehensive distribution efficiency as an optimization target, selecting an order for the alternative rider from the orders to be relocated, and assigning the selected order to the alternative rider as a new order; and determining the comprehensive distribution efficiency according to the distribution efficiency of each alternative rider relative to each newly added order.

Optionally, determining an undisplayed order for performing the order pressing process from the undisplayed orders of the rider specifically includes:

dividing each undisplayed order of the rider into a plurality of order packages according to the original distribution path of the rider;

order packages meeting order pressing conditions in all order packages are subjected to order pressing;

according to the undisplayed order subjected to the order pressing processing, determining the order to be changed of the rider, specifically comprising the following steps:

and taking the order packet with the latest distribution time in each order packet subjected to order pressing as an order packet to be relocated, and determining the order in the order packet to be relocated as the order to be relocated.

Optionally, after determining that the order to be reassigned is assigned to the alternative rider, the efficiency of delivery of the alternative rider with respect to the order to be reassigned specifically includes:

for each alternative rider, obtaining an assigned order of the alternative rider and an original distribution path of the alternative rider determined based on the undisplayed orders of the alternative rider;

after the order to be reassigned is assigned to the alternative rider, the alternative rider is determined to correspond to an updated delivery path;

and determining the efficiency change of the updated delivery path according to the delivery efficiency of the original delivery path and the delivery efficiency of the updated delivery path, and taking the efficiency change as the delivery efficiency of the alternative rider relative to the order to be relocated.

Optionally, determining, according to the delivery efficiency of the selectable delivery path and the delivery efficiency of the original delivery path of the rider, an efficiency change of the rider corresponding to the selectable delivery path specifically includes:

determining an efficiency change of the updated delivery path according to at least one of a distance-based efficiency change, a waiting-time-based efficiency change, and an on-time delivery-based efficiency change;

wherein the distance-based efficiency change is determined according to a distribution distance difference between the original distribution path and the updated distribution path; the efficiency change based on the waiting time is determined according to the difference value between the sum of the waiting time of each order in the original distribution path and the sum of the waiting time of each order in the updated distribution path; and determining the efficiency change based on-time distribution according to the difference between the sum of the early delivery time of each order in the original distribution path and the sum of the early delivery time of each order in the updated distribution path.

Optionally, a specified optimization algorithm is adopted, the optimization goal is to maximize the comprehensive delivery efficiency, and the order is selected for the alternative rider from the orders to be reassigned, specifically including:

assigning values to each alternative rider and each order to be reassigned according to the distribution efficiency of each alternative rider relative to each order to be reassigned, wherein for each alternative rider, the sum of the assignment of the alternative rider and the assignment of any order to be reassigned is equal to the maximum distribution efficiency of the alternative rider relative to each order to be reassigned;

according to a preset sequence, sequentially aiming at each alternative rider, selecting any order to be relocated meeting specified conditions as a new order corresponding to the alternative rider according to the assignment of each order to be relocated and the assignment of the alternative rider; the specified conditions include: the sum of the value of the order to be relocated and the value of the alternative rider is equal to the distribution efficiency of the alternative rider relative to the order to be relocated;

judging whether conflicts exist among all the alternative riders of the newly-added orders or not, wherein if the newly-added orders corresponding to at least two alternative riders are the same, the at least two alternative riders conflict;

if yes, adjusting the newly added orders corresponding to the alternative riders with the determined newly added orders until no conflict exists;

otherwise, determining a new order corresponding to the next candidate rider according to the preset sequence until all the orders to be changed are selected as the new order.

Optionally, adjusting the new order corresponding to each rider whose new order has been determined specifically includes:

determining at least two alternative riders of which the newly added orders are the orders to be relocated as conflict riders aiming at each order to be relocated;

and according to the determined at least one conflict rider, reselecting a newly-added order corresponding to the conflict rider according to the specified conditions until no conflict exists.

Optionally, the method further comprises:

if the newly added orders cannot be selected for any conflicting riders according to the specified conditions, or conflicts still exist after all methods for selecting the newly added orders for the conflicting riders are traversed, the assignment of each conflicting rider and the assignment of the order to be reassigned are adjusted;

and reselecting a newly added order for at least one conflict rider according to the adjusted assignment of each conflict rider and the adjusted assignment of the order to be reassigned until no conflict exists.

Optionally, adjusting the assignment of each conflicting rider and the assignment of the to-be-reassigned order specifically includes:

and according to the preset step length, reducing the assignment of each conflict rider and improving the assignment of the order to be reassigned.

Optionally, if the alternative rider initiates the order-turning behavior within a preset time period, no new order is selected for the alternative rider.

This specification provides an order repayment device, including:

the selection module is used for determining undisplayed orders subjected to order pressing processing from undisplayed orders of each rider and determining to-be-changed orders of the rider according to the undisplayed orders subjected to order pressing processing;

the distribution efficiency determining module is used for determining the distribution efficiency of each candidate rider relative to each order to be relocated after the order to be relocated is assigned to the candidate rider according to each order to be relocated and each candidate rider in the assigned orders of the candidate rider and the non-order to be relocated in the undisplayed orders of the candidate rider;

the order changing module adopts a specified optimization algorithm aiming at each alternative rider, takes the maximized comprehensive distribution efficiency as an optimization target, selects an order for the alternative rider from various orders to be changed, and takes the selected order as a new order to be assigned to the rider; and determining the comprehensive distribution efficiency according to the distribution efficiency of each alternative rider relative to each newly added order.

The present specification provides a computer-readable storage medium, wherein the storage medium stores a computer program, and the computer program, when executed by a processor, implements the above order reassignment method.

The electronic device provided by the present specification includes a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the order reassignment method when executing the program.

The embodiment of the specification adopts at least one technical scheme which can achieve the following beneficial effects:

first, for each rider, the order to be reassigned for that rider is determined from the undisplayed orders that the rider performs the saddle stitching process. Secondly, for each order to be served and each alternative rider, according to the assigned order of the alternative rider and the non-order to be served of the alternative rider (namely, other orders which are not shown and are not used as the order to be served in the orders which are not shown), the distribution efficiency of the alternative rider relative to the order to be served is determined after the order to be served is assigned to the alternative rider. And finally, according to the comprehensive distribution efficiency determined by the alternative riders relative to the distribution efficiency of the respective newly added orders, selecting the orders for the alternative riders from the orders to be relocated as new orders to be assigned to the alternative riders by taking the maximized comprehensive distribution efficiency as an optimization target for each alternative rider. Determining the dispatching object of the order to be dispatched by determining the dispatching efficiency of the alternative rider relative to each order to be dispatched after assigning different orders to be dispatched to the alternative rider, and taking the maximized comprehensive dispatching efficiency as an optimization target. Since the principle behind the order-pressing process is that the assignment relationship between the order and the rider is not ideal (i.e., the distribution efficiency is low), the distribution efficiency of the order can be improved by re-distributing the order subjected to the order-pressing process. Compared with the mode that the order processed by pressing is only temporarily assigned to the rider in the prior art, the method provided by the specification can improve the distribution efficiency of the order processed by pressing.

Drawings

The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:

FIG. 1 is a process for order reassignment provided herein;

FIG. 2 is a schematic illustration of a process provided herein for determining a pending reassignment order and an alternative rider assignment relationship;

fig. 3 is a schematic structural diagram of an order reassigning apparatus according to an embodiment of the present disclosure;

fig. 4 is a schematic diagram of an electronic device corresponding to fig. 1 provided in an embodiment of the present disclosure.

Detailed Description

In order to make the objects, technical solutions and advantages of the present disclosure more apparent, the technical solutions of the present disclosure will be clearly and completely described below with reference to the specific embodiments of the present disclosure and the accompanying drawings. It should be apparent that the described embodiments are only some of the embodiments of the present application, and not all of the embodiments. All other embodiments obtained by a person skilled in the art based on the embodiments in the present specification without any inventive step are within the scope of the present application.

The technical solutions provided by the embodiments of the present application are described in detail below with reference to the accompanying drawings.

Fig. 1 is a process of order reassignment provided by an embodiment of the present disclosure, which specifically includes the following steps:

s102: and determining the undisplayed orders subjected to the order pressing processing from the undisplayed orders of each rider, and determining the orders to be relocated of the rider according to the undisplayed orders subjected to the order pressing processing.

In this specification, the order reassignment process is: and after the platform carries out order pressing processing on the orders not displayed by the rider, the order subjected to the order pressing processing is relocated. The order reassignment process may be specifically performed by a server of the distribution platform.

Specifically, the server may first determine, for each rider, an undisplayed order for performing the saddle stitching process from among undisplayed orders for the rider. And then determining the order to be changed of the rider according to the undisplayed order subjected to the order pressing processing. That is, the server may determine to suspend an order assigned to the rider, and then determine from that an order to be relocated, which is an order not yet assigned to the rider, can be relocated.

In addition, in the present specification, when the server performs the order placing process on the undisplayed order, the server may first divide each undisplayed order of the rider into a plurality of order packages according to the original delivery route of the rider, and determine an order package conforming to the order placing process with the order package as a target of the order placing process, and perform the order placing process. The original delivery path of the rider is determined after path planning is carried out according to the assigned orders and the undisplayed orders of the rider. That is, before order reassignment, the distribution route of the rider is determined according to the assigned orders having an assignment relationship with the rider and the undisplayed orders, and if order reassignment is not performed, the original distribution route is the route of the subsequent rider when the distribution business is executed. Of course, if the undisplayed order of the rider is reassigned through the subsequent steps, the path of the rider when performing the delivery service may no longer be the original delivery path.

Specifically, when each undisplayed order of the rider is divided into a plurality of order packages as an object of the order pressing process, the server may divide each undisplayed order of the rider into a plurality of order packages in a manner of dividing a delivery position and a pickup position corresponding to the same undisplayed order into the same task package based on a delivery position and a pickup position corresponding to each undisplayed order on an original delivery route of the rider. For example, according to the delivery positions on the original delivery path of the rider and the delivery sequence of the pickup positions from morning to evening, the delivery position corresponding to the last undisplayed order not divided into order packages is determined as the starting position, then according to the delivery positions on the original delivery path of the rider and the delivery sequence of the pickup positions from evening to morning, the ending position is searched from the starting position, wherein the number of the pickup positions and the pickup positions from the starting position to the ending position is the same, finally the undisplayed orders respectively corresponding to the pickup positions and the pickup positions from the starting position to the ending position are divided into one order package, and the order package is determined repeatedly until all undisplayed orders are divided into the order packages.

And then, the server can perform order pressing treatment on the order packages meeting the order pressing condition in each order package, and determines the order package with the latest delivery time from the order packages subjected to the order pressing treatment as the order package to be relocated, so that the order in the order package to be relocated is the order to be relocated.

S104: and determining the distribution efficiency of the alternative rider relative to the order to be relocated after the order to be relocated is assigned to the alternative rider according to the assigned order of the alternative rider and the order not to be relocated in the undisplayed orders of the alternative rider.

In this specification, after determining the orders to be reassigned of the riders, the server may further determine which alternative riders the orders to be reassigned may be reassigned to, wherein the alternative riders are riders that can accept the orders to be reassigned and execute the delivery tasks corresponding to the orders to be reassigned. In addition, in order to improve the distribution efficiency of the to-be-relocated orders after relocation, the server can determine the assignment relationship between each to-be-relocated order and each candidate rider according to the matching degree of the to-be-relocated order and the candidate riders. The delivery efficiency of each alternative rider relative to each order to be served may thus be determined for that alternative rider and for each order to be served.

Specifically, since the server may determine a plurality of orders to be reassigned through step S102, and there are a plurality of candidate riders capable of receiving the orders to be reassigned, the server may first determine, for at least one candidate rider and at least one order to be reassigned, an updated delivery path corresponding to the candidate rider after assigning the order to be reassigned to the candidate rider, and then determine an efficiency change of the updated delivery path according to a delivery efficiency of an original delivery path of the candidate rider and a delivery efficiency of the updated delivery path, as a delivery efficiency of the candidate rider with respect to the order to be reassigned. The server can therefore determine the delivery efficiency of the alternative rider with respect to each to-be-dispatched order after accepting different to-be-dispatched orders through step S104.

Wherein, for each rider in step S102, since the server can use part of the undisplayed orders that the rider performs the order-pressing process as the orders to be served, the orders having an assignment relationship with the rider include two orders: one is an assigned order, i.e., the order assigned to it is visible to the rider, and the other is a non-to-be-reassigned order among the orders that are not displayed. Then, for the rider who determines the order to be reassigned, when the rider determines the delivery efficiency as the alternative rider, the server may determine the updated delivery path corresponding to the alternative rider after assigning the orders to be reassigned of other riders to the alternative rider respectively according to the assigned order of the alternative rider and the non-orders to be reassigned in the undisplayed orders of the alternative rider.

That is, when determining each updated delivery path corresponding to the candidate rider, the server needs to perform path planning according to the assigned order of the rider, the order not to be reassigned, and the order to be reassigned of any one of the other riders, and determine the delivery path of the rider after assigning the order to be reassigned of the other riders to the candidate rider, that is, update the delivery path. Of course, if the alternative rider is not the rider determined to be the order to be relocated in step S102, the non-order to be relocated by the alternative rider is consistent with the undisplayed order of the alternative rider.

For example, table 1 is a schematic table of the order correspondence relationship of the candidate riders provided in the present specification.

Alternative rider	Assigned orders	Non-repurposed orders	Order to be changed
				Alternative rider A	Order d	Order e	Order f
Alternative rider B	Order h	Order i	Order g
				Alternative rider C	Order k	Order l	Order m

TABLE 1

Assuming that the server determines the orders to be reassigned for the riders A-C in step S102, the updated delivery path corresponding to each rider as the candidate rider can be determined in step S104. Taking the alternative rider a as an example for explanation, when the updated distribution path of the alternative rider a is determined, the server may determine, according to the order d, the order e and the order g, the updated distribution path corresponding to the alternative rider a after the order to be relocated of the rider B is relocated to the alternative rider a. Similarly, according to the order d, the order e and the order m, the updated distribution path of the alternative rider a after the order to be relocated of the rider C is relocated to the alternative rider a can be determined. Similarly, the alternative rider B and the alternative rider C may determine each updated distribution path corresponding to the alternative rider B and the alternative rider C respectively after assigning the to-be-reassigned orders of the other riders.

In addition, for each order to be reassigned, after the order to be reassigned is reassigned, the desired result is an increase in the delivery efficiency of the order to be reassigned. However, it is also desirable for each alternative rider that the average delivery efficiency of the alternative rider to deliver the assigned order may be improved after assigning the alternative rider a certain order to be changed. Thus, to determine whether the delivery efficiency of the alternative rider relative to the order to be reassigned is improved, the server may first determine the delivery efficiency of the original delivery path of the alternative rider and the delivery efficiency of the alternative rider corresponding to the updated delivery path after assigning the order to be reassigned to the alternative rider.

And then, determining the efficiency change of the rider corresponding to the updated delivery path according to the delivery efficiency of the updated delivery path and the delivery efficiency of the original delivery path of the alternative rider, and taking the efficiency change as the delivery efficiency of the alternative rider relative to the order to be relocated.

That is, for each updated distribution path, determining the change of the distribution efficiency of the alternative rider for executing the distribution service on the updated distribution path relative to the distribution efficiency of the alternative rider for executing the distribution service on the original distribution path, and if the distribution efficiency is improved, it indicates that the effect of the alternative rider for executing the distribution service on the modified updated distribution path is improved.

In this specification, after determining each updated delivery path corresponding to the candidate rider, in order to determine which delivery path is most suitable from among the original delivery path of the candidate rider and each updated delivery path corresponding to the candidate rider, the server may determine the delivery efficiency of each updated delivery path corresponding to the candidate rider, and determine the delivery efficiency of the candidate rider with respect to each order to be reassigned.

Specifically, the server may determine the change in efficiency of the updated delivery path for the candidate rider based on at least one of a change in efficiency based on distance, a change in efficiency based on waiting time, and a change in efficiency based on-time delivery. Since the same number of orders are delivered, the greater the delivery distance, the lower the delivery efficiency, the greater the time cost required for the alternative rider and the capacity cost required for the platform, and therefore the delivery distance can be used as the delivery efficiency based on the delivery distance. Similarly, the waiting time is the time for waiting for obtaining the delivered objects after the alternative rider arrives at the position of the delivered object provider in the delivery process, the longer the waiting time is, the lower the delivery efficiency is, and the longer the delivery punctuality data is, the longer the alternative rider arrives at the receiving position in advance, the lower the delivery efficiency is.

The efficiency change based on the distance can be determined according to the difference value of the distribution distance between the original distribution path and the updated distribution path. Based on the efficiency change of the waiting time, the difference value between the sum of the waiting time of each order in the original distribution path and the sum of the waiting time of each order in the updated distribution path can be determined. Based on the efficiency change of on-time distribution, the difference value between the sum of the early delivery time of each order in the original distribution path and the sum of the early delivery time of each order in the updated distribution path can be determined.

S106: aiming at each alternative rider, adopting a specified optimization algorithm, taking the maximum comprehensive distribution efficiency as an optimization target, selecting an order for the alternative rider from the orders to be relocated, and assigning the selected order to the alternative rider as a new order; and determining the comprehensive distribution efficiency according to the distribution efficiency of each alternative rider relative to each newly added order.

In this specification, since the server has already determined the delivery efficiency of each alternative rider with respect to each order to be relocated, the assignment relationship between the order to be relocated and the alternative rider can be determined according to the delivery efficiency, and a specified optimization algorithm is adopted, with the maximized comprehensive delivery efficiency as an optimization target, the alternative rider of the order to be relocated is determined and assigned.

Specifically, the process of selecting a new order for the candidate rider from the orders to be reassigned according to a specified optimization algorithm may be as shown in FIG. 2.

Fig. 2 is a schematic process diagram for determining the relationship between the to-be-reassigned order and the alternative rider assignment provided in the present specification, which may specifically include the following steps:

s1060: and assigning values to each alternative rider and each order to be relocated according to the distribution efficiency of each alternative rider relative to each order to be relocated.

In step 1060, the server may first initialize the assignments of the candidate riders and the orders to be reassigned. So that the subsequent step determines the assignment relationship of the order to be reassigned to the alternative rider according to the assignment.

The specific assignment rule may be: the initial value of each order to be changed is a preset fixed value; for each alternative rider, the initial assignment of the alternative rider is the sum of the assignment of any order to be reassigned and the maximum delivery efficiency of the alternative rider relative to each order to be reassigned. For example, if the preset fixed value is 0, the initial assignment of the alternative rider is equal to the maximum delivery efficiency of the alternative rider with respect to each order to be dispatched.

S1062: and according to a preset sequence, sequentially aiming at each alternative rider, selecting any order to be relocated meeting specified conditions as a new order corresponding to the alternative rider according to the assignment of each order to be relocated and the assignment of the alternative rider. The specified conditions include: the sum of the value of the order to be relocated and the value of the alternative rider is equal to the distribution efficiency of the alternative rider relative to the order to be relocated.

The server can sequentially aim at each alternative rider according to a preset sequence, and any one to-be-refitted order is selected from the to-be-refitted orders meeting the specified conditions to serve as a new order corresponding to the alternative rider. At this time, since the specified conditions may include: the sum of the value of the order to be relocated and the value of the alternative rider is equal to the distribution efficiency of the alternative rider relative to the order to be relocated, and the distribution efficiency of the alternative rider relative to the order to be relocated is determined according to the distribution efficiency of the updated distribution path and the change value of the distribution efficiency of the original distribution path in step S104, so that the new order of the alternative rider is selected according to the specified conditions, and the distribution efficiency of the alternative rider for distribution can be maximized.

S1064: and judging whether conflicts exist among the alternative riders of the newly added orders or not, if yes, executing the step S1066, and otherwise, executing the step S1068. And if the newly added orders corresponding to the at least two alternative riders are the same, the at least two alternative riders conflict.

In this specification, in step S1062, a new order corresponding to a candidate rider is determined only for the candidate rider, and although the delivery efficiency for performing the task corresponding to the new order is maximized for the candidate rider, the delivery efficiency of the single candidate rider is maximized, and the overall delivery efficiency is not necessarily maximized. Since there may be a case where, for each order to be served, the delivery efficiency of a plurality of candidate riders for performing the task corresponding to the order to be served is maximized, that is, there may be a case where the newly added orders corresponding to at least two candidate riders are the same, that is, there may be a case where the order to be served has already been determined to be the newly added orders of the other candidate riders, it is apparent that one order to be served cannot be assigned to two candidate riders. In the present description, therefore, it is also necessary to determine whether there is a conflict between the candidate riders of the newly added order that have been determined, and to resolve the conflict when there is a conflict.

When the newly added orders corresponding to at least two candidate riders are the same, it can be determined that the candidate riders corresponding to the newly added orders are the same and conflict exists, and then conflict needs to be solved through S1066. Of course, if there is no conflict, the server may execute step S1068 to continue to determine the new order corresponding to the next candidate rider according to the preset order.

S1066: and adjusting the newly added orders corresponding to the alternative riders with the determined newly added orders until no conflict exists.

In the present description, when the server determines that there is a conflict, at least two candidate riders for which the newly added order is the order to be relocated may be determined as conflicting riders for each order to be relocated. Namely, the order to be relocated is taken as an alternative rider of the newly added order and taken as a conflict rider. Then, the candidate riders who have determined that there is a conflict in step S1064 may all be determined as conflicting riders.

Then, for each conflicting rider, there may be more than one to-be-reassigned orders whose assignment with the conflicting rider meets the specified condition, and at this time, the server may reselect a newly added order corresponding to the conflicting rider according to the specified condition for the determined at least one conflicting rider until no conflict exists. The server can continue to select the order to be relocated meeting the specified conditions for the next alternative rider to serve as the new order corresponding to the alternative rider until the alternative rider assigned by each order to be relocated is determined.

In addition, since there are also cases where there are no other orders to be relocated that satisfy the specified conditions, the server cannot reselect a new order for the conflicting rider at this time. If the server is unable to reselect new orders for any conflicting riders, conflicts cannot be avoided by simply reselecting new orders. Therefore, the server can also reselect a new order for at least one conflict rider by adjusting the assignment of each conflict rider and the assignment of the order to be relocated according to the adjusted assignment of each conflict rider and the adjusted assignment of the order to be relocated until no conflict exists.

Further, if there is still a conflict after the server traverses all the methods for selecting new orders for the conflicting rider, it indicates that the conflicting rider cannot select another new order for the conflicting rider, but the conflict cannot be avoided even if another new order is selected. Therefore, the server can adjust the assignment of each conflict rider and the assignment of the order to be relocated, and reselect a new order for at least one conflict rider according to the adjusted assignment of each conflict rider and the adjusted assignment of the order to be relocated until no conflict exists.

Further, in this specification, the server may adjust the assignment of each conflicting rider and the assignment of the to-be-reassigned order according to a preset step size in a manner of decreasing the assignment of each conflicting rider and increasing the assignment of the to-be-reassigned order.

Specifically, the preset step length may be set as required, for example, the minimum step length of the delivery efficiency is set as the preset step length, and assuming that the delivery efficiency is set with 0.1 as the minimum step length, the preset step length may be 0.1. Or, the server can also determine the combination of the conflict rider closest to the specified condition and the order to be relocated according to the assignment of each conflict rider, the assignment of each order to be relocated and the distribution efficiency of each conflict rider relative to each order to be relocated, and determine the step length adopted by the adjustment according to the sum of the assignment of the conflict rider and the assignment of the order to be relocated and the distribution efficiency of the conflict rider relative to the order to be relocated. Specifically, the server may determine, for each conflicting rider and each to-be-dispatched order, a sum of the assignment of the conflicting rider and the assignment of the to-be-dispatched order as an intermediate value of the conflicting rider with respect to the to-be-dispatched order, and then calculate a difference between the intermediate value of the conflicting rider with respect to the to-be-dispatched order and a distribution efficiency of the conflicting rider with respect to the to-be-dispatched order. Then, the minimum value of the distribution efficiency differences obtained by calculation is selected and used as the value corresponding to the step length adopted by the current adjustment.

In addition, when the assignment of each conflicting rider and the assignment of the order to be relocated are adjusted, the server still possibly cannot reselect a new order for any conflicting rider, or conflicts still exist after the server traverses all methods for selecting the new order for the conflicting riders, the assignment adjustment cannot solve the conflicts, and the server can continuously adjust the assignment of each conflicting rider and the assignment of the order to be relocated according to the preset step length until no conflicts exist.

S1068: and determining a new order corresponding to the next rider according to the preset sequence until all the orders to be refitted are selected as the new orders.

After the process shown in fig. 2, the server may select an alternative rider for each order to be relocated, and execute the task corresponding to the order to be relocated, but for any alternative rider, after adjusting the new order corresponding to each alternative rider whose new order has been determined in step S1066, the alternative rider may not have a corresponding new order, which indicates that the alternative rider does not help to maximize the comprehensive delivery efficiency, and therefore, the alternative rider does not consider receiving the order to be relocated.

Based on the order reassignment method shown in fig. 1, an order to be assigned to the rider is selected as an order to be reassigned, wherein the order is subject to the order pressing process among the undisplayed orders that have not been assigned to the rider. Determining the dispatching object of the order to be dispatched by determining the dispatching efficiency of the alternative rider relative to each order to be dispatched after assigning different orders to be dispatched to the alternative rider, and taking the maximized comprehensive dispatching efficiency as an optimization target. Since the principle behind the order-pressing process is that the assignment relationship between the order and the rider is not ideal (i.e., the distribution efficiency is low), the distribution efficiency of the order can be improved by re-distributing the order subjected to the order-pressing process. Compared with the mode that the order processed by pressing is only temporarily assigned to the rider in the prior art, the method provided by the specification can improve the distribution efficiency of the order processed by pressing.

In addition, since the distance-based efficiency varies in step S104 of the present specification, it may be determined specifically according to a difference in delivery distance between the original delivery route of the candidate rider and the updated delivery route. E.g. based on a formula

The server may determine the distance difference and may also utilize a distance constraint in order that the distance does not vary too much, resulting in an excessive increase in the total delivery distance for each candidate rider as a whole

A change in distance-based delivery efficiency on the updated delivery path for the candidate rider satisfying the distance constraint is determined. That is, the server may determine the distance difference value satisfying the distance constraint, and if the combination of a certain candidate rider and a certain order to be reassigned (i.e., the updated delivery path of the candidate rider) does not satisfy the distance constraint, it indicates that the delivery efficiency based on the delivery distance after the candidate rider accepts the order to be reassigned is too low for the candidate rider to assign the order to be reassigned.

Wherein newRider belongs to R, oldRider belongs to R, WBs belongs to WB, R belongs to R, D represents distance length, R represents alternative rider, R is alternative rider set capable of receiving order to be refitted, route_r，wbsAn updated delivery path representing the alternate rider r, wbs route_r，wbsThe route is an updated distribution route, like route_r，0Indicating the original delivery route of the alternative rider r, i indicates route_r，wbsTask points on the path, I_r，wbsRepresents route_r，wbsSet of task points on the path, so I ∈ I_r，wbs，

Indicating that the alternate rider r is updating the delivery path route_r，wbsRelative to the original delivery route_r，0The variation of the dispensing distance of (a),

representing path route_r，wbsThe distance between the included task point i and the i-1 task point on the path is

Representing path route_r，wbsThe total delivery distance of (a) is,

representing path route_r，0Total delivery distance.

Condition

In D_eIs a pre-set distance threshold value and,

indicating a change in the delivery distance of the alternate rider (i.e., newRider) after the reassignment, and the same way

Representing a change in the delivery distance of the rider (i.e., oldRider) who originally delivered the order to be served after the reassignment. Since the dispatch of an order usually involves two riders and causes the delivery distances of the two riders to change, if the change amount of the delivery distance of the candidate rider receiving the dispatch exceeds the change amount of the delivery distance of the rider originally delivering the order to be dispatched by too much (i.e. exceeds the preset distance threshold), it means that the delivery distance is increased too much as viewed by the two riders as a whole, and the candidate rider is not suitable to be assigned the order to be dispatched. The server may no longer calculate the delivery efficiency of the alternative rider with respect to the order to be reassigned.

In addition, the efficiency change based on the waiting time can be determined according to the difference between the sum of the waiting time of each order in the original distribution path and the sum of the waiting time of each order in the updated distribution path. E.g. based on a formula

The server may determine the difference in the wait times. Further, the server may determine that the waiting time constraint condition is satisfied in order not to increase the waiting time of the whole candidate rider excessively, similarly to the distance constraint condition

The corresponding waiting time-based delivery efficiency of the candidate rider of (1) varies.

Wherein, x is when the task point i in the path is the goods-taking position_i1, when the task point i in the path is the delivery position x_iWhere 0, W represents the waiting period,

representing the sum of the waiting times of the alternative riders r at each task point belonging to the pick position on the updated delivery path wbs,

representing the sum of the waiting times of the alternative riders r at each task point belonging to the pick position on the original delivery path wbs.

Middle W_eIs a pre-set latency threshold value for the time period,

representing the change in total waiting time of the alternate rider (i.e., newRider) after the reassignment, as

Representing a change in the total waiting time of the rider (i.e., oldRider) who originally delivered the order to be dispatched after the dispatch. It should be noted that, due to the change of the delivery route, the order of the delivery orders may also change, so that the total waiting time after the change of the delivery route changes, as can be seen from the formula of the change of the delivery efficiency based on the waiting time, the total waiting time is the sum of the waiting times of the orders included in the delivery route.

Further, based on the efficiency change of on-time distribution, the difference value between the sum of the early delivery time of each order in the original distribution path and the sum of the early delivery time of each order in the updated distribution path is determined. Similar to latency-based efficiency changes, the server may be based on a formula

Determining an efficiency change based on the just-in-time delivery, where P represents a time of advance arrival of the rider, then

Indicating the time that the alternate rider r has arrived earlier at the ith task point on the updated delivery path wbs. The advanced arrival time is a difference between the predicted arrival time and the committed arrival time, generally, in order to improve the user experience, after the user receives an order initiated by the user, the time for a rider to reach the user (i.e., the committed arrival time) is calculated and sent to the user by the user experience server, and the time for the order to reach the user after the order is reassigned may be earlier than the committed arrival time, which may cause time waste if the arrival time is too early, so that the smaller the advanced arrival time is, the better the advanced arrival time is, and the larger the advanced arrival time is, the lower the delivery efficiency is.

Further, the determined on-time distribution-based efficiency change, distance-based efficiency change, and waiting time-based efficiency change may be processed by discretization or indexing and then used in subsequent steps. Or, when the technical efficiency changes are required to be combined and used, the sum of the weighted efficiency changes can be used as the distribution efficiency of the alternative rider relative to the order to be relocated according to the preset weight for each efficiency change. For example, if the aforementioned efficiency changes are preset to be x1 to x3 respectively, and the corresponding weight values are p1 to p3 respectively, the delivery efficiency of the candidate rider relative to the order to be relocated is determined to be p1x1+ p2x2+ p3x 3.

Of course, in order to avoid excessive increase in the waiting time of the whole of each candidate rider, the server can also determine that the on-time arrival constraint condition is met

And

the alternative rider of (2) corresponds to a change in delivery efficiency based on-time delivery. Wherein T represents a timeout time, P_eTo presetIs reached to the threshold.

Indicating the timeout time on the updated delivery path wbs for the alternate rider after the reassignment (i.e., newRider), compared to the timeout time on the original delivery path for the rider that originally delivered the order to be reassigned (i.e.,

) And will not increase.

The indication is that the advanced arrival time of the alternative rider after the reassignment is not more than the advanced arrival time of the rider who originally delivers the order to be reassigned by a preset on-time delivery threshold, that is, the advanced arrival time is allowed to be increased, but the advance arrival time is not suitable for the reassignment if the advance arrival time is too much (the advance arrival time exceeds the preset on-time delivery threshold).

In addition, in order to avoid that an order is delivered by an alternative rider set as a blacklist by a user, in this specification, before calculating a delivery efficiency change of an updated delivery path of the alternative rider relative to an original delivery path, if it is determined that the alternative rider is included in the blacklist of the user who initiates the order to be reassigned, the delivery efficiency change may not be calculated any more, and it is determined that the order to be reassigned cannot be reassigned to the alternative rider. Therefore, the blacklist of the user can also be regarded as a constraint condition, similar to the above

And

similarly, when the alternative rider does not satisfy the above-mentioned constraint condition, the server may not calculate the distribution efficiency change any more, and determine that the order to be relocated cannot be relocated to the alternative rider.

Further, in step S104 of this specification, since it is considered whether the alternative rider will generate an increase in the overall delivery efficiency after executing the order to be relocated, the efficiency change mentioned above in this specification only considers the case where the updated delivery path is higher than the original delivery path, and when the delivery efficiency of the updated delivery path is lower than the original delivery path, the updated delivery path of the alternative rider may not be considered again. That is, for each candidate rider and each to-be-reassigned order, if the delivery efficiency of the candidate rider relative to the updated delivery path corresponding to the to-be-reassigned order is lower than the delivery efficiency of the original delivery path of the candidate rider, the delivery efficiency of the candidate rider relative to the to-be-reassigned order is not considered any more. Embodiments may set the delivery efficiency of the rider relative to the order to be reassigned to zero, or a preset negative minimum, or an indeterminate delivery efficiency, etc. So that the above-described case of the reduction in the delivery efficiency is not considered when the assignment relationship between each candidate rider and each order to be relocated is determined in step S106.

In addition, the server, when determining that the candidate rider who can receive the order to be served, may set the rider whose order is determined to be the order to be served in step S102, as the candidate rider who can receive the order to be served. That is, while the server may find a better delivery for the rider's order to be reassigned, the server may also "reassign" the order to be reassigned to the rider using the rider as an alternate rider if the delivery of the order to be reassigned by other riders is less efficient than the rider. For example, after the undisplayed order f of rider A is determined to be the order f to be reassigned, rider A acts as an alternative rider, ensuring that the worst reassignment result of the order f to be reassigned is "reassigned" to rider A. Of course, when the order to be reassigned is determined in step S102, the order to be reassigned does not have an assignment relationship with the rider, so that it can be regarded as a special order reassignment process if the order to be reassigned is subsequently determined to be reassigned to the rider.

Further, since the alternative rider receives the order to be reassigned by the other rider or reassigns the assigned order of the alternative rider to the other rider for execution, the distribution process of the alternative rider is complicated, and the uncertainty of the distribution by the rider increases, and therefore, the alternative rider is not suitable for receiving the order to be reassigned. Thus, in the present description, when determining that an alternative rider to be served an order to be served can be received, the server does not select a new order for the alternative rider if the rider initiates an order-overshift behavior within a preset time period. That is, the alternative rider who initiates the over-riding maneuver within the preset time period is not taken as the rider who can receive the order to be rescheduled. The preset time period can be set as required, and the specification is not limited.

Of course, in this specification, the server may also filter the candidate riders suitable for assigning the order to be served according to preset conditions. For example, a rider with an assigned order quantity less than a preset value is determined as an alternative rider because receiving an order for a reassignment does not put a large distribution pressure on the rider when the assigned order quantity of the rider is small. In this specification, specific contents of the preset conditions are not limited, and may be set as needed.

In step S104, when determining the delivery efficiency of the candidate rider for the order to be relocated, the server may determine a difference between the average waiting time values based on the change in efficiency based on the waiting time, based on the average waiting time value of the orders in the original delivery route and the average waiting time value of each order in the updated delivery route, as the change in efficiency based on the waiting time. Similarly, based on the efficiency change of the on-time distribution, the difference value of the average value of the early delivery time can be determined according to the average value of the early delivery time of each order in the original distribution path and the average value of the early delivery time of each order in the updated distribution path, and the difference value can be used as the efficiency change based on the early delivery time.

It should be noted that, since the server takes the orders subjected to the order-pressing process as the orders to be relocated in step S102 in this specification, and the number of the orders subjected to the order-pressing process usually occupies only a small part of the orders assigned in the scheduling period, the number of the orders to be relocated determined in this specification is generally smaller than the number of the candidate riders. The server then determines that the order reassignment process is complete in step S106 by merely determining the candidate rider for each order to be reassigned.

In addition, the server described in step S102 may divide the undisplayed order of each rider into order packages, and then determine the order package to be reassigned for the order-pressing process. Then, in step S104, the server may also determine, for each order package, the delivery efficiency of the alternative rider with respect to the order package to be reassigned after assigning the order package to be reassigned to the alternative rider. Finally, in step S106, the server may select a new additional order package for the candidate rider from the order packages to be reassigned by using a specified optimization algorithm for the candidate rider with the goal of maximizing the comprehensive delivery efficiency as an optimization goal, and assign the selected order package to the candidate rider as the new additional order package. The overall delivery efficiency is determined based on the delivery efficiency of each alternative rider with respect to the respective newly added order package.

Then in step S104, the server determines an updated delivery path for the alternative rider according to each of the to-be-relocated orders, each assigned order of the alternative rider and each non-to-be-relocated order of the alternative rider included in the to-be-relocated order package when determining the delivery efficiency of the alternative rider relative to the to-be-relocated order package. The specific processes in the rest steps are consistent with the process of order relocation performed by the server based on the determined order to be relocated, and the processes are not described in detail in the specification.

Based on the order reassignment method shown in fig. 1, an embodiment of the present specification further provides a schematic structural diagram of an order reassignment device, as shown in fig. 3.

Fig. 3 is a schematic structural diagram of an order reassigning apparatus provided in an embodiment of the present disclosure, where the apparatus includes:

the selection module 200 is used for determining the undisplayed orders subjected to the order pressing processing from the undisplayed orders of each rider and determining the orders to be changed of the rider according to the undisplayed orders subjected to the order pressing processing;

a delivery efficiency determination module 202, configured to determine, for each to-be-modified order and each candidate rider, a delivery efficiency of the candidate rider with respect to the to-be-modified order after the to-be-modified order is assigned to the candidate rider according to the assigned order of the candidate rider and a non-to-be-modified order in the undisplayed orders of the candidate rider;

the reassignment module 204 adopts a specified optimization algorithm for each alternative rider, takes the maximized comprehensive distribution efficiency as an optimization target, selects a new order for the alternative rider from the orders to be reassigned, and assigns the selected order as the new order to the alternative rider; and determining the comprehensive distribution efficiency according to the distribution efficiency of each alternative rider relative to each newly added order.

Optionally, the selecting module 200 divides each undisplayed order of the rider into a plurality of order packages according to the original delivery path of the rider, performs order compression processing on the order packages meeting order compression conditions in each order package, uses the order package with the latest delivery time in each order package subjected to order compression processing as the order package to be reassigned, and determines that the order in the order package to be reassigned is the order to be reassigned.

Optionally, the distribution efficiency determination 202 obtains, for each candidate rider, an original distribution path of the candidate rider determined based on the assigned order of the candidate rider and each undisplayed order of the candidate rider, determines an updated distribution path corresponding to the candidate rider after assigning the to-be-reassigned order to the candidate rider, and determines an efficiency change of the updated distribution path according to the distribution efficiency of the original distribution path and the distribution efficiency of the updated distribution path, as the distribution efficiency of the candidate rider relative to the to-be-reassigned order.

Optionally, the distribution efficiency determination 202 determines the efficiency change of the updated distribution path according to at least one of a distance-based efficiency change, a waiting time-based efficiency change, and an on-time distribution-based efficiency change, wherein the distance-based efficiency change is determined according to a distribution distance difference between the original distribution path and the updated distribution path; the efficiency change based on the waiting time is determined according to the difference value between the sum of the waiting time of each order in the original distribution path and the sum of the waiting time of each order in the updated distribution path; and determining the efficiency change based on-time distribution according to the difference between the sum of the early delivery time of each order in the original distribution path and the sum of the early delivery time of each order in the updated distribution path.

Optionally, the reassignment module 204 assigns values to each alternative rider and each to-be-reassigned order according to the delivery efficiency of each alternative rider relative to each to-be-reassigned order, wherein for each alternative rider, the sum of the assignment of the alternative rider and the assignment of any to-be-reassigned order is equal to the maximum delivery efficiency of the alternative rider relative to each to-be-reassigned order, and for each alternative rider in turn according to a preset sequence, according to the assignment of each to-be-reassigned order and the assignment of the alternative rider, any to-be-reassigned order meeting a specified condition is selected as a new order corresponding to the rider; the specified conditions include: and if the newly added orders corresponding to at least two alternative riders are the same, the newly added orders corresponding to the alternative riders with the newly added orders are adjusted until no conflict exists, otherwise, the newly added orders corresponding to the next alternative rider are determined according to the preset sequence until all the orders to be relocated are selected as the newly added orders.

Optionally, the reassigning module 204 determines, for each to-be-reassigned order, at least two candidate riders whose newly added orders are the to-be-reassigned orders, as conflict riders, and reselects, according to the specified condition, a newly added order corresponding to the conflict rider for the determined at least one conflict rider until no conflict exists.

Optionally, the module for reassigning 204 is configured to, if a new order cannot be reselected for any conflicting rider according to the specified condition, or a conflict still exists after traversing all methods for selecting a new order for the conflicting rider, adjust the assignment of each conflicting rider and the assignment of the order to be reassigned, and reselect a new order for at least one conflicting rider according to the adjusted assignment of each conflicting rider and the adjusted assignment of the order to be reassigned until no conflict exists.

Optionally, the reassignment module 204 decreases the assignment of each conflicting rider and increases the assignment of the order to be reassigned according to a preset step size.

Optionally, the reassignment module 204 does not select a new order for the alternative rider if the alternative rider initiates an order-passing behavior within a preset time period.

Embodiments of the present specification also provide a computer-readable storage medium, where the storage medium stores a computer program, and the computer program can be used to execute the order reassignment method provided in fig. 1.

Based on the order reassignment method shown in fig. 1, the embodiment of the present specification further provides a schematic structural diagram of the electronic device shown in fig. 4. As shown in fig. 4, at the hardware level, the electronic device includes a processor, an internal bus, a network interface, a memory, and a non-volatile memory, but may also include hardware required for other services. The processor reads the corresponding computer program from the non-volatile memory into the memory and then runs the computer program to implement the order reassignment method described in fig. 1 above.

Of course, besides the software implementation, the present specification does not exclude other implementations, such as logic devices or a combination of software and hardware, and the like, that is, the execution subject of the following processing flow is not limited to each logic unit, and may be hardware or logic devices.

In the 90 s of the 20 th century, improvements in a technology could clearly distinguish between improvements in hardware (e.g., improvements in circuit structures such as diodes, transistors, switches, etc.) and improvements in software (improvements in process flow). However, as technology advances, many of today's process flow improvements have been seen as direct improvements in hardware circuit architecture. Designers almost always obtain the corresponding hardware circuit structure by programming an improved method flow into the hardware circuit. Thus, it cannot be said that an improvement in the process flow cannot be realized by hardware physical modules. For example, a Programmable Logic Device (PLD), such as a Field Programmable Gate Array (FPGA), is an integrated circuit whose Logic functions are determined by programming the Device by a user. A digital system is "integrated" on a PLD by the designer's own programming without requiring the chip manufacturer to design and fabricate application-specific integrated circuit chips. Furthermore, nowadays, instead of manually making an Integrated Circuit chip, such Programming is often implemented by "logic compiler" software, which is similar to a software compiler used in program development and writing, but the original code before compiling is also written by a specific Programming Language, which is called Hardware Description Language (HDL), and HDL is not only one but many, such as abel (advanced Boolean Expression Language), ahdl (alternate Hardware Description Language), traffic, pl (core universal Programming Language), HDCal (jhdware Description Language), lang, Lola, HDL, laspam, hardward Description Language (vhr Description Language), vhal (Hardware Description Language), and vhigh-Language, which are currently used in most common. It will also be apparent to those skilled in the art that hardware circuitry that implements the logical method flows can be readily obtained by merely slightly programming the method flows into an integrated circuit using the hardware description languages described above.

The controller may be implemented in any suitable manner, for example, the controller may take the form of, for example, a microprocessor or processor and a computer-readable medium storing computer-readable program code (e.g., software or firmware) executable by the (micro) processor, logic gates, switches, an Application Specific Integrated Circuit (ASIC), a programmable logic controller, and an embedded microcontroller, examples of which include, but are not limited to, the following microcontrollers: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20, and Silicone Labs C8051F320, the memory controller may also be implemented as part of the control logic for the memory. Those skilled in the art will also appreciate that, in addition to implementing the controller as pure computer readable program code, the same functionality can be implemented by logically programming method steps such that the controller is in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers, embedded microcontrollers and the like. Such a controller may thus be considered a hardware component, and the means included therein for performing the various functions may also be considered as a structure within the hardware component. Or even means for performing the functions may be regarded as being both a software module for performing the method and a structure within a hardware component.

The systems, devices, modules or units illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. One typical implementation device is a computer. In particular, the computer may be, for example, a personal computer, a laptop computer, a cellular telephone, a camera phone, a smartphone, 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.

For convenience of description, the above devices are described as being divided into various units by function, and are described separately. Of course, the functions of the various elements may be implemented in the same one or more software and/or hardware implementations of the present description.

As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

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

The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.

Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, 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 disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.

It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.

As will be appreciated by one skilled in the art, embodiments of the present description may be provided as a method, system, or computer program product. Accordingly, the description may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the description may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

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

The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment.

The above description is only an example of the present specification, and is not intended to limit the present specification. Various modifications and alterations to this description will become apparent to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present specification should be included in the scope of the claims of the present specification.

Claims

1. A method of order reassignment, comprising:

2. The method of claim 1, wherein determining the undisplayed order for the saddle stitching process from among the undisplayed orders for the rider comprises:

3. The method of claim 1, wherein determining the delivery efficiency of the alternative rider with respect to the order to be reassigned after assigning the order to be reassigned to the alternative rider comprises:

4. The method as claimed in claim 3, wherein determining the change in the efficiency of the updated delivery path based on the delivery efficiency of the original delivery path and the delivery efficiency of the updated delivery path comprises:

5. The method of claim 3, wherein selecting an order for the candidate rider from each order to be reassigned with a specified optimization algorithm with a goal of maximizing overall delivery efficiency comprises:

6. The method of claim 5, wherein adjusting the new order for each rider for which a new order has been determined comprises:

7. The method of claim 6, wherein the method further comprises:

8. The method of claim 7, wherein adjusting the assignment of each conflicting rider and the assignment of the order to be reassigned comprises:

9. The method of claim 1, wherein if the alternative rider initiates the order-passing behavior within a predetermined time period, no new orders are selected for the alternative rider.

10. An order form reassignment apparatus, said apparatus comprising:

the order changing module adopts a specified optimization algorithm aiming at each alternative rider, takes the maximized comprehensive distribution efficiency as an optimization target, selects an order for the alternative rider from various orders to be changed, and takes the selected order as a new order to be assigned to the alternative rider; and determining the comprehensive distribution efficiency according to the distribution efficiency of each alternative rider relative to each newly added order.

11. A computer-readable storage medium, characterized in that the storage medium stores a computer program which, when executed by a processor, implements the method of any of the preceding claims 1-9.

12. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method of any of claims 1-9 when executing the program.