CN114240301A

CN114240301A - Task processing method and device, electronic equipment and storage medium

Info

Publication number: CN114240301A
Application number: CN202111574703.1A
Authority: CN
Inventors: 王江波
Original assignee: Beijing Jingdong Zhenshi Information Technology Co Ltd
Current assignee: Beijing Jingdong Zhenshi Information Technology Co Ltd
Priority date: 2021-12-21
Filing date: 2021-12-21
Publication date: 2022-03-25

Abstract

The embodiment of the invention discloses a task processing method, a task processing device, electronic equipment and a storage medium, wherein the task processing method comprises the following steps: acquiring task information of a current distribution task, wherein the task information comprises the distribution amount of a target article at each distribution point in a plurality of distribution points; determining a preset area where each distribution point is located, and generating a target distribution path corresponding to each preset area according to the distribution points in each preset area; generating target distribution tasks according to the distribution amount of each target distribution path and distribution points on the corresponding target distribution path; and determining the distribution personnel configured for each target distribution path, and sending the corresponding target distribution tasks to the terminals of the distribution personnel. The embodiment of the invention can reduce the labor cost and the error rate and improve the task processing efficiency.

Description

Task processing method and device, electronic equipment and storage medium

Technical Field

The embodiment of the invention relates to computer technology, in particular to a task processing method and device, electronic equipment and a storage medium.

Background

When shopping in groups, in order to save operation cost, a dispatcher selects a plurality of different distribution points to form a distribution path through a table or map selection tool based on distribution amount, full load rate, transportation distance and other elements, assigns a driver for each distribution path, and carries out serial point distribution of each distribution path by the driver. In the process of implementing the invention, the inventor finds that the method of relying on manual wiring and assigning distribution personnel has high labor cost, low efficiency and high error rate.

Disclosure of Invention

The embodiment of the invention provides a task processing method and device, electronic equipment and a storage medium, which can reduce labor cost and error rate and improve task processing efficiency.

In a first aspect, an embodiment of the present invention provides a task processing method, including:

acquiring task information of a current distribution task, wherein the task information comprises distribution amount of a target object at each distribution point in a plurality of distribution points;

determining a preset area where each distribution point is located, and generating a target distribution path corresponding to each preset area according to the distribution points in each preset area;

generating target distribution tasks according to the distribution amount of each target distribution path and distribution points on the corresponding target distribution path;

and determining the distribution personnel configured for each target distribution path, and sending the corresponding target distribution tasks to the terminals of the distribution personnel.

In a second aspect, an embodiment of the present invention provides a task processing apparatus, where the apparatus includes:

the system comprises an acquisition module, a distribution module and a processing module, wherein the acquisition module is used for acquiring task information of a current distribution task, and the task information comprises the distribution amount of a target object at each distribution point in a plurality of distribution points;

the route generation module is used for determining a preset area where each distribution point is located and generating a target distribution route corresponding to each preset area according to the distribution points in each preset area;

the task generation module is used for generating target distribution tasks according to the distribution amount of each target distribution path and the distribution points on the corresponding target distribution path;

and the determining module is used for determining the distribution personnel configured for each target distribution path and sending the corresponding target distribution tasks to the terminals of the distribution personnel.

In a third aspect, an embodiment of the present invention further provides an electronic device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the task processing method according to any one of the embodiments of the present invention when executing the program.

In a fourth aspect, the embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, and the computer program, when executed by a processor, implements the task processing method according to any one of the embodiments of the present invention.

In the embodiment of the invention, the task information of the current distribution task can be acquired, wherein the task information comprises the distribution amount of the target object at each distribution point in a plurality of distribution points; determining a preset area where each distribution point is located, and generating a target distribution path corresponding to each preset area according to the distribution points in each preset area; generating target distribution tasks according to the distribution amount of each target distribution path and distribution points on the corresponding target distribution path; and determining the distribution personnel configured for each target distribution path, and sending the corresponding target distribution tasks to the terminals of the distribution personnel. In the embodiment of the invention, the distribution points belonging to each preset area can be automatically identified through the pre-divided areas (namely the preset areas), each distribution path is automatically generated according to the distribution points in each preset area, the distribution personnel configured for each distribution path are determined, the distribution tasks corresponding to the distribution paths are sent to the corresponding distribution personnel to realize distribution, and the whole wiring and personnel configuration can be automatically realized by a machine, so that manual wiring and distribution personnel assignment are not needed, the labor cost is reduced, the task processing efficiency is improved, and the error rate is reduced.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present invention and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained according to the drawings without inventive efforts.

FIG. 1 is a flowchart illustrating a task processing method according to an embodiment of the present invention;

FIG. 2 is another schematic flow chart diagram of a task processing method according to an embodiment of the present invention;

FIG. 3 is a schematic structural diagram of a task processing device according to an embodiment of the present invention;

FIG. 4 is a schematic structural diagram of a task processing system according to an embodiment of the present invention;

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

Detailed Description

The present invention will be described in further detail with reference to the accompanying drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting of the invention. It should be further noted that, for the convenience of description, only some of the structures related to the present invention are shown in the drawings, not all of the structures.

Before the method of the embodiment of the present invention is introduced, a group shopping warehouse allocation mode is introduced, and the group shopping warehouse allocation mode adopted by the current mainstream platform is a four-level warehouse allocation mode of "shared warehouse-central warehouse-grid station-store (self-service point)". In this allocation mode, the order fulfillment process of group shopping is as follows: the supplier puts the goods into the sharing bin, after the platform is sold, the sharing bin can send the sold goods to the central bin, centralized sorting is carried out through the central bin, the goods are sorted to the grid station by the central bin, the goods are sorted to the store by the grid station, and the goods are sorted to the user by the manager corresponding to the store. In a distribution area, a central warehouse may radiate 40-70 grid stations, and a single grid station may cover about 500 stores.

In the stage of delivering goods from a grid station to a store, in the prior art, a dispatcher usually performs group-point wiring on the goods and assigns a driver for delivery in a manual operation mode, which is inefficient, cannot timely deal with a large number of orders, is prone to error in the case of large order quantity, and in addition, needs to set a special dispatching post, which is high in labor cost.

In view of these problems, the embodiment of the present invention provides a corresponding solution, as shown in fig. 1, fig. 1 is a schematic flow chart of a task processing method provided by the embodiment of the present invention, and the method can be executed by a task processing device provided by the embodiment of the present invention, and the device can be implemented in a software and/or hardware manner. In a particular embodiment, the apparatus may be integrated in an electronic device, which may be, for example, a computer or a server. The following embodiments will be described by taking as an example that the apparatus is integrated in an electronic device, and referring to fig. 1, the method may specifically include the following steps:

step 101, task information of a current distribution task is obtained, wherein the task information comprises distribution amount of a target object at each distribution point in a plurality of distribution points.

For example, the method provided by the embodiment of the invention can be applied to a group shopping scene, and particularly can be applied to a stage of delivering group shopping items from a grid station to a store. The distribution point in the embodiment of the invention can be understood as a store, a group purchase point or a self-service point, and the position of the distribution point can be determined by a manager in group shopping.

For example, the current delivery task may be understood as a delivery task for delivering the target item from the grid station to each delivery point, and the current delivery task may be obtained by a group purchase order; the target object may be a group purchase object, the target object may include one or more, and the target object may be, for example, a vegetable, a fruit, a snack, an appliance, etc., and is not particularly limited herein; for convenience of description, the embodiments of the present invention will be described by taking a target article as an example. The task information of the current delivery task includes the delivery amount of the target item at each of the plurality of delivery points, and the delivery amount may be the weight, volume, number, and the like of the delivered target item.

For example, taking the target item as X, a specific task information may be shown in table 1 below:

distribution point	Amount of delivery
		Distribution point 1	Y1
Distribution point 2	Y2
		……	……
Distribution point M	YN

TABLE 1

As shown in table 1, that is, the current distribution task involves M distribution points, and the distribution amounts of the target item X at the M distribution points are Y1, Y2, and … … YN in sequence, where M, N is an integer greater than 2.

Step 102, determining a preset area where each distribution point is located, and generating a target distribution path corresponding to each preset area according to the distribution points in each preset area.

In a specific implementation, the coverage area of each grid station may be partitioned in advance, for example, the coverage area of each grid station may be partitioned into a plurality of small areas according to the size of the coverage area of each grid station, historical transaction data of users in the coverage area of each grid station, and the like, where each small area is a preset area.

After determining the plurality of delivery points to which the current delivery task relates, a preset area in which each delivery point is located may be determined. Specifically, the position information of each distribution point may be acquired, and the position information of each preset area may be acquired, where the position information of each preset area may be a set of position information, and the position information may be coordinate information; determining the attribution relationship between the position information of each distribution point and the position information set of each preset area, and determining the preset area where each distribution point is located according to the attribution relationship; that is, if the location information of a certain delivery point belongs to the location information set of a certain preset area, it is determined that the delivery point belongs to the preset area.

After the preset area where each distribution point is located is determined, a target distribution path corresponding to each preset area may be generated according to the distribution points in each preset area. For example, all the distribution points in each preset area may be sequentially connected to generate a target distribution path corresponding to each preset area. In a specific embodiment, in order to reduce the delivery time and improve the delivery efficiency, when determining the target delivery path corresponding to each preset area, a delivery path with the shortest delivery distance may be generated for each preset area according to the location information of the delivery point in each preset area, and the delivery path with the shortest delivery distance in each preset area is taken as the corresponding target delivery path.

Step 103, generating a target delivery task according to each target delivery path and the delivery amount of the delivery point on the corresponding target delivery path.

For example, a target delivery path may generate a target delivery task, and the target delivery task may include the target delivery path and delivery amounts of delivery points on the target delivery path.

And 104, determining the distribution personnel configured for each target distribution path, and sending the corresponding target distribution tasks to the terminals of the distribution personnel.

In a specific implementation, a delivery person may be configured for each preset area in advance, so as to generate a preset configuration table, where the delivery person may be a driver, a transport member, or the like, and there may be one or more delivery persons configured for one preset area, which may be determined according to actual needs. For example, the delivery person may be allocated to each preset area according to the facility transportation performance of the delivery person, the familiarity with the manager, the familiarity with each preset area, and the like. A specific preset configuration table may be shown in table 2 below, for example:

grid station	Distribution personnel
		A predetermined area 1	Distribution personnel A
Predetermined area 2	Distribution personnel B
		A predetermined area 3	Distribution personnel C
Predetermined area 4	Distribution personnel D

TABLE 2

As shown in table 2, the coverage area of the current grid station includes 4 preset areas, and the configurator of the 4 preset areas is a distributor a, a distributor B, a distributor C, and a distributor D.

It should be noted that the data in tables 1 and 2 are only examples, and do not limit the implementation of the actual scheme.

After the item label distribution paths are obtained, the preset area corresponding to each target distribution path can be determined, and distribution personnel configured for each target distribution path are obtained by inquiring the preset configuration table based on the preset area corresponding to each target distribution path. After the delivery personnel are determined, the corresponding target delivery tasks may be sent to the terminals of the delivery personnel.

For example, when a preset area corresponding to a certain entry label delivery path is a preset area 2, the lookup table 2 may obtain that the delivery person configured by the target delivery path is a delivery person B, and then the corresponding target delivery task may be sent to the terminal of the delivery person B, so that the delivery person B delivers the target item to each delivery point on the target delivery path.

In the embodiment of the invention, the distribution points belonging to each preset area can be automatically identified through the pre-divided areas (namely the preset areas), each distribution path is automatically generated according to the distribution points in each preset area, the distribution personnel configured for each distribution path are determined, the distribution tasks corresponding to the distribution paths are sent to the corresponding distribution personnel to realize distribution, and the whole wire arrangement and personnel configuration can be automatically realized by a machine, so that the manual wire arrangement and the distribution personnel assignment are not needed, the labor cost is reduced, the task processing efficiency is improved, and the error rate is reduced.

The task processing method provided by the embodiment of the present invention is further described below, and as shown in fig. 2, the method may include the following steps:

step 201, task information of a current distribution task is obtained, wherein the task information includes a distribution amount of a target object at each distribution point of a plurality of distribution points.

For example, the current delivery task may be understood as a delivery task for delivering the target item from the grid station to each delivery point, and the task information of the current delivery task includes a delivery amount of the target item at each of the plurality of delivery points, where the delivery amount may be a weight, a volume, a quantity, and the like of the delivered target item.

In step 202, distribution points whose distribution amounts do not belong to the single distribution amount section are removed from the plurality of distribution points.

For example, the single delivery amount section may be a section made up of the maximum delivery amount and the minimum delivery amount of the single delivery point. For convenience of management, the same single-point distribution volume interval may be set for all distribution points. In the embodiment of the invention, for improving the rationality of path planning and the distribution efficiency, a single-point distribution volume interval can be set according to historical experience or actual conditions, and for a plurality of distribution points related to the current distribution task, distribution points of which the distribution volume does not belong to the single-point distribution volume interval are deleted from the distribution points, namely, distribution points of which the distribution volume is too much (such as exceeding the maximum distribution volume) or too little (such as being lower than the minimum distribution volume) are deleted; for the deleted delivery points, the delivery of the articles at the delivery points can be manually planned, for example, for the delivery points whose delivery volume exceeds the maximum delivery volume, a special delivery person can be arranged to deliver the articles at the delivery point; step 203 may be further performed for the distribution points remaining after the deletion.

Step 203, determining the preset area where each distribution point is located according to the position information of each distribution point and the position information of each preset area.

For each distribution point remaining after the distribution point of which the distribution amount does not belong to the single-point distribution amount interval is deleted, position information of each distribution point can be acquired, and position information of each preset area can be acquired, wherein the position information of each preset area can be a position information set, and the position information can be coordinate information; determining the attribution relationship between the position information of each distribution point and the position information set of each preset area, and determining the preset area where each distribution point is located according to the attribution relationship; that is, if the location information of a certain delivery point belongs to the location information set of a certain preset area, it is determined that the delivery point belongs to the preset area.

And 204, sequentially connecting the distribution points in each preset area to generate a candidate distribution path corresponding to each preset area.

For example, a distribution path with the shortest distribution distance may be planned for each area according to the location information of the distribution points in each preset area, and the distribution path with the shortest distribution distance in each area is taken as a corresponding candidate distribution path, where each candidate distribution path is composed of several distribution points.

Step 205, determining the total delivery amount of the corresponding candidate delivery route according to the delivery amount of the delivery point on the candidate delivery route corresponding to each preset area.

Specifically, the delivery amounts of the delivery points on each candidate delivery path may be accumulated to obtain the total delivery amount of each candidate delivery path.

Step 206, determining whether the total delivery amount of each candidate delivery route exceeds the single-line delivery amount threshold, executing step 207 for the candidate delivery routes with the total delivery amount exceeding the single-line delivery amount threshold, and executing step 208 for the candidate delivery routes with the total delivery amount not exceeding the single-line delivery amount threshold.

For example, the single-line delivery amount threshold may be a maximum delivery amount for a single delivery path. For ease of management, the same single-line delivery amount threshold may be set for all delivery paths. In the embodiment of the invention, in order to avoid overload of single-line distribution and improve the rationality of distribution planning, the single-line distribution amount threshold value can be set according to historical experience or actual conditions, and after each candidate distribution path is obtained, whether the distribution total amount of each candidate distribution path exceeds the single-line distribution amount threshold value or not can be determined.

And step 207, deleting the distribution points from the candidate distribution paths according to a preset rule until the total distribution amount of the candidate distribution paths does not exceed the single-line distribution amount threshold value, and obtaining corresponding target distribution paths.

For example, for candidate distribution paths whose total distribution amount exceeds the single-line distribution amount threshold, some distribution points may be deleted from each candidate distribution path at random, or some distribution points may be deleted from each candidate distribution path according to a certain rule (for example, a distribution point with a smaller distribution amount is preferentially deleted, or a distribution point with a larger distribution amount is preferentially deleted), so that the total distribution amount of these candidate distribution paths does not exceed the single-line distribution amount threshold, thereby obtaining the corresponding target distribution path.

In step 208, the candidate delivery routes are determined as corresponding target delivery routes.

That is, for a candidate delivery route whose total delivery amount does not exceed the single-line delivery amount threshold, the candidate delivery route may be directly determined as the corresponding target delivery route.

After determining the delivery path of each item label, the delivery path of each item label can be provided to the dispatcher for confirmation, and if the dispatcher confirms that the flat cable is correct, the process goes to step 209; if the scheduling personnel think the winding displacement is not suitable, can adjust the automatic winding displacement result or directly carry out artifical winding displacement.

Step 209 is to generate a target delivery task according to the delivery volume of each target delivery path and the delivery points on the corresponding target delivery path.

Step 210, determining a preset area corresponding to each target distribution route.

For example, a target delivery path may correspond to a preset area.

Step 211, querying a preset configuration table based on a preset region corresponding to each target distribution path to obtain a distribution worker configured for each target distribution path, and sending a corresponding target distribution task to a terminal of the distribution worker.

For example, the preset configuration table may be preset, and the preset configuration table may include distribution personnel configured for each preset area. After the delivery personnel are determined, the corresponding target delivery tasks may be sent to the terminals of the delivery personnel.

In addition, if the delivery personnel configured for a certain entry label delivery path cannot be obtained by inquiring the preset configuration table, the delivery personnel can be configured for the target delivery path in a manual scheduling mode.

In the embodiment of the invention, the distribution points belonging to each preset area can be automatically identified through the pre-divided areas (namely the preset areas), each distribution path is automatically generated according to the distribution points in each preset area, the distribution personnel configured for each distribution path are determined by the preset configuration table, the distribution tasks corresponding to the distribution paths are sent to the corresponding distribution personnel to realize distribution, and the whole wire arrangement and personnel configuration can be automatically realized by a machine, so that the manual wire arrangement is not needed and the distribution personnel are assigned, the task processing is standardized, the fixity of the wire arrangement and the distribution personnel is improved, the labor cost is reduced, the task processing efficiency is improved, and the error rate is reduced.

The following describes a task processing method provided by an embodiment of the present invention with a specific example:

for example, a target article is a group shopping item X, a single-point distribution amount interval is [10, 100], a single-line distribution amount threshold is 2000, and an area covered by a current grid station includes an area 1, an area 2 and an area 3, for example, a certain group shopping order relates to the distribution amount of the group shopping item X at 50 group points (the group points are marked as 1-50), and the distribution amounts of the group shopping item X at different group points can be different. For the group purchase order, when the group purchase item X is delivered from the grid station to each group point, the following may be specifically used:

(1) from the 50 cluster points, cluster points whose delivery amount exceeds the range of [10, 100] are deleted first, and for example, if the delivery amount of cluster point 15 is 120 pieces, the delivery amount of cluster point 28 is 5 pieces, and the delivery amounts of cluster point 15 and cluster point 28 do not belong to the section [10, 100], cluster point 15 and cluster point 28 can be deleted.

(2) For the remaining 48 cluster points, the preset area to which each cluster point belongs may be determined according to the position information of each cluster point and the position information of each preset area, and since the area covered by the current mesh station includes area 1, area 2 and area 3, here, it is determined to which area of area 1, area 2 and area 3 each cluster point belongs. Specifically, the electronic fence of which preset region each cluster point falls into can be determined according to the position information, so that the preset region to which each cluster point belongs can be determined according to the determination condition. For example, if the group points 1 to 20 (not including the group point 15) fall into the fence of the area 1, it is determined that the group points 1 to 20 belong to the area 1, and if the group points 21 to 40 (not including the group point 28) fall into the fence of the area 2, it is determined that the group points 21 to 40 belong to the area 2, and if the group points 41 to 50 fall into the fence of the area 3, it is determined that the group points 41 to 50 belong to the area 3.

(3) The distribution route candidates 1 corresponding to the area 1 are obtained by connecting the cluster points 1 to 20 (not including the cluster point 15) in the area 1, the distribution route candidates 2 corresponding to the area 2 are obtained by connecting the cluster points 21 to 40 (not including the cluster point 28) in the area 2, and the distribution route candidates 3 corresponding to the area 3 are obtained by connecting the cluster points 41 to 50 in the area 3.

(4) The total delivery amount of the candidate delivery routes 1 is obtained by accumulating the delivery amounts of the cluster points 1 to 20 (not including the cluster point 15) on the candidate delivery routes 1, the total delivery amount of the candidate delivery routes 2 is obtained by accumulating the delivery amounts of the cluster points 21 to 40 (not including the cluster point 28) on the candidate delivery routes 2, and the total delivery amount of the candidate delivery routes 3 is obtained by accumulating the delivery amounts of the cluster points 41 to 50 on the candidate delivery routes 3. If the total delivery amount of the candidate delivery routes 2 and 3 is not more than 2000 and the total delivery amount of the candidate delivery route 1 is more than 2000, some cluster points, such as cluster points 3 and 5, can be randomly deleted from the cluster points 1 to 20 (not including cluster point 15) on the candidate delivery route 1, and after deletion, the sum of the delivery amounts of the remaining cluster points 1 to 20 (not including cluster points 3, 5 and 15) on the candidate delivery route is not more than 2000, and then the candidate delivery route 1 after deletion of the cluster points 3 and 5 is determined as the target delivery route 1, that is, the target delivery route 1 includes the cluster points 1 to 20 (not including cluster points 3, 5 and 15); since the total delivery amount of the candidate delivery routes 2 and 3 does not exceed 2000, the candidate delivery route 2 can be directly determined as the target delivery route 2, the target delivery route 2 includes the cluster points 21 to 40 (does not include the cluster point 28), the candidate delivery route 3 can be determined as the target delivery route 3, and the target delivery route 3 includes the cluster points 41 to 50.

(5) The target delivery task 1 is generated from the delivery amounts of the group points on the target delivery route 1 and the target delivery route 1, the target delivery task 2 is generated from the delivery amounts of the group points on the target delivery route 2 and the target delivery route 2, and the target delivery task 3 is generated from the delivery amounts of the group points on the target delivery route 3 and the target delivery route 3. Assuming that the distribution staff disposed corresponding to the areas 1, 2, and 3 are the distribution staff A, B, C, the target distribution task 1 may be sent to the distribution staff a because the target distribution route 1 corresponds to the area 1; since the target distribution route 2 corresponds to the area 2, the target distribution task 2 can be sent to the distributor B; since the target delivery route 3 corresponds to the area 3, the target delivery task 3 can be sent to the delivery person C. After receiving the distribution task, the corresponding distributor can distribute the group shopping items X to the corresponding group points according to the detailed information of the distribution task.

Further, for deleted cluster points, the distribution of items for these cluster points may be planned manually.

Fig. 3 is a block diagram of a task processing device according to an embodiment of the present invention, which is suitable for executing a task processing method according to an embodiment of the present invention. As shown in fig. 3, the apparatus may specifically include:

an obtaining module 301, configured to obtain task information of a current distribution task, where the task information includes a distribution amount of a target object at each distribution point of a plurality of distribution points;

a path generating module 302, configured to determine a preset region where each distribution point is located, and generate a target distribution path corresponding to each preset region according to the distribution point in each preset region;

a task generating module 303, configured to generate a target distribution task according to each target distribution path and a distribution amount of a distribution point on the corresponding target distribution path;

a determining module 304, configured to determine a delivery person configured for each target delivery path, and send the corresponding target delivery task to a terminal of the delivery person.

In one embodiment, the apparatus further comprises:

a deleting module, configured to remove, from the multiple distribution points, a distribution point whose distribution amount does not belong to the single point distribution amount interval before the path generating module 302 determines the preset area where each distribution point is located.

In an embodiment, the determining, by the path generating module 302, a preset area where each delivery point is located includes:

and determining the preset area where each distribution point is located according to the position information of each distribution point and the position information of each preset area.

In an embodiment, the generating module 302 generates the target distribution route corresponding to each preset area according to the distribution point in each preset area, including:

sequentially connecting the distribution points in each preset area to generate a candidate distribution path corresponding to each preset area;

and generating a corresponding target distribution path according to the candidate distribution path corresponding to each preset area.

In an embodiment, the generating module 302 generates the corresponding target delivery route according to the candidate delivery route corresponding to each preset region, including:

determining the total delivery amount of the corresponding candidate delivery paths according to the delivery amount of the delivery points on the candidate delivery paths corresponding to each preset area;

deleting distribution points from the candidate distribution paths according to a preset rule aiming at the candidate distribution paths with the distribution total amount exceeding the single-line distribution amount threshold value until the distribution total amount of the candidate distribution paths does not exceed the single-line distribution amount threshold value, and obtaining corresponding target distribution paths; and

and determining the candidate delivery paths as corresponding target delivery paths for the candidate delivery paths with the total delivery amount not exceeding the single-line delivery amount threshold.

In one embodiment, the determining module 304 determines the distribution personnel configured for each target distribution path, including:

determining a preset area corresponding to each target distribution path;

and inquiring a preset configuration table based on the preset region corresponding to each target distribution path to obtain distribution personnel configured for each target distribution path, wherein the preset configuration table comprises the distribution personnel configured for each preset region.

and generating a distribution path with the shortest distribution distance according to the position information of the distribution points in each preset area to obtain a target distribution path corresponding to each preset area.

It is obvious to those skilled in the art that, for convenience and simplicity of description, the foregoing division of the functional modules is merely used as an example, and in practical applications, the above function distribution may be performed by different functional modules according to needs, that is, the internal structure of the device is divided into different functional modules to perform all or part of the above described functions. For the specific working process of the functional module, reference may be made to the corresponding process in the foregoing method embodiment, which is not described herein again.

The device of the embodiment of the invention can acquire the task information of the current distribution task, wherein the task information comprises the distribution amount of the target object at each distribution point in a plurality of distribution points; determining a preset area where each distribution point is located, and generating a target distribution path corresponding to each preset area according to the distribution points in each preset area; generating target distribution tasks according to the distribution amount of each target distribution path and distribution points on the corresponding target distribution path; and determining the distribution personnel configured for each target distribution path, and sending the corresponding target distribution tasks to the terminals of the distribution personnel. In the embodiment of the invention, the distribution points belonging to each preset area can be automatically identified through the pre-divided areas (namely the preset areas), each distribution path is automatically generated according to the distribution points in each preset area, the distribution personnel configured for each distribution path are determined, the distribution tasks corresponding to the distribution paths are sent to the corresponding distribution personnel to realize distribution, and the whole wire arrangement and personnel configuration can be automatically realized, so that the manual wire arrangement and the distribution personnel assignment are not needed, the labor cost is reduced, the task processing efficiency is improved, and the error rate is reduced.

The embodiment of the present invention further provides an electronic device, which includes a memory, a processor, and a computer program that is stored in the memory and can be run on the processor, and when the processor executes the program, the task processing method provided in any of the above embodiments is implemented.

The embodiment of the invention also provides a computer readable medium, on which a computer program is stored, and the program is executed by a processor to implement the task processing method provided by any one of the above embodiments.

An embodiment of the present invention further provides a task processing system, as shown in fig. 4, including an electronic device 401 and a terminal 402, where the electronic device 401 is configured to execute the task processing method provided in the embodiment of the present invention, generate a target delivery task after the execution, and send the target delivery task to the terminal 402, the terminal 402 may include multiple terminals, and specific processing flows and interactions in the electronic device 401 and the terminal 402 may refer to the description of the foregoing embodiment, and are not described herein again.

Referring now to FIG. 5, shown is a block diagram of a computer system 500 suitable for use in implementing an electronic device of an embodiment of the present invention. The electronic device shown in fig. 5 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.

As shown in fig. 5, the computer system 500 includes a Central Processing Unit (CPU)501 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. In the RAM 503, various programs and data necessary for the operation of the system 500 are also stored. The CPU 501, ROM 502, and RAM 503 are connected to each other via a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.

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

In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 509, and/or installed from the removable medium 511. The computer program performs the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 501.

It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.

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 invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or 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 or flowchart illustration, and combinations of blocks in the block diagrams 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 modules and/or units described in the embodiments of the present invention may be implemented by software, and may also be implemented by hardware. The described modules and/or units may also be provided in a processor, and may be described as: a processor includes an acquisition module, a path generation module, a task generation module, and a determination module. Wherein the names of the modules do not in some cases constitute a limitation of the module itself.

As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise:

acquiring task information of a current distribution task, wherein the task information comprises distribution amount of a target object at each distribution point in a plurality of distribution points; determining a preset area where each distribution point is located, and generating a target distribution path corresponding to each preset area according to the distribution points in each preset area; generating target distribution tasks according to the distribution amount of each target distribution path and distribution points on the corresponding target distribution path; and determining the distribution personnel configured for each target distribution path, and sending the corresponding target distribution tasks to the terminals of the distribution personnel.

According to the technical scheme of the embodiment of the invention, the task information of the current distribution task can be obtained, wherein the task information comprises the distribution amount of the target object at each distribution point in a plurality of distribution points; determining a preset area where each distribution point is located, and generating a target distribution path corresponding to each preset area according to the distribution points in each preset area; generating target distribution tasks according to the distribution amount of each target distribution path and distribution points on the corresponding target distribution path; and determining the distribution personnel configured for each target distribution path, and sending the corresponding target distribution tasks to the terminals of the distribution personnel. In the embodiment of the invention, the distribution points belonging to each preset area can be automatically identified through the pre-divided areas (namely the preset areas), each distribution path is automatically generated according to the distribution points in each preset area, the distribution personnel configured for each distribution path are determined, the distribution tasks corresponding to the distribution paths are sent to the corresponding distribution personnel to realize distribution, and the whole wire arrangement and personnel configuration can be automatically realized, so that the manual wire arrangement and the distribution personnel assignment are not needed, the labor cost is reduced, the task processing efficiency is improved, and the error rate is reduced.

The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A task processing method, comprising:

2. The task processing method according to claim 1, further comprising, before determining the preset area where each delivery point is located:

and removing the distribution points of which the distribution amount does not belong to the single distribution amount section from the plurality of distribution points.

3. The task processing method according to claim 1, wherein the determining a preset area in which each delivery point is located comprises:

4. The task processing method according to claim 1, wherein the generating of the target delivery path corresponding to each preset area according to the delivery point in each preset area comprises:

5. The task processing method according to claim 4, wherein the generating of the corresponding target delivery route according to the candidate delivery route corresponding to each preset region comprises:

6. The task processing method according to any one of claims 1 to 5, wherein the determining of the delivery person configured for each target delivery route includes:

determining a preset area corresponding to each target distribution path;

and inquiring a preset configuration table based on the preset region corresponding to each target distribution path to obtain distribution personnel configured for each target distribution path, wherein the preset configuration table comprises the distribution personnel respectively configured for each preset region.

7. The task processing method according to any one of claims 1 to 5, wherein the generating of the target delivery route corresponding to each preset area according to the delivery point in each preset area includes:

8. A task processing apparatus, comprising:

9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the task processing method according to any one of claims 1 to 7 when executing the program.

10. A computer-readable storage medium, on which a computer program is stored, characterized in that the program, when executed by a processor, implements a task processing method according to any one of claims 1 to 7.