Order allocation method and device, electronic equipment and storage medium

Abstract

The invention relates to an order distribution method and device, electronic equipment and a storage medium, and the method comprises the steps: carrying out the aggregation and grouping of a plurality of orders according to the order positions of the plurality of orders in a polar coordinate system, and obtaining an aggregation result, and the aggregation result comprises at least one order cluster and / or a plurality of undistributed orders, the order cluster comprises at least two orders; in response to the condition that the aggregation result comprises at least one order aggregation cluster, allocating each order aggregation cluster in the at least one order aggregation cluster to a delivery person; and in response to the fact that the aggregation result comprises a plurality of unallocated orders, grouping the plurality of unallocated orders on the way according to the order positions of the plurality of unallocated orders, and allocating each obtained order on-the-way cluster to a delivery person, the order on-the-way cluster comprising at least one unallocated order.

Description

Technical Field

[0001] The present disclosure relates to the technical field of logistics distribution, and in particular to an order distribution method, device, electronic device and storage medium. Background Art

[0002] In recent years, delivery services such as takeaway services and express delivery services have brought great convenience to people's lives. The delivery service system needs to coordinate orders and delivery personnel to achieve effective resource utilization and fully guarantee user experience. When allocating orders, the delivery service system often needs to determine whether multiple orders can be assigned to one delivery person for delivery, and the judgment basis can be the delivery cost. However, in the related art, the distribution efficiency of the delivery service system when allocating orders is low, and the distribution results fail to reasonably reduce the delivery cost. Summary of the invention

[0003] The present disclosure provides an order allocation method, device, equipment and storage medium to solve the defects in the related art.

[0004] According to a first aspect of an embodiment of the present disclosure, there is provided an order allocation method, the method comprising:

[0005] Aggregating and grouping the multiple orders according to their order positions in the polar coordinate system to obtain an aggregation result, wherein the aggregation result includes at least one order cluster and / or multiple unallocated orders, and the order cluster includes at least two orders;

[0006] In response to the clustering result including at least one order cluster, assigning each order cluster in the at least one order cluster to a delivery person;

[0007] In response to the clustering result including multiple unassigned orders, the multiple unassigned orders are grouped according to their order locations, and each resulting order en-route cluster is assigned to a delivery person, wherein the order en-route cluster includes at least one unassigned order.

[0008] In one embodiment of the present disclosure, aggregating and grouping the multiple orders according to their order positions in the polar coordinate system to obtain an aggregation result includes:

[0009] Determine each non-clustered order as a reference order in turn according to a preset order;

[0010] For each reference order, orders that fall within a reference polar diameter range of the reference order and a reference polar angle range of the reference order are determined as an order cluster, wherein the reference polar diameter range is a range determined according to the polar diameter of the reference order, and the reference polar angle range is a range determined according to the polar angle of the reference order.

[0011] In one embodiment of the present disclosure, the method further includes:

[0012] In response to the number of orders in the order cluster being greater than a quantity threshold or the amount of orders in the order cluster being greater than a amount threshold, at least one order is deleted from the order cluster according to a preset deletion principle, so that the number of orders in the order cluster is not greater than the quantity threshold and the amount of orders in the order cluster is not greater than the amount threshold, wherein the preset deletion principle includes deleting at least one order that is closest to the merchant location, or deleting at least one order that is farthest from the merchant location.

[0013] In one embodiment of the present disclosure, the step of grouping the multiple unassigned orders according to their order locations, and assigning each obtained order cluster to a delivery person, includes:

[0014] Determine each unassigned order that is not clustered as a reference order in turn according to a preset order;

[0015] For each reference order, unassigned orders falling within a reference polar angle range of the reference order are determined as an order en route cluster, and the order en route cluster is assigned to a delivery person, wherein the reference polar angle range is a range determined according to the polar angle of the reference order.

[0016] In one embodiment of the present disclosure, the method further includes:

[0017] In response to the number of unallocated orders in the order en route cluster being greater than a quantity threshold or the amount of unallocated orders in the order en route cluster being greater than a money threshold, at least one unallocated order is deleted from the order en route cluster according to a preset deletion principle, so that the number of unallocated orders in the order en route cluster is not greater than the quantity threshold and the amount of unallocated orders in the order en route cluster is not greater than the money threshold, wherein the preset deletion principle includes deleting at least one unallocated order that is closest to the merchant location, or deleting at least one unallocated order that is farthest from the merchant location.

[0018] In one embodiment of the present disclosure, the step of grouping the multiple unassigned orders according to their order locations, and assigning each obtained order cluster to a delivery person, includes:

[0019] For each delivery person, according to the current delivery route of the delivery person and the order locations of multiple unassigned orders, determine the convenience coefficient of each unassigned order, where the convenience coefficient is used to characterize the offset angle and / or moving distance after adding the unassigned order to the current delivery route, and the current delivery route includes a route formed by at least one order location arranged in sequence;

[0020] According to the convenience coefficient of each unassigned order, determine a target order among the multiple unassigned orders, and add the order location of the target order to the current delivery route to obtain a combined order route;

[0021] In response to the combined order route meeting the preset requirements, determine the orders to which all order locations in the combined order route belong as an order convenience cluster and assign them to the delivery person.

[0022] In an embodiment of the present disclosure, the determining the convenience coefficient of each unassigned order according to the current delivery route of the delivery person and the order locations of multiple unassigned orders includes:

[0023] For any unassigned order, determine the convenience angle and / or convenience distance of the unassigned order, where the convenience angle is the angle between a first direction and a second direction, the first direction is the direction from the penultimate order location or the merchant location in the current delivery route to the last order location, and the second direction is the direction from the last order location to the order location of the unassigned order, and the convenience distance is the distance between the last order location and the order location of the unassigned order;

[0024] Determine the convenience coefficient of the unassigned order according to the convenience angle and / or convenience distance of the unassigned order.

[0025] In an embodiment of the present disclosure, the determining the convenience coefficient of the unassigned order according to the convenience angle and / or convenience distance of the unassigned order includes:

[0026] In response to the convenience angle being less than or equal to a first angle threshold and greater than or equal to a second angle threshold, determine the product of the convenience angle and the convenience distance as the convenience coefficient.

[0027] In an embodiment of the present disclosure, the determining the convenience coefficient of the unassigned order according to the convenience angle and / or convenience distance of the unassigned order includes:

[0028] In response to the convenience angle being greater than the first angle threshold, determine the convenience coefficient to be infinite.

[0029] In one embodiment of the present disclosure, determining the convenience coefficient of the unassigned order according to the included angle and / or the convenience distance of the unassigned order includes:

[0030] In response to the included angle being less than a second angle threshold, determining the product of the second angle threshold and the convenience distance as the convenience coefficient.

[0031] In one embodiment of the present disclosure, the method further includes:

[0032] In response to there being no delivery route for the delivery person, determining the location of the order closest to the merchant location among the multiple unassigned orders as the first order location in the delivery route of the delivery person according to the order locations of the multiple unassigned orders.

[0033] In one embodiment of the present disclosure, the preset requirements include:

[0034] The number of orders to which all order locations in the order consolidation path belong is greater than a quantity threshold; or,

[0035] The amount of the orders to which all order locations in the order consolidation path belong is greater than an amount threshold.

[0036] According to a second aspect of the embodiments of the present disclosure, there is provided an order allocation method, the method including:

[0037] Determining the convenience coefficient of each unassigned order according to the current delivery route of the delivery person and the order locations of multiple unassigned orders, where the convenience coefficient is used to characterize the deviation angle and / or the moving distance after adding the unassigned order to the current delivery route, and the current delivery route includes a path formed by at least one order location arranged in sequence;

[0038] Determining a target order among the multiple unassigned orders according to the convenience coefficient of each unassigned order, and adding the order location of the target order to the current delivery route.

[0039] According to a third aspect of the embodiments of the present disclosure, there is provided an order allocation device, the device including:

[0040] An aggregation grouping module, configured to perform aggregation grouping on the multiple orders according to the order locations of the multiple orders in the polar coordinate system to obtain an aggregation result, where the aggregation result includes at least one order aggregation cluster and / or multiple unassigned orders, and the order aggregation cluster includes at least two orders;

[0041] A first allocation module, configured to, in response to the aggregation result including at least one order aggregation cluster, allocate each order aggregation cluster in the at least one order aggregation cluster to a delivery person;

[0042] A second allocation module, configured to, in response to the aggregation result including multiple unallocated orders, group the multiple unallocated orders in a way of being on the way according to the order locations of the multiple unallocated orders, and allocate each obtained order on-the-way cluster to a delivery person, where the order on-the-way cluster includes at least one unallocated order.

[0043] In an embodiment of the present disclosure, the aggregation grouping module is configured to:

[0044] Determine each unclustered order as a reference order in a preset order in sequence;

[0045] For each reference order, determine the orders that fall within the reference polar radius range of the reference order and fall within the reference polar angle range of the reference order as an order aggregation cluster, where the reference polar radius range is a range determined according to the polar radius of the reference order, and the reference polar angle range is a range determined according to the polar angle of the reference order.

[0046] In an embodiment of the present disclosure, the device further includes a first deletion module, configured to:

[0047] In response to the number of orders in the order aggregation cluster being greater than a quantity threshold or the amount of orders in the order aggregation cluster being greater than an amount threshold, delete at least one order from the order aggregation cluster according to a preset deletion principle, so that the number of orders in the order aggregation cluster is not greater than the quantity threshold and the amount of orders in the order aggregation cluster is not greater than the amount threshold, where the preset deletion principle includes deleting at least one order closest to the merchant location or deleting at least one order farthest from the merchant location.

[0048] In an embodiment of the present disclosure, the second allocation module is configured to:

[0049] Determine each unclustered unallocated order as a reference order in a preset order in sequence;

[0050] For each reference order, determine the unallocated orders that fall within the reference polar angle range of the reference order as an order on-the-way cluster, and allocate the order on-the-way cluster to a delivery person, where the reference polar angle range is a range determined according to the polar angle of the reference order.

[0051] In an embodiment of the present disclosure, the device further includes a second deletion module, configured to:

[0052] In response to the number of unassigned orders in the order along-the-way cluster being greater than a quantity threshold or the amount of unassigned orders in the order along-the-way cluster being greater than an amount threshold, at least one unassigned order is deleted from the order along-the-way cluster according to a preset deletion principle, so that the number of unassigned orders in the order along-the-way cluster is not greater than the quantity threshold and the amount of unassigned orders in the order along-the-way cluster is not greater than the amount threshold. Wherein, the preset deletion principle includes deleting at least one unassigned order closest to the merchant location or deleting at least one unassigned order farthest from the merchant location.

[0053] In one embodiment of the present disclosure, the second allocation module is configured to:

[0054] For each delivery person, according to the current delivery path of the delivery person and the order locations of multiple unassigned orders, determine the along-the-way coefficient of each unassigned order, where the along-the-way coefficient is used to characterize the deviation angle and / or moving distance after adding the unassigned order to the current delivery path, and the current delivery path includes a path formed by at least one order location arranged in sequence;

[0055] According to the along-the-way coefficient of each unassigned order, determine a target order among the multiple unassigned orders, and add the order location of the target order to the current delivery path to obtain a combined order path;

[0056] In response to the combined order path meeting a preset requirement, determine the orders to which all order locations in the combined order path belong as an order along-the-way cluster and allocate them to the delivery person.

[0057] In one embodiment of the present disclosure, the second allocation module is configured to:

[0058] For any unassigned order, determine the along-the-way included angle and / or along-the-way distance of the unassigned order, where the along-the-way included angle is the included angle between a first direction and a second direction, the first direction is the direction from the penultimate order location or the merchant location in the current delivery path to the last order location, and the second direction is the direction from the last order location to the order location of the unassigned order, and the along-the-way distance is the distance between the last order location and the order location of the unassigned order;

[0059] According to the along-the-way included angle and / or along-the-way distance of the unassigned order, determine the along-the-way coefficient of the unassigned order.

[0060] In one embodiment of the present disclosure, the second allocation module is configured to:

[0061] In response to the along-the-way angle being less than or equal to the first angle threshold and greater than or equal to the second angle threshold, determine the product of the along-the-way angle and the along-the-way distance as the along-the-way coefficient.

[0062] In one embodiment of the present disclosure, the second allocation module is configured to:

[0063] In response to the along-the-way angle being greater than the first angle threshold, determine that the along-the-way coefficient is infinite.

[0064] In one embodiment of the present disclosure, the second allocation module is configured to:

[0065] In response to the along-the-way angle being less than the second angle threshold, determine the product of the second angle threshold and the along-the-way distance as the along-the-way coefficient.

[0066] In one embodiment of the present disclosure, the device further includes a path construction module, configured to:

[0067] In response to the delivery person having no delivery path, according to the order locations of the multiple unallocated orders, determine the order location of the unallocated order closest to the merchant location among the multiple unallocated orders as the first order location in the delivery path of the delivery person.

[0068] In one embodiment of the present disclosure, the preset requirements include:

[0069] The number of orders to which all order locations in the combined order path belong is greater than the quantity threshold; or,

[0070] The amount of the orders to which all order locations in the combined order path belong is greater than the amount threshold.

[0071] According to a fourth aspect of the embodiments of the present disclosure, there is provided an order allocation device, the device includes:

[0072] A coefficient module, configured to determine the along-the-way coefficient of each unallocated order according to the current delivery path of the delivery person and the order locations of the multiple unallocated orders, where the along-the-way coefficient is used to characterize the offset angle and / or moving distance after adding the unallocated order to the current delivery path, and the current delivery path includes a path formed by at least one order location arranged in sequence;

[0073] A third allocation module, configured to determine a target order among the multiple unallocated orders according to the along-the-way coefficient of each unallocated order, and add the order location of the target order to the current delivery path.

[0074] According to a fifth aspect of an embodiment of the present disclosure, an electronic device is provided, the device comprising a memory and a processor, the memory being used to store computer instructions executable on the processor, the processor being used to implement the method described in the first aspect and / or the second aspect when executing the computer instructions.

[0075] According to a sixth aspect of an embodiment of the present disclosure, a computer-readable storage medium is provided, on which a computer program is stored, and when the program is executed by a processor, the method described in the first aspect and / or the second aspect is implemented.

[0076] According to the above embodiments, it can be known that the multiple orders can be clustered and grouped according to their order positions in the polar coordinate system to obtain at least one order cluster and / or multiple unassigned orders, and when at least one order cluster is obtained, each order cluster in the at least one order cluster is assigned to a delivery personnel, and when multiple unassigned orders are obtained, the multiple unassigned orders are grouped along the way according to their order positions, and each of the obtained order clusters is assigned to a delivery personnel. The method utilizes the order positions in the polar coordinate system to cluster and group multiple orders, that is, orders that are close in distance are divided into an order cluster and assigned to a delivery person for delivery, and it is determined whether the orders that have not entered the order cluster are on the way, and the orders that are on the way are divided into an order on the way cluster and assigned to a delivery person for delivery. Through clustering and on-the-way grouping, the multiple orders obtained by each delivery person can be close in distance and / or on the way, which can enable each delivery person to complete the delivery in a shorter distance, that is, reducing the delivery cost of multiple orders; and the clustering and grouping are performed based on the order positions in the polar coordinate system. Compared with clustering and grouping using horizontal coordinates, it can reduce the amount of calculation, improve the calculation efficiency, and thus improve the efficiency of order allocation.

[0077] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0078] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and, together with the description, serve to explain the principles of the present disclosure.

[0079] Figure 1 is a flow chart of an order allocation method shown in an embodiment of the present disclosure;

[0080] Figure 2 is a schematic diagram of a horizontal coordinate system and a polar coordinate system shown in an embodiment of the present disclosure;

[0081] Figure 3It is a schematic diagram of an aggregation grouping process shown in an embodiment of the present disclosure;

[0082] Figure 4 It is a schematic diagram of the first in - route grouping process shown in an embodiment of the present disclosure;

[0083] Figure 5 It is a schematic diagram of the second in - route grouping process shown in an embodiment of the present disclosure;

[0084] Figure 6 It is a flowchart of a method for determining an in - route coefficient shown in an embodiment of the present disclosure;

[0085] Figure 7 It is a schematic diagram of an in - route angle shown in an embodiment of the present disclosure;

[0086] Figure 8 It is a schematic diagram when the in - route angle is too small shown in an embodiment of the present disclosure;

[0087] Figure 9 It is a flowchart of a method for selecting a target order shown in an embodiment of the present disclosure;

[0088] Figure 10 It is a schematic diagram of linear in - route shown in an embodiment of the present disclosure;

[0089] Figure 11 It is a schematic diagram of curved in - route shown in an embodiment of the present disclosure;

[0090] Figure 12 It is a flowchart of an order allocation method shown in an embodiment of the present disclosure;

[0091] Figures 13 to 16 It is a schematic diagram of an order allocation method shown in an embodiment of the present disclosure;

[0092] Figure 17 It is a schematic diagram of the structure of an order allocation device shown in an embodiment of the present disclosure;

[0093] Figure 18 It is a schematic diagram of the structure of an order allocation device shown in an embodiment of the present disclosure;

[0094] Figure 19 It is a schematic diagram of the structure of an electronic device shown in an embodiment of the present disclosure. Detailed implementation manners

[0095] Exemplary embodiments will be described in detail herein, and examples thereof are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present disclosure. On the contrary, they are merely examples of apparatuses and methods consistent with some aspects of the present disclosure as detailed in the appended claims.

[0096] The terms used in the present disclosure are for the purpose of describing particular embodiments only and are not intended to limit the present disclosure. The singular forms "a", "the", and "said" used in the present disclosure and the appended claims are also intended to include the plural forms unless the context clearly dictates otherwise. It should also be understood that the term "and / or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.

[0097] It should be understood that although the terms first, second, third, etc. may be used in the present disclosure to describe various information, such information should not be limited to these terms. These terms are only used to distinguish the same type of information from each other. For example, without departing from the scope of the present disclosure, the first information may also be referred to as the second information, and similarly, the second information may also be referred to as the first information. Depending on the context, the word "if" as used herein may be interpreted as "when" or "while" or "in response to determining".

[0098] In recent years, delivery services such as food delivery services and express delivery services have brought great convenience to people's lives. The delivery service system needs to coordinate orders and delivery personnel to achieve efficient utilization of resources and full guarantee of user experience. When the delivery service system allocates orders, it often needs to determine whether multiple orders can be assigned to a single delivery person for delivery, and the judgment basis can be the delivery cost. However, in the related art, the allocation efficiency of the delivery service system when allocating orders is relatively low, and the allocation result also fails to reasonably reduce the delivery cost.

[0099] Based on this, at least one embodiment of the present disclosure provides an order allocation method, which can be applied to a delivery service system, such as a food delivery system, an express delivery system, etc., so that the delivery service system can improve the delivery efficiency and the utilization rate of delivery manpower when allocating orders to delivery personnel.

[0100] Exemplarily, this method is particularly applicable to the scenario of allocating multiple orders of the same merchant, where the source locations of the multiple orders are the same while the destination locations are different. If the multiple orders are allocated to the same delivery person, the delivery person can pick up the deliveries of the multiple orders from the source location at one time and deliver these deliveries to the destination locations of the multiple orders. The source location can be the pick-up location of the delivery in the order, such as the location of the restaurant where the food is picked up for a food delivery order, and the destination location can be the delivery location of the order, such as the receiving address or the pick-up point corresponding to the receiving address, etc.

[0101] Please refer to the appendix Figure 1 , which exemplarily shows the process of this order allocation method, including step S101 to step S103.

[0102] In step S101, according to the order positions of the multiple orders in the polar coordinate system, the multiple orders are aggregated and grouped to obtain an aggregation result, where the aggregation result includes at least one order aggregation cluster and / or multiple unallocated orders, and the order aggregation cluster includes at least two orders.

[0103] Among them, the multiple orders can be orders generated by the delivery service system, that is, after the delivery service system generates orders, this method can be used to continuously allocate these orders to delivery personnel for delivery. Unallocated orders refer to the orders that do not enter any order aggregation cluster in the aggregation grouping. Please refer to the appendix Figure 2 , which respectively shows the schematic diagrams of the horizontal coordinate system and the polar coordinate system. The polar coordinate system includes a pole and a polar axis. The polar axis is a ray starting from the pole. The coordinates of each point in the polar coordinate system include a polar radius ρ and a polar angle θ. The polar radius is the distance between this point and the pole, and the polar angle is the included angle between the line connecting this point and the pole and the polar axis. For example, the polar coordinate system can use the merchant location (such as the restaurant location in the food delivery system scenario) as the pole and the ray starting from the merchant location in a certain direction as the polar axis.

[0104] This step can be executed in the following manner: Each unclustered order is sequentially determined as a reference order in a preset order (such as in ascending or descending order of the polar angle); for each reference order, the orders that fall within the reference polar radius range of the reference order and fall within the reference polar angle range of the reference order are determined as an order aggregation cluster, where the reference polar radius range is the range determined according to the polar radius of the reference order, and the reference polar angle range is the range determined according to the polar angle of the reference order.

[0105] For example, the reference polar radius range can be ρ i ±2Δρ, where ρ i is the polar radius of the reference order, and Δρ is a preset distance value; the reference polar angle range can be θ i ±2Δθ, where θ iLet θ be the polar angle of the reference order, and Δθ be the preset angle value.

[0106] It should be understood that if an order that falls within the reference polar radius range and the reference polar angle range of the reference order includes the reference order. If the number of orders that fall within the reference polar radius range and the reference polar angle range of the reference order is greater than 1, then all orders that fall within the reference polar radius range and the reference polar angle range of the reference order are determined as an order aggregation cluster; if the number of orders that fall within the reference polar radius range and the reference polar angle range of the reference order is 1, that is, the reference order, the reference order is not taken as an order aggregation cluster. Furthermore, if an order is determined to be an order in the order aggregation cluster, then the order has been clustered; if an order has not been determined to be an order in the order aggregation cluster, then the order has not been clustered.

[0107] This method can form order aggregation clusters for orders that are relatively close in multiple orders, and using polar coordinates for calculation can greatly reduce the computing power and improve the efficiency of aggregation grouping.

[0108] The delivery capacity of each delivery person is limited. One reason is that the delivery capacity that the delivery person can provide is limited, and the other reason is that if too many delivery people are requisitioned, the delivery efficiency will be low. The delivery capacity of the delivery person can be characterized by the number of orders and the amount of the orders, that is, the number of orders assigned to the delivery person cannot be greater than the (preset) quantity threshold, and the amount of the orders assigned to the delivery person (that is, the total amount of all orders) cannot be greater than the (preset) amount threshold.

[0109] Based on the above order allocation principle, it is also possible to respond to the situation that the number of orders in the order aggregation cluster is greater than the quantity threshold or the amount of the orders in the order aggregation cluster is greater than the amount threshold, and delete at least one order from the order aggregation cluster according to the preset deletion principle, so that the number of orders in the order aggregation cluster is not greater than the quantity threshold and the amount of the orders in the order aggregation cluster is not greater than the amount threshold. Among them, the preset deletion principle includes deleting at least one order closest to the merchant's location, or deleting at least one order farthest from the merchant's location. Preferably, the preset deletion principle can follow the principle of giving priority to long distances, that is, the preset deletion principle is to delete at least one order closest to the merchant's location. Among them, the principle of giving priority to long distances is: for orders that are far and relatively concentrated, one rider should be arranged for delivery as much as possible. Therefore, if at least one order farthest from the merchant's location is deleted, multiple orders farthest from the merchant will be assigned to different delivery personnel, resulting in an increase in delivery costs.

[0110] For example, attached Figure 3In the example shown, order1, order2, order3, order4, and order5 are orders in the order cluster obtained by clustering and grouping. The numbers in order1, order2, order3, order4, and order5 represent the amounts of the corresponding orders. Since the number of orders in the order cluster is 5, which is greater than the quantity threshold 3, and the amount of orders in the order cluster is 780, which is greater than the amount threshold 600, order5, which is closest to the merchant location, is deleted first, and the attached Figure 3 In the order cluster on the left, the quantity 4 of the remaining order1, order2, order3, and order4 is greater than the quantity threshold 3, and the amount 480 is less than the amount threshold 600. Therefore, order4, which is closest to the merchant location, is deleted, and the attached Figure 3 The order cluster on the right (i.e. the position in the dotted circle) has the quantity 3 of the remaining order1, order2, and order3 not greater than the quantity threshold 3, and the amount 480 not greater than the amount threshold 600, so the attached Figure 3 The order cluster on the right is assigned to a delivery person for delivery.

[0111] The quantity threshold and the amount threshold are used to determine whether the orders in the order cluster exceed the delivery personnel's delivery capacity, so that the orders assigned to the delivery personnel can fully utilize the delivery personnel's delivery capacity while avoiding exceeding the delivery personnel's delivery capacity and causing low delivery efficiency.

[0112] In step S102, in response to the clustering result including at least one order cluster, each order cluster in the at least one order cluster is assigned to a delivery person.

[0113] For example, N delivery personnel closest to the merchant are selected, and the N order clusters are assigned to the N delivery personnel one-to-one, where N is a positive integer, that is, the number of orders in the at least one order cluster.

[0114] In step S103, in response to the clustering result including multiple unassigned orders, the multiple unassigned orders are grouped according to their order locations, and each resulting order en-route cluster is assigned to a delivery person, wherein the order en-route cluster includes at least one unassigned order.

[0115] Exemplarily, this step can be executed in the following manner: Determine each unassigned order that has not been clustered as a reference order in a preset order (for example, in ascending or descending order of the polar angle); for each reference order, determine the unassigned orders that fall within the reference polar angle range of the reference order as an order along-the-way cluster, and assign the order along-the-way cluster to a delivery person, where the reference polar angle range is a range determined according to the polar angle of the reference order.

[0116] For example, the reference polar angle range can be θ j ±2Δθ, where θ j is the polar angle of the reference order, and Δθ is a preset angle value.

[0117] If an unassigned order is determined to be an order in the order along-the-way cluster, then the unassigned order has been clustered; if an unassigned order has not been determined to be an order in the order along-the-way cluster, then the unassigned order has not been clustered.

[0118] This method can form an order along-the-way cluster for orders that are more along-the-way among multiple orders, and using polar coordinates for calculation can greatly reduce the computing power and improve the efficiency of along-the-way grouping.

[0119] The delivery capacity of each delivery person is limited. One reason is that the delivery capacity that the delivery person can provide is limited, and the other reason is that if too many delivery people are requisitioned, the delivery efficiency will be low. The delivery capacity of the delivery person can be characterized by the number of orders and the amount of the orders, that is, the number of orders assigned to the delivery person cannot be greater than a (preset) quantity threshold, and the amount of the orders assigned to the delivery person (that is, the total amount of all orders) cannot be greater than a (preset) amount threshold.

[0120] Based on the above order allocation principle, in response to the number of unassigned orders in the order along-the-way cluster being greater than the quantity threshold or the amount of the unassigned orders in the order along-the-way cluster being greater than the amount threshold, at least one unassigned order can be deleted from the order along-the-way cluster according to a preset deletion principle, so that the number of unassigned orders in the order along-the-way cluster is not greater than the quantity threshold and the amount of the unassigned orders in the order along-the-way cluster is not greater than the amount threshold, where the preset deletion principle includes deleting at least one unassigned order closest to the merchant's location, or deleting at least one unassigned order farthest from the merchant's location. Preferably, the preset deletion principle can follow the principle of giving priority to the long distance, that is, the preset deletion principle is to delete at least one order closest to the merchant's location. Among them, the principle of giving priority to the long distance is: for orders that are farther and more concentrated, one rider should be arranged for delivery as much as possible. Therefore, if at least one order farthest from the merchant's location is deleted, multiple orders farthest from the merchant will be assigned to different delivery persons, resulting in an increase in delivery costs.

[0121] For example, attachedFigure 4 In the example shown, order1, order2, order3, order4, and order5 are orders in the order aggregation cluster obtained by aggregation grouping (i.e., the order cluster on the left side that is on the same route), and the numbers in order1, order2, order3, order4, and order5 represent the amounts of the corresponding orders. Since the number of orders in the order aggregation cluster, which is 5, is greater than the quantity threshold of 3, and the total amount of the orders in the order aggregation cluster, which is 780, is greater than the amount threshold of 600, order5 and order4, which are the closest to the merchant's location, are successively deleted, resulting in the order aggregation cluster on the right side. The remaining number of orders, which is 3 for order1, order2, and order3, is not greater than the quantity threshold of 3, and the total amount, which is 480, is not greater than the amount threshold of 600. Therefore, the order aggregation cluster on the right side is assigned to a single delivery person for delivery. Figure 4 By using the quantity threshold and the amount threshold to determine whether the orders in the order cluster on the same route exceed the delivery capacity of the delivery person, it is possible to ensure that the orders assigned to the delivery person can fully utilize the delivery capacity of the delivery person while avoiding exceeding the delivery capacity and causing low delivery efficiency. Figure 4 As another example, this step can be executed in the manner shown in the appendix, including sub-steps S1031 to S1033. Figure 4 In sub-step S1031, for each delivery person, based on the current delivery route of the delivery person and the order locations of multiple unassigned orders, the convenience coefficient of each unassigned order is determined. Here, the convenience coefficient is used to characterize the deviation angle and / or the moving distance after adding the unassigned order to the current delivery route, and the current delivery route includes a route formed by at least one sequence of order locations arranged in order.

[0122] The smaller the deviation angle, the more convenient the unassigned order is with the current delivery route; the larger the deviation angle, the less convenient the unassigned order is with the current delivery route. The smaller the moving distance, the more convenient the unassigned order is with the current delivery route; the larger the moving distance, the less convenient the unassigned order is with the current delivery route.

[0123] Figure 5 Figure 5 shown in the appendix, including sub-steps S1031 to S1033.

[0124]

[0125]

[0126]

[0126] It should be understood that the current delivery route is the delivery route of the delivery person at present, that is, the delivery route when the method is executed, and the current delivery route will be updated each time orders are combined. The location of the first order in the delivery route can be obtained in advance in the following manner: in response to the delivery person having no delivery route, according to the order locations of the multiple unassigned orders, the order location of the unassigned order closest to the merchant location among the multiple unassigned orders is determined as the location of the first order in the delivery route of the delivery person. This can ensure that each delivery person can generate a delivery route, and the starting point of the delivery route is as close as possible to the merchant location, thereby reducing the delivery cost.

[0127] Exemplarily, this step is executed in the manner shown in the appendix Figure 6 and includes sub-steps S10311 to sub-step S10312.

[0128] In sub-step S10311, for any unassigned order, determine the convenient angle and / or convenient distance of the unassigned order, where the convenient angle is the angle between a first direction and a second direction, the first direction is the direction from the penultimate order location or the merchant location in the current delivery route to the last order location, the second direction is the direction from the last order location to the order location of the unassigned order, and the convenient distance is the distance between the last order location and the order location of the unassigned order.

[0129] For example, in response to the number of order locations in the current delivery route being greater than or equal to 1, determine the convenient angle and the convenient distance. It should be understood that if the number of order locations in the current delivery route is 1, then determine the direction from the merchant to this order location as the first direction, and determine the direction from this order location to the order location of the undelivered order as the second direction. If the number of order locations in the current delivery route is greater than 1, then determine the direction from the penultimate order location to the last order location as the first direction, and determine the direction from the last order location to the order location of the undelivered order as the second direction. Please refer to the example shown in the appendix Figure 7 When the hollow circle is the merchant, order1 is the order location in the current delivery route, and order2 is the order location of the unassigned order, α 2,1 is the convenient angle; when order1 and order2 are the order locations in the current delivery route and order3 is the order location of the unassigned order, α 3,2 is the convenient angle.

[0130] The above two examples respectively correspond to different scenarios of the number of order locations in the current delivery route, so that in the complete process of allocating orders to the delivery person, the most suitable unassigned order can be selected and added to the delivery route, thereby improving the adaptability of the method.

[0131] In sub-step S10312, according to the included angle and / or the detour distance of the unassigned order, determine the detour coefficient of the unassigned order.

[0132] For example, if the included angle is determined in sub-step S10311, then in this step, the detour coefficient is determined according to the included angle. For example, the included angle is used as the detour coefficient.

[0133] For example, if the detour distance is determined in sub-step S10311, then in this step, the detour coefficient is determined according to the detour distance. For example, the detour distance is used as the detour coefficient.

[0134] For example, if the included angle and the detour distance are determined in sub-step S10311, then in this step, the detour coefficient is determined according to the included angle and the detour distance. For example, the product of the included angle and the detour distance is determined as the detour coefficient.

[0135] The above method for determining the detour system can make the detour coefficient proportional to both the detour angle and the detour distance, so that the detour coefficient is inversely proportional to the degree of being on the way. That is, the smaller the included angle, the more consistent the driving direction to the unassigned order is with the driving direction of its previous section of the path, and the more on the way the unassigned order is; the smaller the detour distance, the more on the way it is; therefore, the smaller the detour coefficient, the more on the way it is.

[0136] It should be understood that if the included angle is too large, it will cause waste of the journey such as turning back of the driving direction. For example, when the included angle is greater than 90°, there will be a journey turn-back. Therefore, unassigned orders with too large included angles are not suitable to be added to the current distribution path. If the included angle is too small, no matter how large the detour distance is, the detour coefficient will be relatively small. This will cause unassigned orders with too small included angles and too large detour distances to be added to the current delivery path in the subsequent steps. Obviously, this does not conform to the principle of being on the way for order allocation. Therefore, unassigned orders with too small included angles cannot simply use the above method to determine the detour coefficient. For example, in the example shown in Figure 8 In the example shown, order1 and order2 are the last two order positions in the current delivery path, and order3 and order4 are the order positions of unassigned orders. If the detour coefficient is directly determined according to the above method, the detour coefficient of order4 approaches 0 (because the included angle approaches 0). Therefore, order4 will be added as the next order position to the current delivery path. However, it is obvious that order3 is more on the way relative to the current delivery path because the distance is relatively close.

[0137] Based on the above analysis, execution conditions can be added to the above-described method for determining the convenience coefficient. For example, in response to the convenience angle being less than or equal to a first angle threshold and greater than or equal to a second angle threshold, the product of the convenience angle and the convenience distance is determined as the convenience coefficient. This avoids adding unassigned orders with overly large or overly small convenience angles to the current delivery route, making the orders added to the current delivery route comply with the convenience principle of order allocation.

[0138] Correspondingly, in response to the convenience angle being greater than the first angle threshold, the convenience coefficient can be determined to be infinite, thereby avoiding adding the corresponding unassigned order to the current allocation route. Preferably, the first angle threshold can be 90°. This can avoid adding unassigned orders with overly large convenience angles to the current allocation route, which violates the convenience principle of order allocation, thereby further improving the convenience degree of order allocation.

[0139] Correspondingly, in response to the convenience angle being less than the second angle threshold, the product of the second angle threshold and the convenience distance is determined as the convenience coefficient. This avoids adding unassigned orders with overly large convenience distances due to overly small convenience angles to the current allocation route, further improving the convenience degree of order allocation. Preferably, the second angle threshold can be 10°.

[0140] The above-attached Figure 6 The method shown combines the convenience angle and / or the convenience distance to determine the convenience coefficient, so that the convenience coefficient can more accurately represent the deviation angle and / or the moving distance after the unassigned order is added to the current delivery route, that is, it can more accurately represent the convenience degree of the unassigned order relative to the current delivery route, thereby improving the convenience degree of order allocation.

[0141] In sub-step S1032, according to the convenience coefficient of each unassigned order, a target order is determined among the multiple unassigned orders, and the location of the target order is added to the current delivery route to obtain a combined order route.

[0142] Exemplarily, the unassigned order with the smallest convenience coefficient among the multiple unassigned orders is determined as the target order. Thus, the location of the unassigned order that is most convenient for the current delivery route can be added to the current allocation route, thereby maximizing the satisfaction of the convenience principle of order allocation.

[0143] Please refer to the attached Figure 9 In the example shown, order1 and order2 are the last two order locations in the current delivery route, and order3 and order4 are the order locations of unassigned orders. The convenience angle α of order3 relative to the current delivery route can be determined respectively 3,2, the convenient distance d 3,2 , and the convenient angle α of order4 relative to the current delivery route 4,2 , the convenient distance d 4,2 , and then determine the convenience coefficient k of order3 relative to the current delivery route 3,2 =α 3,2 *d 3,2 , and the convenience coefficient k of order4 relative to the current delivery route 4,2 =α 4,2 *d 4,2 ; Finally, determine the order with the smaller convenience coefficient among order3 and order4 as the target order, and add the corresponding order location to the current delivery route. It can be seen that this method synchronously plans the delivery route of the delivery personnel during the order allocation process.

[0144] In sub-step S1033, in response to the combined order route meeting the preset requirements, determine the orders to which all order locations in the combined order route belong as the order convenient cluster and allocate them to the delivery personnel.

[0145] Exemplarily, the preset requirements include: the number of orders to which all order locations in the combined order route belong is greater than the quantity threshold; or, the amount of the orders to which all order locations in the combined order route belong is greater than the amount threshold. That is, if: the number of orders to which all order locations in the combined order route belong is greater than the quantity threshold; or, the amount of the orders to which all order locations in the combined order route belong is greater than the amount threshold; then: determine the orders to which all order locations in the combined order route belong as the order convenient cluster and allocate them to the delivery personnel. The above preset requirements can make the convenient order cluster allocated to the delivery personnel fully utilize the delivery capacity of the delivery personnel and avoid excessively exceeding the delivery capacity of the delivery personnel, resulting in low delivery efficiency.

[0146] It should also be understood that if the combined order route does not meet the preset conditions, the current delivery route of the delivery personnel can be updated to the combined order route, and then continue to perform order combination in the manner shown in the appendix. Figure 5 shown.

[0147] Appendix Figure 5 The method for determining the convenient order cluster shown can not only identify multiple orders that are conveniently located in a straight line as shown in the appendix Figure 10 shown, but also identify multiple orders that are conveniently located in a curve as shown in the appendix Figure 11 shown, that is, it can more accurately identify conveniently located orders and improve the rationality of order allocation; furthermore, this method selects the most convenient orders to add to the route based on the current delivery route, so that the delivery route can be planned while identifying conveniently located orders, improving the efficiency and convenience degree of route planning. Appendix Figure 9 , 10In the figure, the hollow circle indicates the location of the merchant corresponding to the order, and the 5 solid circles indicate the order locations of the 5 orders.

[0148] According to the above embodiments, it can be known that the multiple orders can be clustered and grouped according to their order positions in the polar coordinate system to obtain at least one order cluster and / or multiple unassigned orders, and when at least one order cluster is obtained, each order cluster in the at least one order cluster is assigned to a delivery personnel, and when multiple unassigned orders are obtained, the multiple unassigned orders are grouped along the way according to their order positions, and each of the obtained order clusters is assigned to a delivery personnel. The method utilizes the order positions in the polar coordinate system to cluster and group multiple orders, that is, orders that are close in distance are divided into an order cluster and assigned to a delivery person for delivery, and it is determined whether the orders that have not entered the order cluster are on the way, and the orders that are on the way are divided into an order on the way cluster and assigned to a delivery person for delivery. Through clustering and on-the-way grouping, the multiple orders obtained by each delivery person can be close in distance and / or on the way, which can enable each delivery person to complete the delivery in a shorter distance, that is, reducing the delivery cost of multiple orders; and the clustering and grouping are performed based on the order positions in the polar coordinate system. Compared with clustering and grouping using horizontal coordinates, it can reduce the amount of calculation, improve the calculation efficiency, and thus improve the efficiency of order allocation.

[0149] At least one embodiment of the present disclosure provides an order allocation method, which can be applied to a delivery service system, such as a food delivery system, an express delivery system, etc., so that the delivery service system can identify whether the orders are on the same route when allocating orders to delivery personnel, thereby allocating multiple on-the-way orders to the same delivery personnel for delivery, thereby improving delivery efficiency and utilization of delivery manpower.

[0150] Exemplarily, this method is particularly suitable for the scenario of allocating multiple orders from the same merchant, in which the source locations of the multiple orders are the same but the target locations are different. If the multiple orders along the way are allocated to the same delivery person, the delivery person can pick up the delivery items of the multiple orders from the source location at one time, and deliver the delivery items to the target locations of the multiple orders in sequence. The source location can be the pickup location of the delivery items in the order, such as the location of the restaurant where the food is picked up for a takeaway order, and the target location can be the delivery location of the order, such as the delivery address, or the collection point corresponding to the delivery address, etc.

[0151] Please refer to the attached Figure 12 , which exemplarily shows the process of the order allocation method, including step S1201 to step S1202.

[0152] In step S1201, according to the current delivery route of the delivery staff and the order locations of multiple unassigned orders, the convenience coefficient of each unassigned order is determined, where the convenience coefficient is used to characterize the deviation angle and / or moving distance after adding the unassigned order to the current delivery route, and the current delivery route includes a route formed by at least one sequence of order locations arranged in sequence;

[0153] In step S1202, according to the convenience coefficient of each unassigned order, a target order is determined among the multiple unassigned orders, and the order location of the target order is added to the current delivery route.

[0154] It should be understood that the method shown in the appendix Figure 12 can be executed with reference to sub-step S1031 and sub-step S1032 shown in the appendix Figure 5 Therefore, the details of the above steps S1201 and S1202 will not be repeated here. Next, a specific example will be used to introduce the complete process of this method in detail. In this method, the first angle threshold is 90°, the second angle threshold is 10°, and the quantity threshold is 4.

[0155] Please refer to the appendix Figure 13 to the appendix Figure 16 , the hollow circles are the locations of the merchants targeted by this method, and order1, order2, order3, order4, order5, order6, order7 are the order locations of all unassigned orders of this merchant.

[0156] Please refer to the appendix Figure 13 , respectively determine the convenient distances between order1, order2, order3, order4, order5, order6, order7 and the merchant, and select order1 with the smallest convenient distance as the first order in the delivery route of this delivery staff.

[0157] Please refer to the appendix Figure 14 , respectively determine the convenient angles and convenient distances between order2, order3, order4, order5, order6, order7 and the current delivery route (i.e., order1) of this delivery staff. The results are shown in Table 1 below. The convenient angle of order3 is less than the second angle threshold, so the convenient angle actually used to calculate the convenience coefficient is the second angle threshold. The convenient angle of order7 is greater than the first angle threshold, so the convenient angle actually used to calculate the convenience coefficient is positive infinity. Select order5 with the smallest convenience coefficient and add it to the current delivery route.

[0158] Please refer to the appendix Figure 15, continue to select order4 and order3 with the smallest convenience coefficient and add them to the delivery route. Since the quantity threshold of 4 is reached, order1, order5, order4, and order3 can be used as the delivery route of the delivery staff, that is, the route shown in Figure 16 the attached figure.

[0159] One or more embodiments of the present disclosure also provide an order allocation device. Please refer to the attached Figure 17 . The device includes:

[0160] An aggregation grouping module 1701, configured to perform aggregation grouping on the multiple orders according to the order positions of the multiple orders in the polar coordinate system, and obtain an aggregation result, where the aggregation result includes at least one order aggregation cluster and / or multiple unallocated orders, and the order aggregation cluster includes at least two orders;

[0161] A first allocation module 1702, configured to, in response to the aggregation result including at least one order aggregation cluster, allocate each order aggregation cluster in the at least one order aggregation cluster to a delivery staff;

[0162] A second allocation module 1703, configured to, in response to the aggregation result including multiple unallocated orders, perform convenience grouping on the multiple unallocated orders according to the order positions of the multiple unallocated orders, and allocate each obtained order convenience cluster to a delivery staff, where the order convenience cluster includes at least one unallocated order.

[0163] In an embodiment of the present disclosure, the aggregation grouping module is configured to:

[0164] Sequentially determine each unclustered order as a reference order in a preset order;

[0165] For each reference order, determine the orders that fall within the reference polar radius range of the reference order and fall within the reference polar angle range of the reference order as an order aggregation cluster, where the reference polar radius range is a range determined according to the polar radius of the reference order, and the reference polar angle range is a range determined according to the polar angle of the reference order.

[0166] In an embodiment of the present disclosure, the device further includes a first deletion module, configured to:

[0167] In response to the number of orders within the order aggregation cluster being greater than a quantity threshold or the amount of orders within the order aggregation cluster being greater than an amount threshold, at least one order is deleted from the order aggregation cluster according to a preset deletion principle, so that the number of orders within the order aggregation cluster is not greater than the quantity threshold and the amount of orders within the order aggregation cluster is not greater than the amount threshold, where the preset deletion principle includes deleting at least one order closest to the merchant's location or deleting at least one order farthest from the merchant's location.

[0168] In one embodiment of the present disclosure, the second allocation module is configured to:

[0169] Sequentially determine each unassigned order that has not been clustered as a reference order in a preset order;

[0170] For each reference order, determine an order along-the-way cluster for the unassigned orders that fall within the reference polar angle range of the reference order, and allocate the order along-the-way cluster to a delivery person, where the reference polar angle range is a range determined according to the polar angle of the reference order.

[0171] In one embodiment of the present disclosure, the device further includes a second deletion module, configured to:

[0172] In response to the number of unassigned orders within the order along-the-way cluster being greater than a quantity threshold or the amount of unassigned orders within the order along-the-way cluster being greater than an amount threshold, at least one unassigned order is deleted from the order along-the-way cluster according to a preset deletion principle, so that the number of unassigned orders within the order along-the-way cluster is not greater than the quantity threshold and the amount of unassigned orders within the order along-the-way cluster is not greater than the amount threshold, where the preset deletion principle includes deleting at least one unassigned order closest to the merchant's location or deleting at least one unassigned order farthest from the merchant's location.

[0173] In one embodiment of the present disclosure, the second allocation module is configured to:

[0174] For each delivery person, determine the along-the-way coefficient of each unassigned order according to the current delivery path of the delivery person and the order locations of multiple unassigned orders, where the along-the-way coefficient is used to characterize the offset angle and / or moving distance after adding the unassigned order to the current delivery path, and the current delivery path includes a path formed by at least one order location arranged in sequence;

[0175] According to the along-the-way coefficient of each unassigned order, determine a target order among the multiple unassigned orders, and add the order location of the target order to the current delivery path to obtain a combined order path;

[0176] In response to the fact that the order-merging path meets preset requirements, the orders belonging to all order locations in the order-merging path are determined as an order en route cluster and allocated to the delivery personnel.

[0177] In one embodiment of the present disclosure, the second allocation module is used to:

[0178] For any unassigned order, determine the enroute angle and / or enroute distance of the unassigned order, wherein the enroute angle is the angle between a first direction and a second direction, the first direction is the direction from the second-to-last order location or merchant location in the current delivery path to the last order location, the second direction is the direction from the last order location to the order location of the unassigned order, and the enroute distance is the distance between the last order location and the order location of the unassigned order;

[0179] The en-route coefficient of the unassigned order is determined according to the en-route angle and / or the en-route distance of the unassigned order.

[0180] In one embodiment of the present disclosure, the second allocation module is used to:

[0181] In response to the fact that the en-route angle is less than or equal to a first angle threshold and the en-route angle is greater than or equal to a second angle threshold, the product of the en-route angle and the en-route distance is determined as the en-route coefficient.

[0182] In one embodiment of the present disclosure, the second allocation module is used to:

[0183] In response to the en-route angle being greater than a first angle threshold, the en-route coefficient is determined to be infinite.

[0184] In one embodiment of the present disclosure, the second allocation module is used to:

[0185] In response to the stop-over angle being smaller than a second angle threshold, a product of the second angle threshold and the stop-over distance is determined as the stop-over coefficient.

[0186] In one embodiment of the present disclosure, the device further includes a path construction module, which is used to:

[0187] In response to the delivery personnel not having a delivery path, based on the order locations of the multiple unassigned orders, the order location of the unassigned order among the multiple unassigned orders that is closest to the merchant location is determined as the first order location in the delivery path of the delivery personnel.

[0188] In one embodiment of the present disclosure, the preset requirements include:

[0189] and the number of orders to which all order positions in the combined order path belong is greater than a quantity threshold; or,

[0190] and the amount of orders to which all order positions in the combined order path belong is greater than an amount threshold.

[0191] One or more embodiments of the present disclosure also provide an order allocation device. Please refer to the appendix Figure 18 , the device includes:

[0192] A coefficient module 1801, configured to determine a convenience coefficient for each unallocated order according to the current delivery path of the delivery personnel and the order positions of a plurality of unallocated orders, where the convenience coefficient is used to characterize the offset angle and / or moving distance after adding the unallocated order to the current delivery path, and the current delivery path includes a path formed by at least one sequentially arranged order position;

[0193] A third allocation module 1802, configured to determine a target order among the plurality of unallocated orders according to the convenience coefficient of each unallocated order, and add the order position of the target order to the current delivery path.

[0194] At least one embodiment of the present disclosure also provides a device. Please refer to the appendix Figure 19 , which shows the structure of the device. The device includes a memory and a processor. The memory is used to store computer instructions that can run on the processor, and the processor is used to process orders based on the method described in the first aspect when executing the computer instructions.

[0195] At least one embodiment of the present disclosure also provides a computer-readable storage medium, on which a computer program is stored, and when the program is executed by a processor, the method described in the first aspect is implemented.

[0196] In the present disclosure, the terms "first" and "second" are only used for descriptive purposes and cannot be construed as indicating or implying relative importance. The term "plurality" means two or more, unless otherwise clearly defined. Those skilled in the art will readily think of other embodiments of the present disclosure after considering the specification and practicing the disclosure herein. The present disclosure is intended to cover any variations, uses, or adaptations of the present disclosure, which follow the general principles of the present disclosure and include common general knowledge or conventional technical means in the technical field not disclosed in the present disclosure. The specification and embodiments are only regarded as exemplary, and the true scope and spirit of the present disclosure are pointed out by the following claims. It should be understood that the present disclosure is not limited to the exact structures already described and shown in the drawings, and various modifications and changes can be made without departing from its scope. The scope of the present disclosure is only limited by the appended claims.

Claims

1. An order allocation method, characterized in that, The method includes: Grouping the multiple orders in a polar coordinate system according to the order positions of the multiple orders in the polar coordinate system to obtain an aggregation result, where the aggregation result includes at least one order aggregation cluster and / or multiple unassigned orders, and the order aggregation cluster includes at least two orders; In response to the aggregation result including at least one order aggregation cluster, assigning each order aggregation cluster in the at least one order aggregation cluster to a delivery person; In response to the aggregation result including multiple unassigned orders, grouping the multiple unassigned orders according to the order positions of the multiple unassigned orders and assigning each obtained order along-the-way cluster to a delivery person, where the order along-the-way cluster includes at least one unassigned order.

2. The order allocation method according to claim 1, wherein The grouping the multiple orders in a polar coordinate system according to the order positions of the multiple orders in the polar coordinate system to obtain an aggregation result includes: Sequentially determining each unclustered order as a reference order in a preset order; For each reference order, determining the orders that fall within the reference polar radius range of the reference order and fall within the reference polar angle range of the reference order as an order aggregation cluster, where the reference polar radius range is a range determined according to the polar radius of the reference order, and the reference polar angle range is a range determined according to the polar angle of the reference order.

3. The order allocation method according to claim 2, wherein The method further includes: In response to the number of orders in the order aggregation cluster being greater than a quantity threshold or the amount of orders in the order aggregation cluster being greater than an amount threshold, deleting at least one order from the order aggregation cluster according to a preset deletion principle so that the number of orders in the order aggregation cluster is not greater than the quantity threshold and the amount of orders in the order aggregation cluster is not greater than the amount threshold, where the preset deletion principle includes deleting at least one order closest to the merchant location or deleting at least one order farthest from the merchant location.

4. The order allocation method according to claim 1, wherein The grouping the multiple unassigned orders according to the order positions of the multiple unassigned orders and assigning each obtained order along-the-way cluster to a delivery person includes: Sequentially determining each unclustered unassigned order as a reference order in a preset order; For each reference order, determining the unassigned orders that fall within the reference polar angle range of the reference order as an order along-the-way cluster and assigning the order along-the-way cluster to a delivery person, where the reference polar angle range is a range determined according to the polar angle of the reference order.

5. The order allocation method according to claim 4, characterized in that, The method further includes: In response to the number of unassigned orders in the order along-the-way cluster being greater than a quantity threshold or the amount of unassigned orders in the order along-the-way cluster being greater than an amount threshold, deleting at least one unassigned order from the order along-the-way cluster according to a preset deletion principle so that the number of unassigned orders in the order along-the-way cluster is not greater than the quantity threshold and the amount of unassigned orders in the order along-the-way cluster is not greater than the amount threshold, where the preset deletion principle includes deleting at least one unassigned order closest to the merchant location or deleting at least one unassigned order farthest from the merchant location.

6. The order allocation method according to claim 1, wherein Grouping the multiple unassigned orders according to the order locations of the multiple unassigned orders and assigning each obtained order route cluster to a delivery person, including: For each delivery person, determine the convenience coefficient of each unassigned order according to the current delivery route of the delivery person and the order locations of the multiple unassigned orders, where the convenience coefficient is used to characterize the deviation angle and / or moving distance after adding the unassigned order to the current delivery route, and the current delivery route includes a route formed by at least one sequentially arranged order location; Determine a target order among the multiple unassigned orders according to the convenience coefficient of each unassigned order, and add the order location of the target order to the current delivery route to obtain a combined order route; In response to the combined order route meeting the preset requirements, determine the orders to which all the order locations in the combined order route belong as an order route cluster and assign it to the delivery person.

7. The order allocation method according to claim 6, wherein The determining the convenience coefficient of each unassigned order according to the current delivery route of the delivery person and the order locations of the multiple unassigned orders includes: For any one unassigned order, determine the convenience angle and / or convenience distance of the unassigned order, where the convenience angle is the angle between a first direction and a second direction, the first direction is the direction from the penultimate order location or the merchant location in the current delivery route to the last order location, the second direction is the direction from the last order location to the order location of the unassigned order, and the convenience distance is the distance between the last order location and the order location of the unassigned order; Determine the convenience coefficient of the unassigned order according to the convenience angle and / or convenience distance of the unassigned order.

8. The order allocation method according to claim 7, characterized in that, The determining the convenience coefficient of the unassigned order according to the convenience angle and / or convenience distance of the unassigned order includes: In response to the convenience angle being less than or equal to a first angle threshold and greater than or equal to a second angle threshold, determine the product of the convenience angle and the convenience distance as the convenience coefficient.

9. The order allocation method according to claim 7, characterized in that The determining the convenience coefficient of the unassigned order according to the convenience angle and / or convenience distance of the unassigned order includes: In response to the convenience angle being greater than the first angle threshold, determine the convenience coefficient to be infinity.

10. The order allocation method according to claim 7, characterized in that The determining the convenience coefficient of the unassigned order according to the convenience angle and / or convenience distance of the unassigned order includes: In response to the convenience angle being less than the second angle threshold, determine the product of the second angle threshold and the convenience distance as the convenience coefficient.

11. The order allocation method according to claim 6, characterized in that, The method further includes: In response to the delivery person having no delivery route, determine the order location of the unassigned order closest to the merchant location among the multiple unassigned orders as the first order location in the delivery route of the delivery person according to the order locations of the multiple unassigned orders.

12. The order allocation method according to claim 6, wherein The preset requirements include: The number of orders to which all the order locations in the combined order route belong is greater than a quantity threshold; or, And the amount of the orders to which all the order positions in the single path belong is greater than the amount threshold.

13. An order allocation method, characterized in that, The method includes: Determining a convenience coefficient for each unassigned order according to the current delivery path of the delivery person and the order positions of multiple unassigned orders, where the convenience coefficient is used to characterize the deviation angle and / or moving distance after adding the unassigned order to the current delivery path, and the current delivery path includes a path formed by at least one sequentially arranged order position; Determining a target order among the multiple unassigned orders according to the convenience coefficient of each unassigned order, and adding the order position of the target order to the current delivery path.

14. An order allocation device, characterized in that, The device includes: An aggregation grouping module, configured to perform aggregation grouping on the multiple orders according to the order positions of the multiple orders in the polar coordinate system to obtain an aggregation result, where the aggregation result includes at least one order aggregation cluster and / or multiple unassigned orders, and the order aggregation cluster includes at least two orders; A first allocation module, configured to, in response to the aggregation result including at least one order aggregation cluster, allocate each order aggregation cluster in the at least one order aggregation cluster to a delivery person; A second allocation module, configured to, in response to the aggregation result including multiple unassigned orders, perform convenience grouping on the multiple unassigned orders according to the order positions of the multiple unassigned orders, and allocate each obtained order convenience cluster to a delivery person, where the order convenience cluster includes at least one unassigned order.

15. An order allocation device, characterized in that, The device includes: A coefficient module, configured to determine a convenience coefficient for each unassigned order according to the current delivery path of the delivery person and the order positions of multiple unassigned orders, where the convenience coefficient is used to characterize the deviation angle and / or moving distance after adding the unassigned order to the current delivery path, and the current delivery path includes a path formed by at least one sequentially arranged order position; A third allocation module, configured to determine a target order among the multiple unassigned orders according to the convenience coefficient of each unassigned order, and add the order position of the target order to the current delivery path.

16. An electronic device, characterized in that, The device includes a memory and a processor, the memory is used to store computer instructions that can be run on the processor, and the processor is used to implement the method according to any one of claims 1 to 13 when executing the computer instructions.

17. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the program is executed by the processor, it implements the method according to any one of claims 1 to 13.

Images