CN110705918A

CN110705918A - Distribution task allocation method and device, electronic equipment and computer storage medium

Info

Publication number: CN110705918A
Application number: CN201911008569.1A
Authority: CN
Inventors: 彭涛
Original assignee: Rajax Network Technology Co Ltd
Current assignee: Rajax Network Technology Co Ltd
Priority date: 2019-10-22
Filing date: 2019-10-22
Publication date: 2020-01-17

Abstract

The embodiment of the disclosure discloses a distribution task distribution method, a distribution task distribution device, electronic equipment and a computer storage medium, wherein the distribution task distribution method comprises the following steps: determining, by at least one processor, a current allocation round parameter; distributing distribution tasks in different rounds for the distribution resources according to the distribution round parameters through at least one processor; in response to detecting, by the at least one processor, that a timeout occurred for the dispatched resource, performing, by the at least one processor, a preset process for the timed-out dispatched resource. According to the technical scheme, the matching degree between the distribution tasks and the distributors can be improved under the condition that the operation burden of the distributors is not increased, the distribution time of the distribution tasks is shortened, the communication cost is reduced, the fairness and the high efficiency of distribution of the distribution tasks are guaranteed, the distribution efficiency and the distribution quality of the distribution tasks are further guaranteed, the distribution quality of distribution resources is improved, and the service quality of an internet platform is improved.

Description

Distribution task allocation method and device, electronic equipment and computer storage medium

Technical Field

The present disclosure relates to the field of task processing technologies, and in particular, to a method and an apparatus for distributing delivery tasks, an electronic device, and a computer storage medium.

Background

With the development of internet technology, more and more merchants or service providers provide services for users through internet platforms, and many internet services require distributors to distribute, so the distribution efficiency and quality of distribution tasks are very important for the distribution quality of the distributors and the improvement of the service quality of the internet. In the prior art, delivery tasks are generally distributed by methods such as distributing the delivery tasks, preempting the delivery tasks by a deliverer, or distributing the delivery tasks for multiple rounds, but the above processing methods have the following defects: the optimal matching between the distribution tasks and the distributors is difficult to realize, the operation burden of the distributors is increased, the task distribution time is too long, the subjective factors of the distributors are difficult to exert, and the reasonable distribution of the distribution tasks is difficult to ensure.

Disclosure of Invention

The embodiment of the disclosure provides a distribution task distribution method and device, electronic equipment and a computer storage medium.

In a first aspect, an embodiment of the present disclosure provides a distribution task allocation method.

Specifically, the distribution task allocation method includes:

determining, by at least one processor, a current allocation round parameter;

distributing distribution tasks in different rounds for the distribution resources according to the distribution round parameters through at least one processor;

in response to detecting, by the at least one processor, that a timeout occurs for a distributed resource, performing, by the at least one processor, a preset process for the timeout distributed resource;

wherein the distribution round parameters comprise one or more of the following parameters: the method comprises the steps of distributing resource quantity, total distributing time of distributing tasks, overtime threshold value of distributing task distribution and visible delay of distributing resource tasks.

With reference to the first aspect, in a first implementation manner of the first aspect, the performing, by at least one processor, a distribution task distribution round for distribution resources according to the distribution round parameter includes:

calculating, by at least one processor, a task reception priority of a currently allocated round of resource distribution;

allocating, by at least one processor, a delivery resource task visible delay for the delivery resource according to the task reception priority;

displaying the distribution tasks to be distributed to the distribution resources in a time-sharing manner through at least one processor according to the visible time delay of the distribution resource tasks;

in response to a receipt confirmation operation of the dispatch resource from at least one processor, allocating, by at least one processor, a corresponding dispatch task to the dispatch resource.

With reference to the first aspect and the first implementation manner of the first aspect, in a second implementation manner of the first aspect, the calculating, by the at least one processor, a task reception priority of a currently allocated round of resource distribution is implemented as:

determining, by at least one processor, a distribution resource task reception priority element and a weight corresponding to the distribution resource task reception priority element;

and calculating the priority value of the distribution resources of the current distribution turn by at least one processor according to the received priority elements and the weights thereof of the distribution resource tasks.

With reference to the first aspect, the first implementation manner of the first aspect, and the second implementation manner of the first aspect, in a third implementation manner of the first aspect, in response to detecting, by the at least one processor, that a delivery resource is overtime, the performing, by the at least one processor, preset processing on the overtime delivery resource includes:

detecting, by at least one processor, whether a timeout occurs for a distributed resource;

when the at least one processor detects that the delivery resource is timed out, the at least one processor executes preset processing for the timed-out delivery resource.

With reference to the first aspect, the first implementation manner of the first aspect, the second implementation manner of the first aspect, and the third implementation manner of the first aspect, in a fourth implementation manner of the first aspect, the detecting, by the at least one processor, whether the delivery resource is timed out is implemented as:

when the distribution time of the current distribution turn of distribution tasks exceeds the total distribution time of the distribution tasks, determining, by at least one processor, distribution resources which do not execute the operation of refusing the distribution tasks, calculating the overtime time of the distribution resources which do not execute the operation of refusing the distribution tasks, and when the overtime time is greater than a preset overtime threshold, determining that the distribution resources are overtime;

when the distribution time of the current distribution turn of the distribution tasks does not exceed the total distribution time of the distribution tasks, determining, by at least one processor, distribution resources for executing the operation of refusing the distribution tasks, and in response to the fact that the distribution resources for executing the operation of refusing the distribution tasks meet a preset timeout condition, determining, by at least one processor, that the distribution resources are overtime.

With reference to the first aspect, the first implementation manner of the first aspect, the second implementation manner of the first aspect, the third implementation manner of the first aspect, and the fourth implementation manner of the first aspect, in a fifth implementation manner of the first aspect, the calculating a timeout time of the delivery resource that does not perform the operation of rejecting the delivery task is implemented as:

calculating, by at least one processor, a sum of the delivery task allocation timeout threshold and a delivery resource task visible delay corresponding to a delivery resource;

and taking the difference value between the total time length of the distribution task allocation and the sum value as the timeout time of the distribution resource which does not execute the operation of refusing the distribution task by at least one processor.

With reference to the first aspect, the first implementation manner of the first aspect, the second implementation manner of the first aspect, the third implementation manner of the first aspect, the fourth implementation manner of the first aspect, and the fifth implementation manner of the first aspect, in a sixth implementation manner of the first aspect, the preset timeout condition includes:

the operation time of the distribution resources for executing the operation of refusing the distribution tasks is longer than the sum of the distribution overtime threshold of the distribution tasks and the visible time delay of the corresponding distribution resource tasks; and the number of the first and second groups,

and all the distribution resources with the priority lower than the distribution resources execute the operation of refusing the distribution tasks.

In a second aspect, an embodiment of the present disclosure provides a distribution task assigning apparatus.

Specifically, the distribution task assigning device includes:

a determination module configured to determine, by at least one processor, a current allocation round parameter;

the distribution module is configured to distribute the distribution tasks to the distribution resources in a distribution round according to the distribution round parameter through at least one processor;

a processing module configured to perform, by at least one processor, a preset process for a timeout delivery resource in response to detecting, by the at least one processor, that a timeout occurs for the delivery resource;

With reference to the second aspect, in a first implementation manner of the second aspect, the allocating module includes:

a calculation sub-module configured to calculate, by at least one processor, a task reception priority of a currently allocated round of delivery resources;

a first allocation submodule configured to allocate, by at least one processor, a distribution resource task visible time delay for the distribution resource according to the task reception priority;

the display sub-module is configured to display the delivery tasks to be distributed to the delivery resources in a time-sharing mode according to the delivery resource task visible delay through at least one processor;

a second allocation submodule configured to allocate, by at least one processor, a corresponding delivery task to the delivery resource in response to a reception confirmation operation of the delivery resource from the at least one processor.

With reference to the second aspect and the first implementation manner of the second aspect, in a second implementation manner of the second aspect, the computing submodule is configured to:

With reference to the second aspect, the first implementation manner of the second aspect, and the second implementation manner of the second aspect, in a third implementation manner of the second aspect, the embodiment of the present invention includes:

a detection sub-module configured to detect, by at least one processor, whether a timeout occurs for a delivery resource;

and the processing submodule is configured to execute preset processing on the delivery resources overtime through the at least one processor when the delivery resources are detected to be overtime through the at least one processor.

With reference to the second aspect, the first implementation manner of the second aspect, the second implementation manner of the second aspect, and the third implementation manner of the second aspect, in a fourth implementation manner of the second aspect, the detection submodule is configured to:

With reference to the second aspect, the first implementation manner of the second aspect, the second implementation manner of the second aspect, the third implementation manner of the second aspect, and the fourth implementation manner of the second aspect, in a fifth implementation manner of the second aspect, the calculating a timeout period of the delivery resource that does not perform the operation of rejecting the delivery task is configured to:

With reference to the second aspect, the first implementation manner of the second aspect, the second implementation manner of the second aspect, the third implementation manner of the second aspect, the fourth implementation manner of the second aspect, and the fifth implementation manner of the second aspect, in a sixth implementation manner of the second aspect, the preset timeout condition includes:

In a third aspect, the disclosed embodiments provide an electronic device, including a memory and a processor, where the memory is configured to store one or more computer instructions, where the one or more computer instructions are executed by the processor to implement the method steps of the delivery task allocation method in the first aspect.

In a fourth aspect, an embodiment of the present disclosure provides a computer-readable storage medium for storing computer instructions for a delivery task assignment device, where the computer instructions are used to execute the delivery task assignment method in the first aspect to implement the delivery task assignment device.

The technical scheme provided by the embodiment of the disclosure can have the following beneficial effects:

according to the technical scheme, the distributed tasks are distributed in different rounds, and the reasonable distribution of the distributed tasks is realized by means of detection and processing of overtime distributed resources. According to the technical scheme, the matching degree between the distribution tasks and the distributors can be improved under the condition that the operation burden of the distributors is not increased, the distribution time of the distribution tasks is shortened, the communication cost is reduced, the fairness and the high efficiency of distribution of the distribution tasks are guaranteed, the distribution efficiency and the distribution quality of the distribution tasks are further guaranteed, the distribution quality of distribution resources is improved, and the service quality of an internet platform is improved.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.

Drawings

Other features, objects, and advantages of the present disclosure will become more apparent from the following detailed description of non-limiting embodiments when taken in conjunction with the accompanying drawings. In the drawings:

FIG. 1 illustrates a flow diagram of a delivery task assignment method according to an embodiment of the present disclosure;

FIG. 2 shows a flowchart of step S102 of the delivery task assignment method according to the embodiment shown in FIG. 1;

FIG. 3 shows a flowchart of step S103 of the delivery task assignment method according to the embodiment shown in FIG. 1;

fig. 4 is a block diagram showing a configuration of a distribution task assigning apparatus according to an embodiment of the present disclosure;

FIG. 5 is a block diagram illustrating the structure of an assignment module 402 of the distribution task assigning apparatus according to the embodiment shown in FIG. 4;

FIG. 6 is a block diagram showing the structure of a processing module 403 of the distribution task assigning apparatus according to the embodiment shown in FIG. 4;

FIG. 7 shows a block diagram of an electronic device according to an embodiment of the present disclosure;

FIG. 8 is a schematic block diagram of a computer system suitable for implementing a delivery task assignment method according to an embodiment of the present disclosure.

Detailed Description

Hereinafter, exemplary embodiments of the present disclosure will be described in detail with reference to the accompanying drawings so that those skilled in the art can easily implement them. Also, for the sake of clarity, parts not relevant to the description of the exemplary embodiments are omitted in the drawings.

In the present disclosure, it is to be understood that terms such as "including" or "having," etc., are intended to indicate the presence of the disclosed features, numbers, steps, behaviors, components, parts, or combinations thereof, and are not intended to preclude the possibility that one or more other features, numbers, steps, behaviors, components, parts, or combinations thereof may be present or added.

It should be further noted that the embodiments and features of the embodiments in the present disclosure may be combined with each other without conflict. The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.

The technical scheme provided by the embodiment of the disclosure realizes reasonable distribution of the distribution tasks by setting the distribution of the distribution tasks in different rounds and by means of detection and processing of overtime distribution resources. According to the technical scheme, the matching degree between the distribution tasks and the distributors can be improved under the condition that the operation burden of the distributors is not increased, the distribution time of the distribution tasks is shortened, the communication cost is reduced, the fairness and the high efficiency of distribution of the distribution tasks are guaranteed, the distribution efficiency and the distribution quality of the distribution tasks are further guaranteed, the distribution quality of distribution resources is improved, and the service quality of an internet platform is improved.

Fig. 1 is a flowchart illustrating a distribution task allocation method according to an embodiment of the present disclosure, which may be applied to a server side. As shown in fig. 1, the distribution task allocation method includes the following steps S101 to S103:

in step S101, determining, by at least one processor, a current allocation round parameter;

in step S102, performing, by at least one processor, distributed task distribution for distributed resources according to the distribution round parameter;

in step S103, in response to detecting, by the at least one processor, that the delivery resource is overtime, executing, by the at least one processor, a preset processing value for the overtime delivery resource;

As mentioned above, with the development of internet technology, more and more merchants or service providers provide services for users through internet platforms, and many internet services require distributors to distribute, so the distribution efficiency and quality of distribution tasks are crucial to the distribution quality of the distributors and the improvement of the service quality of the internet. In the prior art, delivery tasks are generally distributed by methods such as distributing the delivery tasks, preempting the delivery tasks by a deliverer, or distributing the delivery tasks for multiple rounds, but the above processing methods have the following defects: the optimal matching between the distribution tasks and the distributors is difficult to realize, the operation burden of the distributors is increased, the task distribution time is too long, the subjective factors of the distributors are difficult to exert, and the reasonable distribution of the distribution tasks is difficult to ensure.

In view of the above-mentioned drawbacks, in this embodiment, a delivery task allocation method is proposed, which achieves reasonable allocation of delivery tasks by setting a distribution round of delivery tasks and by means of detection and processing of overtime delivery resources. According to the technical scheme, the matching degree between the distribution tasks and the distributors can be improved under the condition that the operation burden of the distributors is not increased, the distribution time of the distribution tasks is shortened, the communication cost is reduced, the fairness and the high efficiency of distribution of the distribution tasks are guaranteed, the distribution efficiency and the distribution quality of the distribution tasks are further guaranteed, the distribution quality of distribution resources is improved, and the service quality of an internet platform is improved.

In an alternative implementation manner of the embodiment, the delivery task refers to a task event that needs to be delivered and has a status change after being delivered or executed, such as an order, a service, and the like.

In an optional implementation manner of this embodiment, the distribution task allocation in rounds refers to performing multiple rounds of iterative allocation on the distribution tasks, and a distribution task that is not successfully allocated in a current round will enter a next round to be continuously allocated.

In an optional implementation manner of this embodiment, considering that in each round of distribution task allocation, the number of distribution resources participating in distribution task allocation, the number of distributable distribution tasks, and the distribution requirement of distribution tasks may all be different, therefore, in order to improve the distribution quality of distribution tasks, the distribution of each round of distribution tasks is provided with a distribution round parameter, for example, as described above, the distribution round parameter may include one or more of the following parameters: the method comprises the steps of distributing resource quantity, total distributing time of distributing tasks, overtime threshold value of distributing task distribution and visible delay of distributing resource tasks.

The distribution resource quantity refers to the quantity of the distribution resources participating in distribution of a certain round of distribution tasks; the total distribution time length of the distribution tasks refers to the distribution time length occupied by a certain distribution task, namely if the actual distribution time length of a certain distribution task exceeds the distribution time length, the distribution of the distribution task is considered to be overtime; the distribution task distribution overtime threshold is used for judging whether the time spent by a certain distribution resource for receiving the distribution task is overtime or not; the delivery resource task visible delay corresponds to the delivery resources and their priorities, and the delivery resources with different priorities share different delivery resource task visible delays, for example, the delivery resource with the highest priority is considered as the most elegant delivery resource, and should share the right of selecting the delivery task first, and if the delivery task is allocated to the excellent delivery resource, the delivery quality of the delivery task can be guaranteed, so the delivery resource task corresponding to the delivery resource with the highest priority has the shortest visible delay, that is, the delivery task to be allocated can be seen first, and similarly, the delivery resource task corresponding to the delivery resource with the lowest priority has the longest visible delay, that is, the delivery task to be allocated is seen at the latest.

In an optional implementation manner of this embodiment, the allocation round parameter may be determined by at least one processor according to a requirement of an actual application and historical data or an empirical value, and a specific value of the allocation round parameter is not specifically limited in this disclosure. For example, the amount of the delivery resources can be determined according to the actual condition of the distribution of the delivery tasks, and the total time length of the distribution of the delivery tasks, the overtime threshold of the distribution of the delivery tasks, and the visible time delay of the distribution of the resource tasks can be determined according to historical data or empirical values.

In an alternative implementation manner of this embodiment, the delivery resource refers to a resource that can be used to perform a delivery task, such as a dispenser, a delivery device, a delivery robot, and the like. The distribution resources comprise distribution resources which provide exclusive distribution service for a certain merchant or service provider, and crowd-sourced distribution resources which provide distribution service for a plurality of merchants or service providers and flexibly undertake distribution tasks of different merchants or service providers according to the requirements of different merchants or service providers.

In an optional implementation manner of this embodiment, as shown in fig. 2, the step S102, that is, the step of performing, by at least one processor, round-by-round distribution of the distribution tasks to the distribution resources according to the distribution round parameter, includes the following steps S201 to S204:

in step S201, calculating, by at least one processor, a task reception priority of a current allocation round of distribution resources;

in step S202, allocating, by at least one processor, a delivery resource task visible delay to the delivery resource according to the task reception priority;

in step S203, displaying, by at least one processor, to-be-allocated delivery tasks to delivery resources in a time-sharing manner according to the delivery resource task visible delay;

in step S204, in response to a reception confirmation operation of the delivery resource from the at least one processor, a corresponding delivery task is allocated to the delivery resource by the at least one processor.

In the round-robin distribution of distribution tasks to distribution resources by at least one processor, in order to ensure that excellent distribution resources can receive as many distribution tasks as possible and that distribution tasks are distributed to as many excellent distribution resources as possible, in the implementation:

firstly, calculating and determining a task receiving priority of distribution resources participating in distribution of the task in the current round by at least one processor, wherein the task receiving priority is used for representing the distribution quality of the distribution resources, and the higher the task receiving priority is, the higher the distribution quality of the distribution resources is.

Then, allocating, by at least one processor, a delivery resource task visible delay to the delivery resources according to the task reception priorities, where, as described above, the delivery resource with the highest priority is considered to be the most elegant delivery resource, and should have the right to select the delivery task first, and if the delivery task is allocated to the excellent delivery resource, the delivery quality of the delivery task can be guaranteed to the greatest extent, so that the delivery resource task visible delay corresponding to the delivery resource with the highest priority is the shortest, that is, the delivery task to be allocated can be seen first, and similarly, the delivery resource task visible delay corresponding to the delivery resource with the lowest priority is the longest, that is, the delivery task to be allocated is seen latest.

And then, displaying the distribution tasks to be distributed to the distribution resources in a time-sharing manner through at least one processor according to the visible time delay of the distribution resource tasks, waiting for the selection of the distribution resources and confirming the receiving of the distribution tasks.

Finally, in response to a receipt confirmation operation of the dispatch resource from the at least one processor, the at least one processor selects and confirms the received dispatch task to be assigned to the dispatch resource.

In an optional implementation manner of this embodiment, the step S202, that is, the step of calculating, by at least one processor, a task receiving priority of a currently allocated round of resource delivery, may be implemented as:

In this implementation, in order to determine a task reception priority of a distributed resource, first determining, by at least one processor, a calculation criterion of the priority, i.e., a distributed resource task reception priority element and a weight corresponding to the distributed resource task reception priority element; and then, calculating the priority value of the current distribution turn distribution resource by at least one processor according to the distribution resource task receiving priority element and the weight thereof.

In an optional implementation manner of this embodiment, the delivery resource task receiving priority element refers to an element that can reflect the delivery quality of the delivery resource and affect the priority degree of the delivery resource receiving delivery task, for example, historical delivery evaluation in a preset historical time period, historical average delivery duration in the preset historical time period, historical delivery number in the preset historical time period, historical daily average delivery number in the preset historical time period, and the like. In an optional implementation manner of this embodiment, the preset historical time period may be set and selected according to the needs of practical applications and the characteristics of the distribution data, and this disclosure does not specifically limit this.

In an optional implementation manner of this embodiment, a weight corresponding to the delivery resource task reception priority element may be set according to an importance degree of each delivery resource task reception priority element, and the more important the delivery resource task reception priority element is, the higher the corresponding weight is.

In an optional implementation manner of this embodiment, after determining, by the at least one processor, the priority element and the weight thereof for receiving the resource distribution task, the priority value of the resource distribution task in the current distribution turn may be obtained by calculating, by the at least one processor, according to an actual value and the weight thereof corresponding to each element and according to a weighted average method.

In an alternative implementation manner of this embodiment, as shown in fig. 3, the step S103 of, in response to detecting, by the at least one processor, that the delivery resource is timed out, executing, by the at least one processor, a preset process for the timed-out delivery resource includes the following steps S301 to S302:

in step S301, detecting, by at least one processor, whether a time-out occurs for a distributed resource;

in step S302, when it is detected by at least one processor that a time-out of a delivery resource occurs, a preset process is performed by at least one processor for the time-out of the delivery resource.

In an optional implementation manner of this embodiment, the preset processing may be, for example, penalty processing such as reducing the priority of the delivery resource, reducing the weight corresponding to the delivery resource task receiving priority element, and the like.

In view of the fact that the delivery resources with overtime operation extend the task allocation time and reduce the allocation quality of the delivery tasks, in this implementation, when the at least one processor detects that the delivery resources have overtime, the at least one processor performs preset processing such as punishment on the delivery resources with overtime operation, so as to reduce the number of times of the delivery resource operation overtime operation. When the preset processing is executed by at least one processor, different preset processing can be performed according to timeout data of the distribution resources, where the timeout data may include one or more of the following data: the method includes the steps of distributing resources on the same day, distributing resources within a preset time period, and the like, for example, if the number of the resources distributed on the same day exceeds a first preset number threshold, reducing a first preset amplitude of a priority of the resources distributed on the same day or the next day, if the number of the resources distributed on the same day exceeds a second preset number threshold, it indicates that the resources are frequently operated overtime, reducing a second preset amplitude of the priority of the resources distributed on the same day, the next day, or a future period, and the like, wherein the first preset number threshold is smaller than the second preset number threshold, and the first preset amplitude is smaller than the second preset amplitude.

In an optional implementation manner of this embodiment, the step S301, that is, the step of detecting, by at least one processor, whether the time-out occurs to the distributed resource, may be implemented as:

In this implementation, the following two timeout cases are mainly considered:

in case 1, if a certain distribution task in the current distribution turn is overtime, that is, the distribution time of the distribution task exceeds the total distribution time of the distribution task, it is respectively determined whether a distribution resource that does not perform a denial operation in the distribution process of the distribution task is overtime, for example, the overtime of the distribution resource that does not perform the denial operation is calculated, and if the overtime is greater than a preset overtime threshold, it is determined that the distribution resource is overtime.

In an optional implementation manner of this embodiment, the calculating of the timeout time of the dispatch resource that does not perform the rejection operation may be implemented as:

In an optional implementation manner of this embodiment, the preset timeout threshold may be set according to a requirement of an actual application and a characteristic of the timeout time, which is not specifically limited by this disclosure.

Assuming that the total distribution time length of distribution tasks in a certain distribution turn is denoted by sum _ t, a distribution task distribution timeout threshold is denoted by min _ t, the number of distribution resources distributed by the distribution tasks in the turn is k bits, k is a natural number, and a distribution resource task visible delay of a distribution resource j with a j-th priority is denoted by t (j), wherein j is a sequence number of the distribution resources in descending order according to the priority, 0< j ═ k, t (1) ═ 0, t (j) < ═ t (j +1), a preset timeout threshold is set to th _ t, and for the distribution tasks distributed with timeout, the timeout time de _ t (j) of the distribution resource j without executing rejection operation is calculated according to the following formula:

de_t(j)＝sum_t–(min_t+t(j))。

for example, assuming that the total time length of the distribution tasks in a certain distribution round is set to 60 seconds, and the distribution task distribution timeout threshold is set to 35 seconds, the number of the distribution resources allocated to the distribution tasks in the round is 5 bits, where the distribution resource task visible delay t (1) of the distribution resource 1 having the first priority is 0 second, the distribution resource task visible delay t (2) of the distribution resource 2 having the second priority is 10 seconds, the distribution resource task visible delay t (3) of the distribution resource 3 having the third priority is 15 seconds, the distribution resource task visible delay t (4) of the distribution resource 4 having the fourth priority is 20 seconds, the distribution resource task visible delay t (5) of the distribution resource 5 having the fifth priority is 25 seconds, the preset timeout threshold is set to 0 seconds, and if the distribution task in the distribution round is overtime, and none of the delivery resources 2, 3, and 4 perform a deny operation, then the timeout times for the delivery resources 2, 3, and 4 are calculated, respectively: since the timeout time of the delivery resource 2 is 60 seconds- (35 seconds +10 seconds) — 15 seconds, the timeout time of the delivery resource 3 is 60 seconds- (35 seconds +20 seconds) — 5 seconds, and the timeout time of the delivery resource 4 is 60 seconds- (35 seconds +25 seconds) — 0 seconds, it is determined that the delivery resource 2 and the delivery resource 3 have timed out because both the timeout time 15 seconds of the delivery resource 2 and the timeout time 5 seconds of the delivery resource 3 exceed the preset timeout threshold value 0 seconds, and the timeout time 0 seconds of the delivery resource 4 does not exceed the preset timeout threshold value, and then preset processing such as penalty is performed on the delivery resource 2 and the delivery resource 3.

In the above-described implementation, in order to shorten the task allocation time and improve the allocation quality of the delivery tasks, penalty processing is performed only for delivery resources whose operations have timed out, and no penalty is performed for delivery resources for which a denial operation has been performed.

And 2, even if a certain delivery task in the current distribution turn is not overtime, that is, the distribution time of the delivery task does not exceed the total distribution time of the delivery task, but all the delivery resources execute the operation of rejecting the delivery task in the distribution process of the delivery task, it is necessary to determine whether the delivery resources with overtime rejection exist, for example, the time of the operation of rejecting the delivery resources is longer than the sum of the distribution overtime threshold of the delivery task and the visible time delay of the corresponding delivery resource task, and the delivery resources with priorities lower than that of the delivery resources execute the operation of rejecting the delivery task, so that the delivery resources also consider that the operation is overtime.

Still by way of example, assuming that the total time length of the distribution tasks in a certain distribution round is set to 60 seconds, and the distribution task distribution timeout threshold is set to 35 seconds, the number of the distribution resources allocated to the distribution tasks in the round is 5, where the distribution resource task visible delay t (1) of the distribution resource 1 having the first priority is 0 seconds, the distribution resource task visible delay t (2) of the distribution resource 2 having the second priority is 10 seconds, the distribution resource task visible delay t (3) of the distribution resource 3 having the third priority is 15 seconds, the distribution resource task visible delay t (4) of the distribution resource 4 having the fourth priority is 20 seconds, the distribution resource task visible delay t (5) of the distribution resource 5 having the fifth priority is 25 seconds, the preset timeout threshold is set to 0 seconds, and if the distribution task in the distribution round does not timeout, however, all the distributed resources execute the denial operation, and it is assumed that the time for each distributed resource to execute the denial operation is: delivery resource 1: second 20, deliver resource 2: second 50, deliver resource 3: second 30, deliver resource 4: second 45, deliver resource 5: and the 47 th second, namely, the delivery resources 1, 3, 4, 5 and 2 successively execute rejection operations, at this time, because the time when the delivery task finishes the distribution is 50 th second, which is less than the total distribution time of the delivery task by 60 seconds, no timeout occurs, but because the operation time of the delivery resources 2 is 50 seconds, which is greater than the sum 45 seconds between the 35 seconds of the distribution timeout threshold of the delivery task and the 10 seconds of the visible delay of the corresponding delivery resource task, the delivery resources 2 are overtime, and the overtime rejection operations of the delivery resources 2 increase the distribution time of the whole delivery task, therefore, preset processing such as punishment and the like is also executed on the delivery resources 2 having the overtime rejection operations.

The following are embodiments of the disclosed apparatus that may be used to perform embodiments of the disclosed methods.

Fig. 4 is a block diagram illustrating a distribution task assigning apparatus according to an embodiment of the present disclosure, which may be implemented as part or all of an electronic device, and may be implemented as a server side by software, hardware, or a combination of the two. As shown in fig. 4, the delivery task assigning apparatus includes:

a determining module 401 configured to determine, by at least one processor, a current allocation round parameter;

an allocation module 402 configured to perform, by at least one processor, a task distribution round for distributing resources according to the distribution round parameter;

a processing module 403 configured to execute, by the at least one processor, a preset processing value for the overtime delivery resource in response to detecting, by the at least one processor, that the delivery resource is overtime;

In view of the above-mentioned drawbacks, in this embodiment, a delivery task assignment device is proposed that achieves reasonable assignment of delivery tasks by setting a minute round assignment of delivery tasks and by means of detection and processing of overtime delivery resources. According to the technical scheme, the matching degree between the distribution tasks and the distributors can be improved under the condition that the operation burden of the distributors is not increased, the distribution time of the distribution tasks is shortened, the communication cost is reduced, the fairness and the high efficiency of distribution of the distribution tasks are guaranteed, the distribution efficiency and the distribution quality of the distribution tasks are further guaranteed, the distribution quality of distribution resources is improved, and the service quality of an internet platform is improved.

In an optional implementation manner of this embodiment, as shown in fig. 5, the allocating module 402 includes:

a calculation submodule 501 configured to calculate, by at least one processor, a task reception priority of a currently allocated round of delivery resources;

a first assignment submodule 502 configured to assign, by at least one processor, a delivery resource task visible delay to the delivery resource according to the task reception priority;

a display sub-module 503 configured to time-divisionally display, by at least one processor, the delivery tasks to be allocated to the delivery resources according to the delivery resource task visible delay;

a second allocation sub-module 504 configured to allocate, by at least one processor, a corresponding delivery task to the delivery resource in response to a receipt confirmation operation of the delivery resource from the at least one processor.

the calculating sub-module 501 calculates and determines, by at least one processor, a task receiving priority of the distribution resources participating in the distribution of the task in the current round, where the task receiving priority is used to characterize the distribution quality of the distribution resources, and the higher the task receiving priority is, the higher the distribution quality of the distribution resources is.

The first allocating module 502 allocates the delivery resource task visible time delay for the delivery resource according to the task receiving priority, wherein, as described above, the delivery resource with the highest priority is considered as the most elegant delivery resource, and should have the right to select the delivery task first, and the delivery task can guarantee the delivery quality of the delivery task to the greatest extent if allocated to the excellent delivery resource, so the delivery resource task corresponding to the delivery resource with the highest priority has the shortest visible time delay, that is, the delivery task to be allocated can be seen first, and similarly, the delivery resource task corresponding to the delivery resource with the lowest priority has the longest visible time delay, that is, the delivery task to be allocated is seen latest.

The display sub-module 503 displays the to-be-distributed tasks to the distribution resources in a time-sharing manner according to the visible time delay of the distribution resource tasks through at least one processor, waits for the selection of the distribution resources and confirms the reception of the distribution tasks.

The second allocation sub-module 504 selects and confirms, by the at least one processor, the received delivery tasks to be allocated to the delivery resources in response to the reception confirmation operation of the delivery resources from the at least one processor.

In an optional implementation manner of this embodiment, the first allocating sub-module 502 may be configured to:

In an optional implementation manner of this embodiment, as shown in fig. 6, the processing module 403 includes:

a detection sub-module 601 configured to detect, by at least one processor, whether a time-out occurs for a delivery resource;

a processing sub-module 602 configured to, when the occurrence of the timeout of the delivery resource is detected by the at least one processor, perform, by the at least one processor, a preset process for the delivery resource that has timed out.

In view of the fact that the delivery resources operating overtime extend the task allocation time and reduce the allocation quality of the delivery tasks, in this implementation, when the at least one processor detects that the delivery resources have overtime, the processing module 403 executes a preset process such as a penalty on the delivery resources operating overtime by the at least one processor to reduce the number of times the delivery resources have overtime. When the preset processing is executed by at least one processor, different preset processing can be performed according to timeout data of the distribution resources, where the timeout data may include one or more of the following data: the method includes the steps of distributing resources on the same day, distributing resources within a preset time period, and the like, for example, if the number of the resources distributed on the same day exceeds a first preset number threshold, reducing a first preset amplitude of a priority of the resources distributed on the same day or the next day, if the number of the resources distributed on the same day exceeds a second preset number threshold, it indicates that the resources are frequently operated overtime, reducing a second preset amplitude of the priority of the resources distributed on the same day, the next day, or a future period, and the like, wherein the first preset number threshold is smaller than the second preset number threshold, and the first preset amplitude is smaller than the second preset amplitude.

In an optional implementation manner of this embodiment, the detection sub-module 601 may be configured to:

In this implementation, the following two timeout cases are mainly considered:

In an optional implementation manner of this embodiment, the portion of the timeout time of the dispatch resource for which the rejection operation is not performed may be configured to:

de_t(j)＝sum_t–(min_t+t(j))。

The present disclosure also discloses an electronic device, fig. 7 is a block diagram of a structure of an electronic device according to an embodiment of the present disclosure, and as shown in fig. 7, the electronic device 700 includes a memory 701 and a processor 702; wherein the content of the first and second substances,

the memory 701 is used to store one or more computer instructions, which are executed by the processor 702 to implement the above-described method steps.

As shown in fig. 8, the computer system 800 includes a Central Processing Unit (CPU)801 which can execute various processes in the above-described embodiments according to a program stored in a Read Only Memory (ROM)802 or a program loaded from a storage section 808 into a Random Access Memory (RAM) 803. In the RAM803, various programs and data necessary for the operation of the system 800 are also stored. The CPU801, ROM802, and RAM803 are connected to each other via a bus 804. An input/output (I/O) interface 805 is also connected to bus 804.

The following components are connected to the I/O interface 805: an input portion 806 including a keyboard, a mouse, and the like; an output section 807 including a signal such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 808 including a hard disk and the like; and a communication section 809 including a network interface card such as a LAN card, a modem, or the like. The communication section 809 performs communication processing via a network such as the internet. A drive 810 is also connected to the I/O interface 805 as necessary. A removable medium 811 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 810 as necessary, so that a computer program read out therefrom is mounted on the storage section 808 as necessary.

In particular, the above described methods may be implemented as computer software programs, according to embodiments of the present disclosure. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a medium readable thereby, the computer program comprising program code for performing the above-described delivery task assignment method. In such an embodiment, the computer program may be downloaded and installed from a network via the communication section 809 and/or installed from the removable medium 811.

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowcharts or block diagrams may represent a module, a program segment, or a portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The units or modules described in the embodiments of the present disclosure may be implemented by software or hardware. The units or modules described may also be provided in a processor, and the names of the units or modules do not in some cases constitute a limitation of the units or modules themselves.

As another aspect, the present disclosure also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the apparatus in the above-described embodiment; or it may be a separate computer readable storage medium not incorporated into the device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the methods described in the present disclosure.

The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention in the present disclosure is not limited to the specific combination of the above-mentioned features, but also encompasses other embodiments in which any combination of the above-mentioned features or their equivalents is possible without departing from the inventive concept. For example, the above features and (but not limited to) the features disclosed in this disclosure having similar functions are replaced with each other to form the technical solution.

Claims

1. A delivery task allocation method, comprising:

determining, by at least one processor, a current allocation round parameter;

2. The distribution task allocation method according to claim 1, wherein the performing, by the at least one processor, distribution task distribution round allocation for distribution resources according to the distribution round parameter includes:

3. The delivery task assignment method of claim 2, wherein the calculating, by the at least one processor, the task reception priority of the currently assigned round of delivery resources is implemented as:

4. The delivery task assignment method of claim 1, wherein the performing, by the at least one processor, a preset process for the delivery resources that are overtime in response to detecting, by the at least one processor, that the delivery resources are overtime comprises:

5. A delivery task assigning apparatus, comprising:

6. The delivery task assignment device of claim 5, wherein the assignment module comprises:

7. The delivery task assignment device of claim 6, wherein the computation submodule is configured to:

8. The delivery task assignment device of claim 5, wherein the processing module comprises:

9. An electronic device comprising a memory and a processor; wherein the memory is configured to store one or more computer instructions, wherein the one or more computer instructions are executed by the processor to implement the method steps of any of claims 1-4.

10. A computer-readable storage medium having stored thereon computer instructions, characterized in that the computer instructions, when executed by a processor, carry out the method steps of any of claims 1-4.