CN111340413A

CN111340413A - Distribution method, distribution device, server and storage medium of distribution tasks

Info

Publication number: CN111340413A
Application number: CN202010085322.6A
Authority: CN
Inventors: 李承波
Original assignee: Lazas Network Technology Shanghai Co Ltd
Current assignee: Lazas Network Technology Shanghai Co Ltd
Priority date: 2020-02-10
Filing date: 2020-02-10
Publication date: 2020-06-26

Abstract

The embodiment of the invention relates to the technical field of information processing, and discloses a distribution method, a distribution device, a distribution server and a storage medium of distribution tasks.

Description

Distribution method, distribution device, server and storage medium of distribution tasks

Technical Field

The embodiment of the invention relates to the technical field of information processing, in particular to a distribution method and device of distribution tasks, a server and a storage medium.

Background

When orders are dispatched and distributed, some orders are distributed after being delayed according to the current scene state, the strategy is called to press orders, and the orders are pressed if the rider is insufficient, the orders are excessive, the order time is sufficient, the peak time is short, and the like. In an actual situation, when a plurality of orders are distributed at the same time, if some orders do not meet a preset distribution strategy, the orders are distributed later, so that the situation of passive ordering is caused.

The inventors found that at least the following problems exist in the related art: in the current distribution mode of the distribution tasks, the phenomenon of passive delayed distribution can occur when the distribution pressure is high, the delay time of the passive delayed distribution is uncertain, and the overstocked distribution tasks can be caused, so that the distribution efficiency and the distribution efficiency of the task instructions to be distributed are reduced, and the service quality is further influenced.

Disclosure of Invention

The invention aims to provide a distribution method, a distribution device, a server and a storage medium of distribution tasks, which adopt a mode of carrying out path planning and simulation on task instructions to be distributed and distribution resources to judge whether the current mode of carrying out optimal distribution on all the task instructions to be distributed is suitable for active delay distribution or not, and avoid the situation of passive delay distribution through the active delay distribution, thereby solving the problem of a large amount of overstocked task instructions to be distributed caused by the passive delay distribution, improving the distribution efficiency of the task instructions to be distributed and further improving the service quality.

In order to solve the technical problem, an embodiment of the invention provides a distribution method of distribution tasks, which comprises the steps of receiving instructions from each client to obtain an instruction set of the client, analyzing the instruction set through at least one processor to obtain M to-be-distributed task instructions in the instruction set, wherein M is a natural number larger than 0, carrying out distribution task path planning and simulation on the M to-be-distributed task instructions and N distribution resources through at least one processor to obtain a pre-distribution matrix of M × N, wherein an element L (i, j) in the pre-distribution matrix represents the matching score of the ith to-be-distributed task instruction and the jth distribution resource, N is a natural number larger than 0, i is smaller than or equal to M, and j is smaller than or equal to N, combining the pre-distribution matrix through at least one processor to obtain the optimal distribution result of each to-be-distributed task instruction, the optimal distribution result is the matching of the to-be-distributed task instruction corresponding to the N distribution resources, the highest matching score is the highest matching score of the to-be-distributed task instruction, and the optimal distribution result is suitable for delayed distribution of the to-be-distributed tasks after the optimal distribution instruction exists in the M to be distributed.

The embodiment of the invention also provides a distribution device of distribution tasks, which comprises an acquisition module, an analysis module, a pre-distribution matrix acquisition module, a distribution module and a distribution module, wherein the acquisition module is used for receiving instructions from each client to obtain an instruction set of the client, the analysis module is used for analyzing the instruction set to obtain M to-be-distributed task instructions in the instruction set, M is a natural number larger than 0, the pre-distribution matrix acquisition module is used for carrying out distribution task path planning and simulation on the M to-be-distributed task instructions and N distribution resources to obtain a pre-distribution matrix of M × N, an element L (i, j) in the pre-distribution matrix represents the matching score of the ith to-be-distributed task instruction and the jth distribution resource, N is a natural number larger than 0, i is smaller than or equal to M, and j is smaller than or equal to N, the distribution module is used for acquiring the optimal distribution result of each to-be-distributed task instruction in combination with the pre-distribution matrix, the optimal distribution result is the distribution result of the to-distributed task instruction corresponding to the N distribution resources, the highest matching score is the optimal distribution result, and the optimal distribution result of the to-distributed task instructions is not suitable for delayed distribution after the optimal distribution instruction is distributed.

The embodiment of the invention also provides electronic equipment which comprises a memory and a processor, wherein the memory stores a computer program, the processor executes the program when running the program, receives instructions from each client to obtain an instruction set of the client, analyzes the instruction set by at least one processor to obtain M to-be-distributed task instructions in the instruction set, M is a natural number larger than 0, performs distribution task path planning and simulation on the M to-be-distributed task instructions and N distribution resources by at least one processor to obtain a pre-distribution matrix of M × N, an element L (i, j) in the pre-distribution matrix represents the matching score of the ith to-be-distributed task instruction and the jth distribution resource, N is a natural number larger than 0, i is smaller than or equal to M, j is smaller than or equal to N, obtains the optimal distribution result of each to-be-distributed task instruction by combining the pre-distribution matrix, and judges whether the optimal distribution result of the optimal distribution instruction in the pre-distribution matrix is suitable for delayed distribution of the to-be-distributed task after the optimal distribution result is suitable for delayed distribution of the task to be delayed distribution of the task instructions.

The invention also provides a non-volatile storage medium for storing a computer readable program, and the computer readable program is executed by a processor to realize the distribution method of the distribution tasks.

Compared with the prior art, the implementation mode of the invention has the advantages that the task instruction to be distributed in the instructions of each client is obtained, the simulation of the distribution task path planning is carried out on the task instruction to be distributed and the distribution resources, the matching score of the task instruction to be distributed and the distribution resources is obtained, whether the task instruction to be distributed is distributed to the corresponding distribution resources currently can be reflected through the matching score, the matching score is specifically reflected in a pre-distribution matrix, whether the task instruction to be distributed has a task suitable for delayed distribution or not is judged by combining the pre-distribution matrix, the active ordering is carried out on the task instruction suitable for delayed distribution, the delayed distribution is carried out on the order by adopting the active ordering mode, the time of the delayed distribution is controllable, and the problem of large-amount of accumulated orders caused by the passive ordering is avoided; meanwhile, the order distribution time is optimized while the order is distributed, so that the order distribution efficiency is integrally improved, and the service quality is optimized.

In addition, the following steps are repeated through at least one processor until the judgment whether the M task instructions to be distributed are suitable for delayed distribution is completed, whether the ith task instruction to be distributed is suitable for delayed distribution is judged according to the optimal distribution result of the ith task instruction to be distributed, M is updated to be M-1, i is updated to be i +1, the route planning and simulation of the distribution tasks are carried out on the updated M task instructions to be distributed and the N distribution resources, an updated M × N pre-distribution matrix is obtained, and after whether the task instructions to be distributed suitable for delayed distribution exist in the M task instructions to be distributed, the task instructions to be distributed suitable for delayed distribution are subjected to delayed distribution.

In addition, detecting whether the ith task instruction to be distributed belongs to a distribution peak task or not according to distribution information of distribution resources corresponding to the ith task instruction to be distributed; and if the ith task instruction to be distributed belongs to the distribution peak task, judging the ith task instruction to be distributed as a task instruction to be distributed suitable for delayed distribution.

In addition, if the ith task instruction to be allocated meets any one of the following conditions, the ith task instruction to be allocated is judged to belong to the delivery peak task: the number of the distributed resources is lower than a first preset value, the distribution pressure of the distributed resources exceeds a second preset value, the number of the task instructions to be distributed carried by the current distributed resources exceeds a third preset value, and the dining time of the distributed resources exceeds a fourth preset value. Judging whether the distribution resources are in a distribution peak or not, and if the rider is in the distribution peak, judging the order to be distributed to the rider as a distribution peak task; when the dispatching peak is in the dispatching peak, the dispatching time of the task instruction to be dispatched is reasonably planned through judging the characteristics of the dispatching resources, so that the dispatching resources can be orderly dispatched to the task instruction to be dispatched, the dispatching efficiency of the dispatching resources is improved, and the service quality is optimized.

In addition, detecting whether the ith task instruction to be distributed belongs to a distribution timing task or not according to the distribution information of the ith task instruction to be distributed and the distribution information of the corresponding distribution resources and by combining the current time period; and if the ith task instruction to be distributed belongs to the distribution timing task, judging the ith task instruction to be distributed as a task instruction to be distributed suitable for delayed distribution.

In addition, if the ith task instruction to be allocated meets any one of the following conditions, the ith task instruction to be allocated is judged to belong to the delivery timing task: the time of the current distribution resource from the time of executing the task instruction to be distributed exceeds a fifth preset value, and the time of the current distribution resource reaching the meal taking place of the task instruction to be distributed in advance exceeds a sixth preset value. And analyzing according to the information of the distribution resources and the current time, judging whether more proper time exists for the task instruction to be distributed to the corresponding distribution resources, and then actively pressing the task instruction to be distributed, namely reasonably planning the distribution time of the task instruction to be distributed, thereby improving the distribution efficiency of the distribution resources.

In addition, detecting whether the ith task instruction to be distributed belongs to a distribution optimization task or not according to the distribution information of the ith task instruction to be distributed and the distribution information of the corresponding distribution resources and by combining the current scene state information; and if the ith task instruction to be distributed belongs to the distribution optimization task, judging the ith task instruction to be distributed as a task instruction to be distributed suitable for delayed distribution.

In addition, if the ith task instruction to be allocated meets any one of the following conditions, it is determined that the ith task instruction to be allocated belongs to the delivery optimization task: the matching score of the delayed allocation of the current distribution resource and the current task instruction to be allocated is higher than the matching score of the current distribution resource and the current task instruction to be allocated immediately, and the matching score of the current task instruction to be allocated and the other distribution resources delayed allocation is higher than the matching score of the current task instruction to be allocated and the current task instruction to be allocated immediately. Whether the task instruction to be distributed after the active list has better distribution resources is judged, or the current distribution resources after the active list can better distribute the task instruction to be distributed is judged, namely the distribution mode after the delayed distribution of the task instruction to be distributed is compared with the distribution mode according to the current distribution mode, the optimal distribution mode is selected to reasonably plan the distribution of the task instruction to be distributed, and therefore the distribution efficiency of the task instruction to be distributed is improved.

Drawings

Fig. 1 is a flowchart of an allocation method of delivery tasks according to a first embodiment of the present invention;

fig. 2 is a schematic view of scoring in the distribution method of delivery tasks according to the first embodiment of the present invention;

FIG. 3 is a flowchart illustrating a method for determining a first deferred allocation method according to a second embodiment of the present invention;

FIG. 4 is a flowchart illustrating a second delayed allocation method according to a second embodiment of the present invention;

FIG. 5 is a flowchart illustrating a third method for deferred allocation according to a second embodiment of the present invention;

FIG. 6 is a schematic view of a distribution device for distribution tasks according to a third embodiment of the present invention;

fig. 7 is a schematic structural diagram of an electronic device according to a fourth embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the embodiments of the present invention will be described in detail below with reference to the accompanying drawings. However, it will be appreciated by those of ordinary skill in the art that numerous technical details are set forth in order to provide a better understanding of the present application in various embodiments of the present invention. However, the technical solution claimed in the present application can be implemented without these technical details and various changes and modifications based on the following embodiments. The following embodiments are divided for convenience of description, and should not be construed as limiting the specific implementation of the present invention, and the embodiments may be combined with each other and referred to each other without contradiction.

The method comprises the steps of receiving instructions from each client to obtain an instruction set of the client, analyzing the instruction set through at least one processor to obtain M to-be-distributed task instructions in the instruction set, wherein M is a natural number larger than 0, carrying out route planning and simulation on the M to-be-distributed task instructions and N distribution resources through the at least one processor to obtain a pre-distribution matrix of M × N, wherein an element L (i, j) in the pre-distribution matrix represents the matching score of the ith to-be-distributed task instruction and the jth distribution resource, N is a natural number larger than 0, i is smaller than or equal to M, and j is smaller than or equal to N, combining the pre-distribution matrix through at least one processor to obtain the optimal distribution result of each to-be-distributed task instruction, the optimal distribution result is the matching score corresponding to the highest matching score in the matching of the ith to-be-distributed task instruction and the optimal distribution result is obtained by combining the pre-distribution matrix, whether the optimal distribution result of the to-be-distributed task instructions is suitable for the matching of the N distribution resources respectively, and whether the optimal distribution result of the to the order distribution is suitable for delaying distribution of the to the current distribution order distribution, and whether the optimal distribution is suitable for the order distribution, and the optimal distribution of the order distribution delay distribution results after the optimal distribution is carried out the optimal distribution delay distribution of the main distribution, the order distribution, the optimal distribution results, and the optimal distribution efficiency is judged by adopting the main distribution of the main distribution, and the main distribution results, so that the main distribution of the order distribution time distribution.

The following describes implementation details of a distribution task allocation method according to the present embodiment in detail, and the following is only provided for facilitating understanding of the implementation details and is not necessary for implementing the present embodiment.

A first embodiment of the present invention relates to a distribution method of distribution tasks, and a specific flow is shown in fig. 1, where the method includes:

step 101, receiving an instruction from a client.

And receiving instructions from each client to obtain an instruction set of the client. Specifically, the server receives instructions from a plurality of clients, and obtains an instruction set of the clients.

In one example, the instructions received by the server from the client may be: and the user submits the order through the ordering APP on the mobile terminal equipment such as a mobile phone or a tablet personal computer.

And 102, analyzing the instruction set to obtain a task instruction to be distributed.

Analyzing the instruction set through at least one processor, and acquiring M task instructions to be allocated in the instruction set, wherein M is a natural number greater than 0. Specifically, the instruction set is analyzed through at least one processor in the server, and all task instructions to be allocated in the instruction set are determined.

The task to be distributed instruction is an order delivery task generated by the user after ordering the meal by the meal ordering APP, and delivery needs to be executed by the delivery resources. In one example, after the server receives the order from the client, the server parses the received order to obtain the order delivery task in the order.

And 103, performing path planning and simulation on the task instruction to be distributed and the distribution resource to obtain a pre-distribution matrix.

The method comprises the steps of carrying out path planning and simulation on distribution tasks of M to-be-distributed task instructions and N distribution resources through at least one processor to obtain an M × N pre-distribution matrix, wherein an element L (i, j) in the pre-distribution matrix represents a matching score of an ith to-be-distributed task instruction and a jth distribution resource, N is a natural number larger than 0, i is smaller than or equal to M, and j is smaller than or equal to N.

It should be noted that the delivering resource specifically refers to: in a distribution system such as an offline rider, each distribution unit is independent from another, and the independent distribution units are provided with a distinct code (i.e., a distribution resource ID) to distribute resources electronically.

A specific scoring manner for obtaining the M × N pre-allocation matrix is as follows, referring to fig. 2:

and calculating the results of the path planning and the simulation, and acquiring the matching score of the task instruction to be distributed and the distribution resource. Specifically, the matching score of the task instruction to be distributed and the distribution resource is obtained comprehensively through the following three conditions.

1. The distribution direction of the task command 201 to be distributed and the driving direction of the distribution resource 202 are analyzed. Specifically, the more similar the delivery direction of the to-be-assigned task instruction 201 and the driving direction of the delivery resource 202, the higher the matching score 205 between the to-be-assigned task instruction and the delivery resource.

In one specific example, the higher the similarity of the delivery direction of the order to the direction of travel of the rider, the higher the matching score.

2. The distance that the delivery resource 202 needs to travel after receiving the to-be-assigned task instruction 201 is analyzed. Specifically, the shorter the distance that the dispatch resource 202 needs to travel after receiving the to-be-dispatched task instruction 201, the higher the matching score.

In one specific example, order A is assigned to rider a, who needs to travel 500 meters more; order a is assigned to rider b who needs to travel 800 meters more. The matching score of order a with rider a is higher than the matching score of order a with rider b.

3. The distribution difficulty of the task instruction 201 to be distributed to the distribution resource 202 is analyzed. Specifically, for all the delivery resources 202, the delivery difficulty of the task instruction 201 to be allocated is distinguished, and the smaller the delivery difficulty of the task instruction 201 to be allocated is, the higher the matching score is.

In a specific example, rider a has too many bills, and cannot pick up an order any more, and order A is difficult for rider a to distribute; at the moment, the rider b has a small amount of orders and can take orders, and the order A is not large in distribution difficulty for the rider b. The matching score of order a with rider b is higher than the matching score of order a with rider a.

In one specific example, according to the above scoring criteria, the following pre-allocation matrix of 5 × 4 is obtained:

the ith row shows the corresponding scores of 4 distribution resources corresponding to the ith task instruction to be distributed, and the jth column shows the corresponding scores of 5 distribution resources corresponding to the jth distribution resource. For example, row 3, column 3 data 63 indicates: the matching score when the 3 rd task instruction to be allocated is allocated to the 3 rd distribution resource is 63.

And step 104, judging whether the task instruction to be distributed suitable for delayed distribution exists in the M task instructions to be distributed. Specifically, step 104 includes step 114, step 124, step 134, step 144.

And step 114, analyzing the pre-allocation matrix to obtain the optimal allocation result of each task instruction to be allocated. Specifically, a pre-allocation matrix is combined to obtain a combination of the task instruction to be allocated and the highest score of the distribution resource.

In one example, the determination is made in conjunction with the above matrix:

at this time, the optimal allocation result of the 1 st task instruction to be allocated is the 2 nd distribution resource, and the matching score is 84; the optimal allocation result of the 2 nd task instruction to be allocated is the 3 rd distribution resource, and the matching score is 94; the optimal allocation result of the 3 rd task instruction to be allocated is the 1 st distribution resource, and the matching score is 99; the optimal allocation result of the 4 th task instruction to be allocated is the 5 th distribution resource, and the matching score is 73; the optimal allocation result of the 5 th task instruction to be allocated is the 3 rd distribution resource, and the matching score is 91.

And step 124, judging whether the optimal distribution result of one task instruction to be distributed is suitable for delayed distribution.

In one example, the 3 rd to-be-allocated task instruction is judged whether to be suitable for delayed allocation, according to the optimal allocation mode, that is, the 3 rd to-be-allocated task instruction is allocated with the 1 st distribution resource, and according to the path planning and simulation of the allocation mode, whether the 3 rd to-be-allocated task instruction is suitable for delayed allocation is judged.

If yes, executing step 125 to mark the task instruction to be distributed as suitable for deferred distribution; if the deferred allocation is not suitable, step 126 is executed to mark the task instruction to be allocated as normally allocatable. After step 125 or step 126 is completed, step 134 is performed.

And 134, carrying out path planning and simulation on the task instruction to be distributed and the distribution resource again to obtain the updated pre-distribution matrix.

Specifically, the distribution resources of the to-be-distributed task instruction distributed in step 124 are subjected to path planning and simulation, and the pre-distribution matrix is updated.

In one example, if in step 124, the 3 rd to-be-allocated task instruction is pre-allocated to the 1 st dispatch resource, the pre-allocation matrix at this time is as follows:

at this time, path planning and simulation should be performed again on the 1 st distribution resource and the 1 st, 2 nd, 4 th and 5 th pre-allocation matrices, and the updated pre-allocation matrices are obtained as follows:

after the pre-allocation matrix update is complete, step 144 is performed.

And step 144, judging whether all the task instructions to be distributed are finished or not.

Judging whether all the task instructions to be distributed are judged to be finished, if so, finishing the step 104, executing the step 105, and performing delayed distribution on the task instructions to be distributed which are suitable for delayed distribution; if not, the process returns to step 114.

And 105, performing delayed distribution on the task instruction to be distributed, which is suitable for delayed distribution.

Specifically, according to the judgment result of whether the task instruction to be allocated is suitable for delayed allocation, delayed allocation is performed on the task instruction to be allocated, which is suitable for delayed allocation.

The above examples in the present embodiment are for convenience of understanding, and do not limit the technical aspects of the present invention.

Compared with the prior art, in the embodiment, before the orders are distributed, the paths of the orders and the rider are planned and simulated, whether active orders are needed or not is judged in a mode of optimally distributing all the orders currently, the situation that a large amount of orders are overstocked due to the fact that the active orders are pressed is avoided, and service quality is improved.

The steps of the above methods are divided for clarity, and the implementation may be combined into one step or split some steps, and the steps are divided into multiple steps, so long as the same logical relationship is included, which are all within the protection scope of the present patent; it is within the scope of the patent to add insignificant modifications to the algorithms or processes or to introduce insignificant design changes to the core design without changing the algorithms or processes.

A second embodiment of the present invention relates to a distribution method of distribution tasks, and is substantially the same as the first embodiment, and mainly differs therefrom in that: in this embodiment, the method specifically includes three ways of determining whether the ith task instruction to be allocated is suitable for deferred allocation according to the optimal allocation result of the ith task instruction to be allocated.

Referring to fig. 3, a detailed flowchart of a manner of determining a first deferred allocation method according to a second embodiment of the present invention includes:

step 101, receiving an instruction from a client.

And step 104, judging whether the task instruction to be distributed suitable for delayed distribution exists in the M task instructions to be distributed.

Specifically, step 104 includes step 114, step 324, step 134, step 144.

And step 114, analyzing the pre-allocation matrix to obtain the optimal allocation result of each task instruction to be allocated.

Step 324, determining whether the task instruction is suitable for delayed distribution for the optimal distribution result of one of the task instructions to be distributed.

Step 424, it is checked whether the task instruction to be distributed belongs to the delivery peak task.

Specifically, according to the optimal allocation result of the ith task instruction to be allocated, whether the ith task instruction to be allocated is suitable for deferred allocation is judged, and the method specifically includes: detecting whether the ith task instruction to be allocated belongs to a delivery peak task or not according to delivery information of delivery resources corresponding to the ith task instruction to be allocated; and if the ith task instruction to be distributed belongs to the distribution peak task, judging the ith task instruction to be distributed as a task instruction to be distributed suitable for delayed distribution.

If the ith task instruction to be distributed meets any one of the following conditions, judging that the ith task instruction to be distributed belongs to a distribution peak task: the number of the distributed resources is lower than a first preset value, the distribution pressure of the distributed resources exceeds a second preset value, the number of the task instructions to be distributed carried by the current distributed resources exceeds a third preset value, and the dining time of the distributed resources exceeds a fourth preset value.

In one specific example, the following is specified:

before the ith task instruction to be distributed is judged, the total quantity X of the current distribution resources is obtained in real time₁If X is₁If the value is less than 30, continuing to judge the characteristics of the target distribution resources, and if X is less than 30, continuing to judge the characteristics of the target distribution resources₁If the number is greater than 30, the currently generated task instruction to be allocated is determined to be a delivery peak task, and step 125 is executed to mark the task instruction to be allocated as suitable for delayed allocation.

When the ith task instruction to be distributed is carried out, the distribution pressure X of the distribution resources corresponding to the ith task instruction to be distributed in the optimal distribution scheme is obtained in real time₂Single dose of body and back X₃And waiting for meal time X₄。

If the dispensing pressure X₂Less than 60, single amount of back X₃Less than 4 and equal meal timeX₄If the value is less than 10, step 126 is executed to mark the task instruction to be allocated as normally allocatable.

If the dispensing pressure X₂Greater than 60, or a single amount X₃More than 4 or equal meal time X₄If it is greater than 10, step 125 is executed to mark the task instruction to be allocated as suitable for deferred allocation.

It should be noted that, in this embodiment, the first preset value, the second preset value, the third preset value, and the fourth preset value are exemplified to enable a person skilled in the art to understand a determination manner of the present disclosure, and do not limit the present disclosure.

In the present embodiment, the total amount of the delivery resources, the delivery pressure of the target delivery resources, the back order amount of the target delivery resources, and the equal-time delivery times of the target delivery resources are involved in the determination of the delivery peak task; in other embodiments, at least one of the above determination methods is only required.

Referring to fig. 4, step 524, a specific flowchart of a determination method of the second delayed allocation method in the second embodiment of the present invention is to detect whether a task instruction to be allocated belongs to a delivery timing task.

Specifically, whether the ith task instruction to be allocated belongs to a delivery timing task is detected according to delivery information of the ith task instruction to be allocated and delivery information of corresponding delivery resources and by combining a current time period; and if the ith task instruction to be distributed belongs to the distribution timing task, judging the ith task instruction to be distributed as a task instruction to be distributed suitable for delayed distribution.

If the ith task instruction to be allocated meets any one of the following conditions, judging that the ith task instruction to be allocated belongs to a delivery timing task: the time of the current distribution resource from the time of executing the task instruction to be distributed exceeds a fifth preset value, and the time of the current distribution resource reaching the meal taking place of the task instruction to be distributed in advance exceeds a sixth preset value.

The matching score between the ith task instruction to be distributed and the corresponding distribution resource is obtained by performing path planning and simulation on the distribution resource receiving task instruction to be distributed, so that whether the ith task instruction to be distributed is suitable for delayed distribution or not is judged according to the conditions.

In one example, the details are as follows:

if the current time is 13.00, according to the path planning and the simulation of the distribution resources, the time for the distribution resources to execute the distribution task can be obtained, at this moment, the assumed time is 13.30, and at this moment, the simulation time is 30 minutes from the current time; monitoring the distribution condition of the distribution resource in real time to obtain the time X of the distribution resource actually executing the distribution task₄Obtaining the difference value X between the actual time and the current time₄-13.00。

If the difference value X between the actual time and the current time₄If the difference between-13.00 and the difference between the simulation time and the current time of 30 minutes exceeds the preset time of 10 minutes, step 125 is executed to mark the task instruction to be allocated as suitable for delayed allocation. If the difference value X between the actual time and the current time₄If the difference between 13.00 and the simulation time and the current time is 30 minutes, which is lower than the preset time by 10 minutes, step 126 is executed to mark the task instruction to be allocated as normal allocation.

Similarly, according to the path planning and the simulation of the distribution resources, the time of the distribution resources reaching the meal taking place can be obtained, the assumption is that the time is 13.30, and the simulation time is 30 minutes from the current time; monitoring the distribution condition of the distribution resource in real time to obtain the time X of the distribution resource actually arriving at the meal taking place₅Obtaining the difference value X between the actual time and the current time₅-13.00。

If the difference value X between the actual time and the current time₄If the difference between 13.00 and the simulation time and the current time is 30 minutes, exceeds the preset time by 5 minutes, step 125 is executed to mark the task instruction to be allocated as suitable for delayed allocation. If it is actualDifference X between time and current time₄If the difference between 13.00 and the simulation time and the current time difference of 30 minutes is less than the preset time of 5 minutes, step 126 is executed to mark the task instruction to be allocated as normally allocatable.

It should be noted that, in this embodiment, the fifth preset value and the sixth preset value are exemplified to enable a person skilled in the art to understand a determination manner of the present solution, and do not limit the present solution.

It should be further noted that, in the present embodiment, the judgment of the delivery timing task involves two modes, namely, the time when the current delivery resource is away from the execution of the task instruction to be distributed and the arrival of the current delivery resource at the meal fetching place; in other embodiments, at least one of the above determination methods is only required.

Referring to fig. 5, namely step 624, a specific flowchart of a determination method of the third deferred allocation method in the second embodiment of the present invention detects whether a task instruction to be allocated belongs to a delivery optimization task.

Specifically, detecting whether the ith task instruction to be distributed belongs to a distribution optimization task or not according to distribution information of the ith task instruction to be distributed and distribution information of corresponding distribution resources and current scene state information; and if the ith task instruction to be distributed belongs to the distribution optimization task, judging the ith task instruction to be distributed as a task instruction to be distributed suitable for delayed distribution.

If the ith task instruction to be distributed meets any one of the following conditions, judging that the ith task instruction to be distributed belongs to the distribution optimization task: the matching score of the delayed allocation of the current distribution resource and the current task instruction to be allocated is higher than the matching score of the current distribution resource and the current task instruction to be allocated immediately, and the matching score of the current task instruction to be allocated and the other distribution resources delayed allocation is higher than the matching score of the current task instruction to be allocated and the current task instruction to be allocated immediately.

In one example, the details are as follows:

and supposing that the ith task instruction to be distributed is suitable for delay distribution, performing path planning and simulation on the ith task instruction to be distributed after delay distribution to obtain a delay distribution matching score of the ith task instruction to be distributed, and performing comparative analysis on the delay distribution matching score and a pre-distribution matrix.

When a first task instruction to be allocated is allocated, if the following conditions occur:

at this time, the score of the first to-be-allocated task instruction allocated to the second allocation resource in the delayed allocation is up to 93, and is higher than the score 84 of the first to-be-allocated task instruction allocated to the second allocation resource in the pre-allocation, and at this time, the match score of the delayed allocation of the current allocation resource and the current to-be-allocated task instruction is higher than the match score of the immediate allocation of the current allocation resource and the current to-be-allocated task instruction, step 125 is executed, and the to-be-allocated task instruction is marked as being suitable for the delayed allocation.

at this time, the score of the first to-be-allocated task instruction allocated to the third delivery resource in the delayed allocation is 96 minutes at the highest, and is higher than the score 84 of the first to-be-allocated task instruction allocated to the second delivery resource in the pre-allocation, and at this time, the matching score of the current to-be-allocated task instruction and the delayed allocation of other delivery resources is higher than the matching score of the current to-be-allocated task instruction and the current to-be-allocated task instruction which are immediately allocated, step 125 is executed, and the to-be-allocated task instruction is marked as being suitable for delayed allocation.

after the time delay allocation, no matter which delivery resource the first to-be-allocated task instruction is allocated to, the score is lower than the score 84 for allocating the first to-be-allocated task instruction to the second delivery resource in the pre-allocation, at this time, the to-be-allocated task instruction is considered not to be suitable for the time delay allocation, step 126 is executed, and the to-be-allocated task instruction is marked as being capable of being allocated normally.

Note that the tabular score in the present embodiment is exemplified to enable a person skilled in the art to understand the manner of determination in the present embodiment, and does not limit the present embodiment.

It should be noted that, in other embodiments, the above three determination manners may be implemented in combination, for example, to determine whether the to-be-allocated task instruction belongs to a delivery peak task, and also determine whether the to-be-allocated task instruction belongs to a delivery timing task; through the combination of multiple judgment modes, whether the task instruction to be distributed is suitable for delayed distribution can be judged more accurately.

Step 125, marking the task instruction to be allocated as suitable for deferred allocation, or step 126, marking the task instruction to be allocated as normal allocation, executing step 134.

Compared with the prior art, in the embodiment, whether the task instruction to be allocated is suitable for the active menu is judged through three specific modes, whether the distribution resource is in a distribution peak is judged through the first mode, if the rider is in the distribution peak, the order to be allocated to the rider is judged to be a distribution peak task, the active menu is carried out, the condition that the rider is simultaneously allocated with a large number of tasks is avoided, and the right of the rider is guaranteed; judging according to the distribution resources and the current time in a second mode, and if the task instruction to be distributed has more proper time for a rider, actively pressing the task instruction to be distributed to be more convenient for the rider to distribute; and judging whether the orders after the active ordering have better orders or not through a third mode, wherein the orders can be better distributed by the current rider after the active ordering is distributed or actively ordered, the orders in the mode are met, and the distribution mode is optimized through the active ordering.

A third embodiment of the present invention relates to an apparatus for distributing tasks, as shown in fig. 4, the apparatus including:

an obtaining module 401, configured to receive instructions from each client to obtain an instruction set of the client;

the analysis module 402 is configured to analyze an instruction set and obtain M to-be-allocated task instructions in the instruction set, where M is a natural number greater than 0;

the pre-allocation matrix acquisition module 403 is configured to perform path planning and simulation on M to-be-allocated task instructions and N allocation resources to obtain an M × N pre-allocation matrix, where an element L (i, j) in the pre-allocation matrix represents a matching score between an ith to-be-allocated task instruction and a jth allocation resource, N is a natural number greater than 0, i is less than or equal to M, and j is less than or equal to N;

the allocation module 404 is configured to obtain an optimal allocation result of each task instruction to be allocated, in combination with the pre-allocation matrix; the optimal allocation result is the distribution resource corresponding to the highest matching score in the matching scores of the task instruction to be allocated and the N distribution resources respectively; judging whether the optimal distribution result of the M task instructions to be distributed has a task instruction to be distributed suitable for delayed distribution or not, and performing delayed distribution on the task instruction to be distributed suitable for delayed distribution; and allocating the task instruction to be allocated which is not suitable for delayed allocation according to the corresponding optimal allocation result.

Specifically, the allocation module 404 specifically includes a processing unit configured to determine whether an ith task instruction to be allocated is suitable for deferred allocation according to an optimal allocation result of the ith task instruction to be allocated, an updating unit configured to update M to M-1, update i to i +1, perform path planning and simulation of distribution tasks on the updated M task instructions to be allocated and the N distribution resources to obtain an updated M × N pre-allocation matrix, and an allocation unit configured to perform deferred allocation on a task instruction to be allocated that is suitable for deferred allocation after completing whether there is a task instruction to be allocated that is suitable for deferred allocation among the M task instructions to be allocated.

The processing unit may determine whether the ith task instruction to be allocated is suitable for deferred allocation according to three different ways, which are as follows:

the first method is as follows: the processing unit comprises a first processing subunit, and is used for detecting whether the ith task instruction to be allocated belongs to a delivery peak task or not according to delivery information of delivery resources corresponding to the ith task instruction to be allocated; and if the ith task instruction to be distributed belongs to the distribution peak task, judging the ith task instruction to be distributed as a task instruction to be distributed suitable for delayed distribution.

If the ith task instruction to be allocated meets any one of the following conditions, judging that the ith task instruction to be allocated belongs to a delivery peak task: the number of the distributed resources is lower than a first preset value, the distribution pressure of the distributed resources exceeds a second preset value, the number of the task instructions to be distributed carried by the current distributed resources exceeds a third preset value, and the dining time of the distributed resources exceeds a fourth preset value.

The second method comprises the following steps: the processing unit comprises a second processing subunit, and the second processing subunit is used for detecting whether the ith task instruction to be allocated belongs to a delivery timing task or not according to the delivery information of the ith task instruction to be allocated and the delivery information of the corresponding delivery resource and by combining the current time period; and if the ith task instruction to be distributed belongs to the distribution timing task, judging the ith task instruction to be distributed as a task instruction to be distributed suitable for delayed distribution.

The third method comprises the following steps: the processing unit comprises a third processing subunit, and the third processing subunit is used for detecting whether the ith task instruction to be distributed belongs to a distribution optimization task or not according to the distribution information of the ith task instruction to be distributed and the distribution information of the corresponding distribution resource and by combining the current scene state information; and if the ith task instruction to be distributed belongs to the distribution optimization task, judging the ith task instruction to be distributed as a task instruction to be distributed suitable for delayed distribution.

It should be noted that this embodiment corresponds to the first embodiment or the second embodiment, and may be implemented in cooperation with the first embodiment or the second embodiment. The related technical details mentioned in the first embodiment or the second embodiment are still valid in this embodiment, and are not described herein again in order to reduce the repetition. Accordingly, the related-art details mentioned in the present embodiment can also be applied to the first embodiment or the second embodiment.

It should be noted that each module referred to in this embodiment is a logical module, and in practical applications, one logical unit may be one physical unit, may be a part of one physical unit, and may be implemented by a combination of multiple physical units. In addition, in order to highlight the innovative part of the present invention, elements that are not so closely related to solving the technical problems proposed by the present invention are not introduced in the present embodiment, but this does not indicate that other elements are not present in the present embodiment.

A fourth embodiment of the present invention relates to an electronic apparatus, as shown in fig. 5, including: at least one processor 501; and a memory 502 communicatively coupled to the at least one processor 501; and a communication component 503 communicatively coupled to the processor 501 and the memory 502, the communication component 503 receiving and transmitting data under control of the processor 501; wherein the memory 502 stores instructions executable by the at least one processor 501, the instructions being executable by the at least one processor 501 to implement:

the method comprises the steps of receiving instructions from each client to obtain an instruction set of the client, analyzing the instruction set through at least one processor to obtain M task instructions to be distributed in the instruction set, wherein M is a natural number larger than 0, carrying out route planning and simulation on the M task instructions to be distributed and N distribution resources through the at least one processor to obtain a pre-distribution matrix of M × N, wherein an element L (i, j) in the pre-distribution matrix represents a matching score of the ith task instruction to be distributed and the jth distribution resource, N is a natural number larger than 0, i is smaller than or equal to M, and j is smaller than or equal to N, combining the pre-distribution matrix through the at least one processor to obtain an optimal distribution result of each task instruction to be distributed, the optimal distribution result is the distribution resource corresponding to the highest matching score in the matching scores of the task instruction to be distributed and the task instruction to be distributed after being suitable for delayed distribution, judging whether the task instruction to be distributed in the optimal distribution results of the M task instructions to be distributed is suitable for delayed distribution, and distributing the optimal distribution results of tasks which are not suitable for delayed distribution.

Specifically, the server includes: one or more processors 501 and a memory 502, with one processor 501 being an example in fig. 5. The processor 501 and the memory 502 may be connected by a bus or other means, and fig. 5 illustrates the connection by the bus as an example. Memory 502, which is a non-volatile computer-readable storage medium, may be used to store non-volatile software programs, non-volatile computer-executable programs, and modules. The processor 501 executes various functional applications of the apparatus and data processing, that is, implements the distribution method of the distribution task described above by executing nonvolatile software programs, instructions, and modules stored in the memory 502.

The memory 502 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store a list of options, etc. Further, the memory 502 may include high speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device. In some embodiments, memory 502 may optionally include memory 502 located remotely from processor 501, and such remote memory 502 may be connected to an external device via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.

One or more modules are stored in the memory 502 and, when executed by the one or more processors 501, perform the method of assigning delivery tasks in any of the method embodiments described above.

The product can execute the method provided by the embodiment of the application, has corresponding functional modules and beneficial effects of the execution method, and can refer to the method provided by the embodiment of the application without detailed technical details in the embodiment.

A fifth embodiment of the present invention relates to a nonvolatile storage medium storing a computer-readable program. The computer readable program when executed by a processor implements the above-described method embodiments.

That is, as can be understood by those skilled in the art, all or part of the steps in the method of the above embodiments may be implemented by a program instructing related hardware, where the program is stored in a storage medium and includes several instructions to enable a device (which may be a single chip, a chip, or the like) or a processor (processor) to execute all or part of the steps in the method of the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.

It will be understood by those of ordinary skill in the art that the foregoing embodiments are specific embodiments for practicing the invention, and that various changes in form and details may be made therein without departing from the spirit and scope of the invention in practice.

The embodiment of the application provides A1. a distribution method of distribution tasks, comprising the following steps:

receiving instructions from each client to obtain an instruction set of the client;

analyzing the instruction set through at least one processor to obtain M task instructions to be distributed in the instruction set, wherein M is a natural number greater than 0;

performing path planning and simulation on the M to-be-distributed task instructions and N distribution resources through at least one processor to obtain a pre-distribution matrix of M × N, wherein an element L (i, j) in the pre-distribution matrix represents a matching score of an ith to-be-distributed task instruction and a jth distribution resource, N is a natural number greater than 0, i is less than or equal to M, and j is less than or equal to N;

acquiring the optimal allocation result of each task instruction to be allocated by combining the pre-allocation matrix through at least one processor; the optimal allocation result is the distribution resource corresponding to the highest matching score in the matching scores of the task instruction to be allocated and the N distribution resources respectively; judging whether the optimal distribution result of the M task instructions to be distributed has a task instruction to be distributed suitable for delayed distribution or not, and performing delayed distribution on the task instruction to be distributed suitable for delayed distribution; and allocating the task instruction to be allocated which is not suitable for delayed allocation according to the corresponding optimal allocation result.

A2. According to the distribution method of the delivery tasks described in a1, the determining, by at least one processor and in combination with the pre-distribution matrix, whether a task instruction to be distributed suitable for delayed distribution exists in the optimal distribution result of the M task instructions to be distributed, and performing delayed distribution on the task instruction to be distributed suitable for delayed distribution specifically includes:

repeating, by at least one processor, the following steps until a determination is made whether the M task instructions to be allocated are eligible for deferred allocation:

judging whether the ith task instruction to be distributed is suitable for delayed distribution or not according to the optimal distribution result of the ith task instruction to be distributed;

updating M to be M-1, updating i to be i +1, and performing path planning and simulation on the updated M to-be-distributed task instructions and N distribution resources to obtain an updated M × N pre-distribution matrix;

and after whether the task instruction to be distributed suitable for delayed distribution exists in the M task instructions to be distributed is finished, performing delayed distribution on the task instruction to be distributed suitable for delayed distribution.

A3. According to the distribution method of the distribution tasks described in a2, the determining whether the ith task instruction to be distributed is suitable for deferred distribution according to the optimal distribution result of the ith task instruction to be distributed specifically includes:

detecting whether the ith task instruction to be distributed belongs to a distribution peak task or not according to distribution information of distribution resources corresponding to the ith task instruction to be distributed;

and if the ith task instruction to be distributed belongs to the distribution peak task, judging the ith task instruction to be distributed as the task instruction to be distributed suitable for delayed distribution.

A4. According to the method for distributing delivery tasks described in a3, the detecting whether the ith task instruction to be distributed belongs to a delivery peak task includes:

if the ith task instruction to be distributed meets any one of the following conditions, judging that the ith task instruction to be distributed belongs to the distribution peak task:

the number of the distributed resources is lower than a first preset value, the distribution pressure of the distributed resources exceeds a second preset value, the number of the task instructions to be distributed carried by the current distributed resources exceeds a third preset value, and the dining time of the distributed resources exceeds a fourth preset value.

A5. According to the distribution method of the distribution tasks described in a2, the determining whether the ith task instruction to be distributed is suitable for deferred distribution according to the optimal distribution result of the ith task instruction to be distributed specifically includes:

detecting whether the ith task instruction to be distributed belongs to a distribution timing task or not according to the distribution information of the ith task instruction to be distributed and the distribution information of the corresponding distribution resources and by combining the current time period;

and if the ith task instruction to be distributed belongs to the distribution timing task, judging the ith task instruction to be distributed as the task instruction to be distributed suitable for delayed distribution.

A6. According to the distribution method of the distribution tasks described in a5, the detecting whether the ith task instruction to be distributed belongs to a distribution timing task includes:

if the ith task instruction to be allocated meets any one of the following conditions, judging that the ith task instruction to be allocated belongs to the delivery timing task:

the time of the current distribution resource from the time of executing the task instruction to be distributed exceeds a fifth preset value, and the time of the current distribution resource reaching the meal taking place of the task instruction to be distributed in advance exceeds a sixth preset value.

A7. According to the distribution method of the distribution tasks described in a2, the determining whether the ith task instruction to be distributed is suitable for deferred distribution according to the optimal distribution result of the ith task instruction to be distributed specifically includes:

detecting whether the ith task instruction to be distributed belongs to a distribution optimization task or not according to the distribution information of the ith task instruction to be distributed and the distribution information of corresponding distribution resources and by combining the current scene state information;

and if the ith task instruction to be distributed belongs to the distribution optimization task, judging the ith task instruction to be distributed as the task instruction to be distributed suitable for delayed distribution.

A8. According to the distribution method of the distribution tasks described in a7, the detecting whether the ith task instruction to be distributed belongs to a distribution optimization task includes:

if the ith task instruction to be distributed meets any one of the following conditions, judging that the ith task instruction to be distributed belongs to the distribution optimization task:

the matching score of the delayed allocation of the current distribution resource and the current task instruction to be allocated is higher than the matching score of the current distribution resource and the current task instruction to be allocated immediately, and the matching score of the current task instruction to be allocated and the other distribution resources delayed allocation is higher than the matching score of the current task instruction to be allocated and the current task instruction to be allocated immediately.

The embodiment of the application provides B1. an allocation device for distribution tasks, which comprises:

the acquisition module is used for receiving instructions from each client to obtain an instruction set of the client;

the analysis module is used for analyzing the instruction set and acquiring M task instructions to be distributed in the instruction set, wherein M is a natural number greater than 0;

the system comprises a preallocation matrix acquisition module, a distribution module and a distribution module, wherein the preallocation matrix acquisition module is used for carrying out path planning and simulation on distribution tasks of M to-be-distributed task instructions and N distribution resources to obtain an M × N preallocation matrix, wherein an element L (i, j) in the preallocation matrix represents the matching score of the ith to-be-distributed task instruction and the jth distribution resource, N is a natural number greater than 0, i is less than or equal to M, and j is less than or equal to N;

the distribution module is used for acquiring the optimal distribution result of each task instruction to be distributed by combining the pre-distribution matrix; the optimal allocation result is the distribution resource corresponding to the highest matching score in the matching scores of the task instruction to be allocated and the N distribution resources respectively; judging whether the optimal distribution result of the M task instructions to be distributed has a task instruction to be distributed suitable for delayed distribution or not, and performing delayed distribution on the task instruction to be distributed suitable for delayed distribution; and allocating the task instruction to be allocated which is not suitable for delayed allocation according to the corresponding optimal allocation result.

B2. The apparatus for distributing tasks according to B1, wherein the distribution module specifically includes:

the processing unit is used for judging whether the ith task instruction to be distributed is suitable for delayed distribution or not according to the optimal distribution result of the ith task instruction to be distributed;

the updating unit is used for updating the M to be M-1, updating the i to be i +1, and performing path planning and simulation on the updated M to-be-distributed task instructions and the N distribution resources to obtain an updated M × N pre-distribution matrix;

and the distribution unit is used for delaying and distributing the task instruction to be distributed suitable for delayed distribution after finishing whether the task instruction to be distributed suitable for delayed distribution exists in the M task instructions to be distributed.

B3. The apparatus for distributing tasks according to B2, wherein the processing unit comprises:

the first processing subunit is configured to detect, according to distribution information of distribution resources corresponding to the ith task instruction to be distributed, whether the ith task instruction to be distributed belongs to a distribution peak task; and if the ith task instruction to be distributed belongs to the distribution peak task, judging the ith task instruction to be distributed as the task instruction to be distributed suitable for delayed distribution.

B4. The task distribution device according to B3, wherein the detecting whether the ith task instruction to be distributed belongs to a peak distribution task includes:

B5. The apparatus for distributing tasks according to B2, wherein the processing unit comprises:

the second processing subunit is configured to detect, according to the distribution information of the ith task instruction to be allocated and the distribution information of the corresponding distribution resource, and in combination with a current time period, whether the ith task instruction to be allocated belongs to a distribution timing task; and if the ith task instruction to be distributed belongs to the distribution timing task, judging the ith task instruction to be distributed as the task instruction to be distributed suitable for delayed distribution.

B6. According to the apparatus for distributing tasks described in B5, the detecting whether the ith task instruction to be distributed belongs to a distribution timing task includes:

B7. The apparatus for distributing tasks according to B2, wherein the processing unit comprises:

the third processing subunit is configured to detect, according to the distribution information of the ith task instruction to be distributed and the distribution information of the corresponding distribution resource, and in combination with current scene state information, whether the ith task instruction to be distributed belongs to a distribution optimization task; and if the ith task instruction to be distributed belongs to the distribution optimization task, judging the ith task instruction to be distributed as the task instruction to be distributed suitable for delayed distribution.

B8. According to the apparatus for distributing tasks described in B7, the detecting whether the ith task instruction to be distributed belongs to a distribution optimization task includes:

An embodiment of the present application provides c1. an electronic device, including a memory and a processor, where the memory stores a computer program, and the processor executes the program to perform:

C2. The electronic device of C1, the processor when running the program performing the method of assigning delivery tasks of any of a 2-a 8.

The present embodiment provides d1 a non-volatile storage medium storing a computer-readable program which, when executed by a processor, implements the distribution method of the delivery tasks as described in any one of a1 to A8.

Claims

1. A method for distributing delivery tasks, comprising:

2. The distribution method for the delivery tasks according to claim 1, wherein the determining, by at least one processor and in combination with the pre-distribution matrix, whether there is a task instruction to be distributed that is suitable for deferred distribution in the optimal distribution result of the M task instructions to be distributed, and performing deferred distribution on the task instruction to be distributed that is suitable for deferred distribution specifically includes:

3. The distribution method of the delivery tasks according to claim 2, wherein the determining whether the ith task instruction to be distributed is suitable for delayed distribution according to the optimal distribution result of the ith task instruction to be distributed specifically comprises:

4. The distribution method of the delivery tasks according to claim 2, wherein the determining whether the ith task instruction to be distributed is suitable for delayed distribution according to the optimal distribution result of the ith task instruction to be distributed specifically comprises:

5. The distribution method of the delivery tasks according to claim 2, wherein the determining whether the ith task instruction to be distributed is suitable for delayed distribution according to the optimal distribution result of the ith task instruction to be distributed specifically comprises:

6. An apparatus for distributing tasks, comprising:

7. The task distribution device according to claim 6, wherein the distribution module specifically includes:

8. An electronic device comprising a memory and a processor, the memory storing computer programs, the processor when executing the programs performing:

9. The electronic device according to claim 8, wherein the processor executes the program to perform the distribution method of the delivery task according to any one of claims 2 to 5.

10. A non-volatile storage medium storing a computer-readable program, wherein the computer-readable program, when executed by a processor, implements the distribution method of the delivery tasks according to any one of claims 1 to 5.