CN111724090B

CN111724090B - Method, device, equipment and storage medium for processing receiving and dispatching task

Info

Publication number: CN111724090B
Application number: CN201910218106.1A
Authority: CN
Inventors: 王婧; 李文军
Original assignee: SF Technology Co Ltd
Current assignee: SF Technology Co Ltd
Priority date: 2019-03-21
Filing date: 2019-03-21
Publication date: 2024-02-27
Anticipated expiration: 2039-03-21
Also published as: CN111724090A

Abstract

The application discloses a method, a device, equipment and a storage medium for processing a receiving and dispatching task. The method comprises the following steps: the method comprises the steps of obtaining destination addresses of delivery tasks and/or delivery tasks, converting the destination addresses into longitude and latitude information, constructing a cost matrix by utilizing the longitude and latitude information, constructing a cost function according to the cost matrix, minimizing the cost function as an objective function, solving the objective function to obtain execution sequence results of the delivery tasks and/or the delivery tasks, and sending the execution sequence results to a mobile terminal. According to the technical scheme, the server sends the execution sequence result to the receiving and dispatching personnel, so that the situations of detour, repeated route and the like can be effectively avoided.

Description

Method, device, equipment and storage medium for processing receiving and dispatching task

Technical Field

The invention relates to the technical field of logistics, in particular to a method, a device, equipment and a storage medium for processing a receiving and dispatching task.

Background

In recent years, the internet has rapidly developed, and derivative electronic commerce is also becoming more and more popular, and online shopping is accepted by most people. With the pressure of the express logistics, the traditional express logistics mode can not meet the current production and living requirements. In the warehouse picking stage of logistics, traditional manual picking is gradually replaced by warehouse robot picking, intelligent warehouses have been studied in a large number, and intelligent warehouses equipped with Kiva robots by Amazon corporation have brought great benefit. And the timeliness of the express delivery directly influences the satisfaction of customers as an end link of the logistics, and the delivery link is a key for checking the level and quality of the express service.

At present, when an express delivery person dispatches a task, most of the express delivery person relies on personal preference or fixed sequence to process all routes for completing the receiving and delivering task, so that the delivering sequence and the delivering route are not optimal solutions, and conditions of missing, detouring, repeated route, overtime of the task and the like are easy to occur.

Disclosure of Invention

In view of the foregoing drawbacks or shortcomings in the prior art, it is desirable to provide a solution for receiving and dispatching task route processing.

In a first aspect, an embodiment of the present application provides a method for processing a receiving and dispatching task, where the method includes:

the method comprises the steps of obtaining dispatch task and/or receipt task information, wherein the dispatch task and/or receipt task information comprises the following steps: a destination address;

converting the destination address into longitude and latitude information;

constructing a cost matrix by utilizing the longitude and latitude information;

and constructing a cost function according to the cost matrix, minimizing the cost function as an objective function, solving the objective function to obtain an execution sequence result of the dispatch task and/or the receipt task, and sending the execution sequence result to the mobile terminal.

In a second aspect, an embodiment of the present application provides a device for processing a receiving and dispatching task, where the device includes:

the acquiring unit is used for acquiring the dispatching task and/or the receiving task information, wherein the dispatching task and/or the receiving task information comprises the following steps: a destination address;

the conversion unit is used for converting the destination address into longitude and latitude information;

the construction unit is used for constructing a cost matrix by utilizing the longitude and latitude information;

and the solving unit is used for constructing a cost function according to the cost matrix, minimizing the cost function as an objective function, solving the objective function to obtain the execution sequence result of the delivery task and/or the receiving task, and sending the execution sequence result to the mobile terminal.

In a third aspect, embodiments of the present application provide a computer device comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing a method as described in embodiments of the present application when the program is executed.

In a fourth aspect, embodiments of the present application provide a computer-readable storage medium having stored thereon a computer program for:

the computer program, when executed by a processor, implements a method as described in embodiments of the present application.

According to the receiving and dispatching task processing method, the destination address of the dispatching task and/or the receiving task is obtained, the destination address is converted into longitude and latitude information, a cost matrix is built by using the longitude and latitude information, a cost function is built according to the cost matrix, the cost function is minimized to be an objective function, the objective function is solved to obtain an execution sequence result of the dispatching task and/or the receiving task, and the execution sequence result is sent to the mobile terminal. According to the technical scheme, the server sends the execution sequence result to the receiving and dispatching personnel, so that the situations of detour, repeated route and the like can be effectively avoided.

Further, after the execution results of the delivery tasks and/or the delivery tasks are obtained, new delivery tasks and/or delivery tasks are dynamically inserted into the unfinished parts in the execution sequence results, and further, for the newly added orders on the real-time line, the newly added orders and the remaining delivery tasks and/or delivery tasks are required to be re-routed together, so that timeliness of the tasks is effectively guaranteed.

And after the execution sequence result is sent to the mobile terminal, the to-be-completed receiving and dispatching task is updated in real time, so that the optimal management of the receiving and dispatching task is realized.

Drawings

Other features, objects and advantages of the present application will become more apparent upon reading of the detailed description of non-limiting embodiments, made with reference to the following drawings, in which:

fig. 1 is a flow chart illustrating a method for processing a receiving and dispatching task according to an embodiment of the present application;

fig. 2 is a flow chart illustrating a method for processing a receiving and dispatching task according to another embodiment of the present application;

FIG. 3 illustrates an exemplary block diagram of an apparatus 300 for receiving dispatch task processing in accordance with one embodiment of the present application;

FIG. 4 illustrates an exemplary block diagram of an apparatus 400 for receiving dispatch task processing according to yet another embodiment of the present application;

fig. 5 shows a schematic diagram of a computer system suitable for implementing the terminal device of the embodiments of the present application.

Detailed Description

The present application is described in further detail below with reference to the 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 noted that, for convenience of description, only the portions related to the invention are shown in the drawings.

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

Referring to fig. 1, fig. 1 shows a flowchart of a method for processing a delivery task according to an embodiment of the present application, where the method is applied to processing a delivery task path of an courier.

As shown in fig. 1, the method includes:

step 110, obtaining the dispatch task and/or the receipt task information, where the dispatch task and/or the receipt task information includes: a destination address;

step 120, converting the destination address into longitude and latitude information;

step 130, constructing a cost matrix by using longitude and latitude information;

and 140, constructing a cost function according to the cost matrix, minimizing the cost function as an objective function, solving the objective function to obtain the execution sequence result of the delivery task and/or the receiving task, and sending the execution sequence result to the mobile terminal.

The obtaining of the delivery task and/or the delivery task information a refers to a destination route that the delivery person reaches all delivery task sites and express delivery collection and distribution points, and may be expressed as:

A＝{a0、a1、……、at、at+1}

wherein a0, a1, … …, at, at+1 are routes for the consignee to reach various express delivery task sites and express delivery collection and distribution points.

The method and the device are applied to the processing of the receiving and dispatching task path, and after a series of processing, the execution sequence result is sent to the mobile terminal. In the prior art, when the courier dispatches the task, most of the courier processes all the routes for completing the receiving and dispatching task according to personal preference or fixed sequence, so that the dispatching sequence and the dispatching route are not optimal solutions, and the conditions of missing, detour, repeated route, overtime of the task and the like are easy to occur.

In order to solve the problems that in the prior art, the order and the route of the delivery are not optimal, so that missing of the delivery, detouring, repeated route and overtime of the task are easy to occur, the embodiment of the application provides a delivery task processing method. According to the method, destination addresses of the delivery tasks and/or the receiving tasks are obtained, the destination addresses are converted into longitude and latitude information, a cost matrix is constructed by utilizing the longitude and latitude information, a cost function is constructed according to the cost matrix, the cost function is minimized to be an objective function, the objective function is solved to obtain execution sequence results of the delivery tasks and/or the receiving tasks, and the execution sequence results are sent to the mobile terminal.

In the application, the server first acquires information of a delivery task and/or a receiving task, as shown in the following table:

destination address	Number of bill of fortune	Work number
			XXXXA town 1 village	D00001	0001
XXXXA town 2 village XStore	D00002	0001
			Zhen1 village XX middle school	D00003	0001
Town 2 village	D00004	0001
			……	……	……

After the information of the delivery task and/or the receiving task is obtained, the information of the destination address is segmented and keywords are extracted by using a natural language processing technology, wherein the information comprises district information such as province/city/district/county/town/village, street information such as road/street, interest points such as school/district/square, and the like, and GIS service is requested to improve accuracy of returning longitude and latitude according to the extracted interest points serving as auxiliary conditions, as shown in the following table:

destination address	Sheet area	Point of interest	Destination longitude and latitude	Sheet areaLongitude and latitude
					* Town 1 village	Town 1 village		(lng1,lat1)	(lngi,lati)
* Town a 2 village X store	Town 2 village	* Store-like	(lng2,lat2)	(lngj,latj)
					* Zhen1 village XX middle school	Town 1 village	* Middle school	(lng3,lat3)	(lngk,latk)
* Town 2 village	Town 2 village		(lng4,lat4)	(lngj,latj)
					……	……	……	……	……

After the latitude and longitude of the destination are obtained, the execution sequence set of the dispatcher reaching all the dispatching task sites and the express collection and distribution sites can be obtained.

Calculating a path from the network point, returning to the network point after passing through each to-be-visited sheet area once and only once, and using data as follows:

let a cost matrix (distance/time) D (i, j): the visiting cost between any two places, such as the distance from 1 village (i) in town A to 2 village (j) in town A is 10 km, the navigation time is 30 minutes,

if a distance cost matrix is used, D (i, j) =10, and if a time cost matrix is used, D (i, j) =30

Departure net point (origin)

The specific algorithm is as follows:

step 1: an initial solution is obtained by using a greedy algorithm, namely, each time a place closest to a current point is selected from the places to be visited, each time a place to be visited is visited, the place to be visited is removed from the places to be visited until the number of places to be visited is 0, namely, all the visits are completed, the corresponding visiting sequence is obtained by returning the net points, namely, x0 epsilon D, xb=x0, P=N (xb), the current total cost C (xb) is calculated based on a cost matrix, D is a definition domain of a problem, xb is used for recording the optimal solution to a target position, and P is a neighborhood of xb

Step 2: adjusting the solution by using a local search algorithm by k=0, setting the number of loops=k until the number of loops is reached or P is empty, otherwise, performing the following loops

Begin

k＝k+1；

end

Outputting a result calculation result;

and (5) ending.

And when the server solves the optimal execution sequence result through the objective function, the server simultaneously sends the optimal execution sequence result to the mobile terminal. The dispatcher processes according to the execution sequence result on the mobile terminal, so that the situations of detour, route repetition and the like can be effectively avoided.

In the embodiment of the present application, the obtaining of the sending task and/or the receiving task information may be, for example, by copying through a removable hard disk. Or by a special network transmission mode, and can also be realized by other data transfer modes of a transfer server.

In order to receive a new task at any time to make a route processing again, referring to fig. 2, fig. 2 is a flow chart illustrating a method for processing a receiving and dispatching task according to another embodiment of the present application.

As shown in fig. 2, the method includes:

step 210, obtaining the dispatch task and/or the receipt task information, where the dispatch task and/or the receipt task information includes: a destination address;

specifically, in the embodiment of the present application, it is required to obtain destination addresses of the dispatch tasks and/or the receiving tasks first, where the destination addresses include at least two types, for example, obtain destination addresses of each dispatch task and/or receiving task or obtain destination addresses of the dispatch tasks and/or receiving tasks after packaging.

It should be noted that the destination address may be a specific address name (XXXXA town 1 village) or latitude and longitude information (lng 1, lat 1)

Step 220, converting the destination address into longitude and latitude information;

specifically, a dispatcher of a logistics company sends all logistics address information of one logistics process to a specified database through a network by using terminal equipment, and then the mobile terminal acquires all logistics address information of all logistics processes in one day uploaded by each dispatcher from the database, calculates longitude and latitude information of all acquired logistics address information according to a preset algorithm using an electronic map and all logistics address information, and stores the calculated longitude and latitude information back to the database.

It should be noted that, the terminal device may be implemented by a network host, a single network server, or a plurality of network server sets. It will be appreciated by those skilled in the art that the above-described terminal devices are merely examples, and that other terminal devices, now known or later developed, may be suitable for use in the present application and are intended to be included within the scope of the present application and are incorporated herein by reference.

In step 230, a cost matrix is constructed using the latitude and longitude information.

Optionally, as an implementation of step 230, the cost matrix includes a time cost matrix and/or a distance cost matrix. For example, a town 1 village (i) to a town 2 village (j) is 10 km apart, the navigation time is 30 minutes, 10 if a distance cost matrix is used, and 30 if a time cost matrix is used.

Step 240, solving the objective function according to a greedy algorithm to obtain an initial solution.

Specifically, the greedy algorithm in this application refers to a simpler, more rapid design technique for solving some of the problems that are optimal. The greedy method design algorithm is characterized in that the greedy method design algorithm is carried out step by step, the optimal selection is usually carried out according to a certain optimization measure based on the current situation, various possible overall situations are not considered, a large amount of time which is needed to be consumed for finding the optimal solution is omitted, the greedy method is adopted to make successive greedy selections in an iterative method from top to bottom, the required problem is simplified into a sub-problem with smaller scale by making greedy selections every time, an optimal solution of the problem can be obtained by making greedy selections every step, and although local optimal solutions are guaranteed to be obtained every step, the global solutions generated by the greedy method are sometimes not necessarily optimal, so that the greedy method does not need backtracking.

For the embodiment of the application, when a greedy algorithm is applied, a place closest to a current point is selected from the remaining places to be visited each time, the place is removed from the places to be visited each time the visit is finished until the number of places to be visited is 0, namely, the visit is completed completely, the corresponding visit sequence is calculated as x0 epsilon D, xb=x0, P=N (xb) by returning to the network points, the current total cost C (xb) is calculated based on a cost matrix, D is a definition domain of a problem, xb is used for recording an optimal solution to a target position, and P is a neighborhood of xb.

And 250, adjusting the initial solution according to a local search algorithm to obtain an optimal solution, wherein the optimal solution is used as an execution sequence result of the delivery task and/or the receiving task.

Specifically, the local search algorithm in the present application refers to: and searching at each initial point to find out the respective optimal solution. And selecting a best result from the optimal solutions as a final result. For this embodiment, after the initial solutions are obtained, searching is performed according to each initial solution, so as to find the respective optimal sequence, and finally, the final result is searched from the respective optimal sequence and sent to the mobile terminal.

Step 260, when obtaining the new receiving task and/or sending task, dynamically inserting the new receiving task and/or sending task into the unfinished part in the execution sequence result to obtain the updated execution sequence result.

Specifically, the server in the application supports new delivery task access in the delivery process, and after the server accesses the newly generated delivery task information, the newly generated delivery task information is added into a to-be-completed list to perform preprocessing and re-processing routes, as shown in the following table

Destination address	Order number	Work number
			* C town 3 village	P00001	0001
* Village 2 village government	P00002	0001
			……	……	……

Updated to-be-completed task list

Destination address	Number of bill of fortune	Work number	Sequential order	Predicted completion time
					* Town 1 village	D00001	0001	1	T1
* Town 2 village	D00004	0001	2	T2
					* Town 2 village	D00002	0001	3	T3
* Town 2 village government	P00001	0001	4	T4
					* B town 1 village middle school	D00003	0001	5	T5
* C town 3 village	P00002	0001	6	T6
					……	……	……	……	……

By re-planning the execution sequence route, the timeliness of receiving the file can be effectively ensured.

Optionally, as an implementation manner of the step 260, after the execution sequence result is obtained, the execution sequence result may be displayed through a display, so as to facilitate viewing by a receiver.

It should be noted that although the operations of the method of the present invention are depicted in the drawings in a particular order, this does not require or imply that the operations must be performed in that particular order or that all of the illustrated operations be performed in order to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step to perform, and/or one step decomposed into multiple steps to perform.

Further, referring to fig. 3, fig. 3 illustrates an exemplary block diagram of an apparatus 300 for receiving and dispatching task processing, which is applied to the processing of the courier receiving and dispatching task path according to an embodiment of the present application.

As shown in fig. 3, the apparatus includes:

the obtaining unit 310 is configured to obtain information of a delivery task and/or a delivery task, where the information of the delivery task and/or the delivery task includes: a destination address;

a conversion unit 320, configured to convert the destination address into latitude and longitude information;

a construction unit 330, configured to construct a cost matrix using latitude and longitude information;

and the solving unit 340 is configured to construct a cost function according to the cost matrix, minimize the cost function as an objective function, solve the objective function to obtain an execution sequence result of the delivery task and/or the receiving task, and send the execution sequence result to the mobile terminal.

A＝{a0、a1、……、at、at+1}

destination address	Number of bill of fortune	Work number
			XXXXA town 1 village	D00001	0001
XXXXA town 2 village X store	D00002	0001
			Zhen1 village XX middle school	D00003	0001
Town 2 village	D00004	0001
			……	……	……

Departure net point (origin)

The specific algorithm is as follows:

Begin

k＝k+1；

end

Outputting a result calculation result;

and (5) ending.

To receive new tasks at any time for re-routing, an exemplary block diagram of an apparatus 400 for receiving dispatch task processing is provided in accordance with yet another embodiment of the present application with reference to FIG. 4.

As shown in fig. 4, the apparatus includes:

the obtaining unit 410 is configured to obtain information of a delivery task and/or a delivery task, where the delivery task and/or the delivery task information includes: a destination address;

A conversion unit 420, configured to convert the destination address into latitude and longitude information;

A construction unit 430, configured to construct a cost matrix using latitude and longitude information.

The selecting unit 440 is configured to solve the objective function according to a greedy algorithm to obtain an initial solution.

And the initial solution unit 450 is configured to adjust the initial solution according to a local search algorithm to obtain an optimal solution, where the optimal solution is used as an execution sequence result of the delivery task and/or the receiving task.

And the updating unit 460 is configured to dynamically insert the new receiving task and/or the sending task into the unfinished portion in the execution sequence result when the new receiving task and/or the sending task are acquired, so as to obtain an updated execution sequence result.

Updated to-be-completed task list

It should be understood that the units or modules described in the apparatuses 300-400 correspond to the various steps in the methods described with reference to fig. 1-2. Thus, the operations and features described above with respect to the methods are equally applicable to the apparatuses 300-400 and the units contained therein, and are not described in detail herein. The apparatus 300-400 may be implemented in advance in a browser or other security application of the electronic device, or may be loaded into a browser or security application of the electronic device by means of downloading, etc. The respective units in the apparatus 300-400 may cooperate with units in an electronic device to implement aspects of embodiments of the present application.

Referring now to FIG. 5, there is illustrated a schematic diagram of a computer system 500 suitable for use in implementing a terminal device or server of an embodiment of the present application.

As shown in fig. 5, the computer system 500 includes a Central Processing Unit (CPU) 501, which 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 required for the operation of the system 500 are also stored. The CPU 501, ROM 502, and RAM 503 are connected to each other through 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 section 506 including a keyboard, a mouse, and the like; an output portion 507 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker, and the like; 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 drive 510 is also connected to the I/O interface 505 as needed. 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 needed so that a computer program read therefrom is mounted into the storage section 508 as needed.

In particular, according to embodiments of the present disclosure, the processes described above with reference to fig. 1-2 may be implemented as computer software programs or provide related processing services in the form of HTTP interfaces. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing the methods of fig. 1-2. In such an embodiment, the computer program may be downloaded and installed from a network via the communication portion 509, and/or installed from the removable media 511.

The flowcharts 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 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 application may be implemented by software, or may be implemented by hardware. The described units or modules may also be provided in a processor, for example, as: a processor includes a first sub-region generation unit, a second sub-region generation unit, and a display region generation unit. The names of these units or modules do not constitute a limitation of the unit or module itself in some cases, and for example, the display area generating unit may also be described as "a unit for generating a display area of text from the first sub-area and the second sub-area".

As another aspect, the present application also provides a computer-readable storage medium, which may be a computer-readable storage medium contained in the foregoing apparatus in the foregoing embodiment; or may be a computer-readable storage medium, alone, that is not assembled into a device. The computer-readable storage medium stores one or more programs for use by one or more processors in performing the text generation method described herein as applied to transparent window envelopes.

The foregoing description is only of the preferred embodiments of the present application and is presented as a description of the principles of the technology being utilized. It will be appreciated by persons skilled in the art that the scope of the invention referred to in this application is not limited to the specific combinations of features described above, but it is intended to cover other embodiments in which any combination of features described above or equivalents thereof is possible without departing from the spirit of the invention. Such as the above-described features and technical features having similar functions (but not limited to) disclosed in the present application are replaced with each other.

Claims

1. A method for processing a receiving and dispatching task is characterized by comprising the following steps:

acquiring a plurality of dispatch tasks and/or delivery task information, wherein each piece of dispatch task and/or delivery task information comprises a destination address, and the dispatch task and/or delivery task information refers to a destination route for a delivery person to reach all delivery task places and express delivery distribution points;

converting all the destination addresses into longitude and latitude information;

constructing a cost matrix by utilizing the longitude and latitude information;

constructing a cost function according to the cost matrix, minimizing the cost function as an objective function, solving the objective function to obtain an execution sequence result of the delivery task and/or the receiving task, and sending the execution sequence result to a mobile terminal;

the solving of the objective function to obtain the execution sequence result of the dispatch task and/or the receipt task comprises the following steps:

solving the objective function according to a greedy algorithm to obtain an initial solution;

searching each initial solution according to a local search algorithm, finding the optimal sequence of each initial solution, and obtaining an optimal solution from the optimal sequence, wherein the optimal solution is used as an execution sequence result of the dispatch task and/or the receipt task.

2. The delivery task processing method of claim 1, wherein the cost function includes a time cost matrix and/or a distance cost matrix, and constructing the cost function according to the cost matrix includes:

a time cost function and/or a distance cost function is constructed.

3. The delivery task processing method according to claim 1, wherein after solving the objective function to obtain the delivery task and/or delivery task execution sequence result, the method further comprises:

and visually presenting the execution sequence result.

4. The delivery task processing method as claimed in claim 1, further comprising:

when a new receiving task and/or a sending task is obtained, the new receiving task and/or the sending task is dynamically inserted into an unfinished part in the execution sequence result, and an updated execution sequence result is obtained.

5. A delivery task processing device, the device comprising:

the system comprises an acquisition unit, a delivery unit and a delivery unit, wherein the acquisition unit is used for acquiring a plurality of delivery tasks and/or delivery task information, each delivery task and/or delivery task information comprises a destination address, and the delivery task and/or delivery task information refers to a destination route for a delivery person to reach all delivery task places and express delivery collection and distribution points;

the conversion unit is used for converting all the destination addresses into longitude and latitude information;

the solving unit is used for constructing a cost function according to the cost matrix, minimizing the cost function as an objective function, solving the objective function to obtain an execution sequence result of the delivery task and/or the receiving task, and sending the execution sequence result to the mobile terminal;

the solving unit is specifically configured to solve the objective function according to a greedy algorithm to obtain an initial solution;

6. The delivery task processing device of claim 5, further comprising:

and the updating unit is used for dynamically inserting the new receiving task and/or sending task into the unfinished part in the execution sequence result when acquiring the new receiving task and/or sending task, so as to obtain an updated execution sequence result.

7. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method of any of claims 1-4 when the program is executed by the processor.

8. A computer readable storage medium having stored thereon a computer program for:

the computer program, when executed by a processor, implements the method of any of claims 1-4.