CN111311138A

CN111311138A - Same city express delivery method, device, equipment and storage medium

Info

Publication number: CN111311138A
Application number: CN201811513008.2A
Authority: CN
Inventors: 张骞丹; 雷紫霖; 李珂; 黄一潇; 朱光远; 刘凇瑞; 白文勇; 王振蒙
Original assignee: SF Technology Co Ltd
Current assignee: SF Technology Co Ltd
Priority date: 2018-12-11
Filing date: 2018-12-11
Publication date: 2020-06-19
Anticipated expiration: 2038-12-11
Also published as: CN111311138B

Abstract

The application discloses a method, a device, equipment and a storage medium for delivering same-city express mails, wherein the method comprises the following steps: selecting partial network points from all network points as distribution points, wherein the distribution points form a high-speed network in the same city for transporting express items in the same city, and the method comprises the following steps: dividing the distributed points into transfer points and non-transfer points, determining the mapping relation between the transfer points and the non-transfer points, and dividing different distribution areas according to the mapping relation, wherein one transfer point corresponds to one distribution area; and determining distribution tasks in the same distribution area or different distribution areas, wherein in each distribution area, the express items of the non-transit points need to be delivered to the corresponding transit points first. The method enables the express items to be gathered at the transit point, improves the loading rate of each vehicle and reduces the transportation cost.

Description

Same city express delivery method, device, equipment and storage medium

Technical Field

The invention relates to the technical field of logistics, in particular to a method, a device, equipment and a storage medium for delivering express items in the same city.

Background

At present, the same city part is basically transferred from a connection point to a network point, and then to a corresponding transfer station for transfer, which is a process from a connection network to a large network, and then back to the connection network, for example: from the overseas of Guangzhou to the white cloud, as shown in FIG. 1:

however, the current mode of mixing the same-city parts and the non-same-city parts has the following disadvantages:

1) the fixed network determines the time when the express reaches a network point and a transit station, and the transfer of the express is concentrated on the time point of the transfer of the network point, so that the flood peak of the express can appear no matter at the network point or the transit station;

2) in order to meet the operation requirement of express peak, human resources and equipment are input according to the peak period, so that the waste of the human resources and the equipment capacity in the off-peak time period is caused;

3) the resource utilization rate is low, the collecting and dispatching process is complex, the time consumed by buckling the ring is too long, and a high-aging product cannot be supported;

4) on the premise of continuous increase of the quantity of the parts, in order to meet the demand of collection and dispatch, the network points can only be increased or separated continuously, but the acquisition of the appropriate network point address in a first-line city is difficult;

5) some of the same-city parts are not large, but the urban area is wide, so that the parts in the same flow direction cannot be gathered on one vehicle or a few vehicles, and the transportation cost is high.

Disclosure of Invention

In view of the above-mentioned shortcomings or drawbacks of the prior art, it is desirable to provide a method, device, apparatus and storage medium for delivering couriers.

In order to overcome the defects of the prior art, the technical scheme provided by the invention is as follows:

in a first aspect, the present invention provides a method for delivering in-town express mails, which is characterized in that the method comprises:

selecting partial screen points from all screen points as collecting and distributing points,

the distributed points form a city high-speed network for transporting city-level express mails, and the distributed points comprise:

dividing the distributed points into transfer points and non-transfer points, determining the mapping relation between the transfer points and the non-transfer points, and dividing different distribution areas according to the mapping relation, wherein one transfer point corresponds to one distribution area;

and determining distribution tasks in the same distribution area or different distribution areas, wherein in each distribution area, the express items of the non-transit points need to be delivered to the corresponding transit points first.

Further, whether the time length required by each distribution task from the starting point to the end point is less than or equal to the length of a time window is judged,

if the duration is less than or equal to the length of the time window, taking the transit point as a splitting point to split each distribution task into different sub-distribution tasks, and combining the sub-distribution tasks with the same starting point and the same end point and the length of the overlapped part of the time window being greater than the duration of the straight-sending of the vehicle to form a new distribution task;

if the duration is greater than the time window length, reserving the distribution task of which the duration is greater than the time window length;

and converging the distribution tasks with the duration longer than the time window length and the new distribution tasks to form a new distribution task network.

And further, inputting the new distribution task network into a heuristic model of a vehicle path problem based on a time window, and stringing the new distribution task network by using a vehicle to form a final distribution scheme.

Further, the sum of the express delivery quantities carried by the vehicles of the same merged sub-delivery task does not exceed the capacity of the vehicle.

Further, the distribution tasks with the duration less than or equal to the time window length are all represented as distribution tasks passing through a non-transit point, a transit point and a non-transit point in sequence, and then the distribution tasks are divided into three sub-distribution tasks by two transit points;

and setting the length of the time window to three parts, wherein two parts are set as the time length of the straight hair of the vehicle from the non-transit point to the transit point and from the transit point to the non-transit point, and the other part is set as the time length required by the vehicle to pass through the two transit points.

Further, selecting the transit points by adopting an integer programming model and determining the mapping relation between each transit point and the non-transit point,

and when different distribution areas are divided according to the mapping relation, obtaining the distribution tasks with the least time length longer than the time window length.

Furthermore, in each distribution area, at most one transit point corresponds to six non-transit points.

Further, the objectives of the heuristic model include at least one of the following:

dividing the whole time window for operating the final distribution scheme into a plurality of same time intervals, wherein the number of the time intervals when the number of the entering and exiting vehicles exceeds the limit is minimum;

the sum of the cost of using the vehicle, the cost of the vehicle running distance and the cost of the vehicle staying is minimum when the distribution scheme is operated;

and running the delivery profile using the least number of vehicles.

In a second aspect, the present invention further provides a city express delivery device, which is characterized in that the device comprises:

a first module for selecting a portion from the mesh points as a hub and a distributor,

a second module for the hub to form a city high speed network for transporting couriers in the same city, comprising:

a first unit, configured to divide the hub and distribution point into an intermediate transfer point and a non-intermediate transfer point, determine a mapping relationship between the intermediate transfer point and the non-intermediate transfer point, and divide different distribution areas according to the mapping relationship, where one intermediate transfer point corresponds to one distribution area;

and the second unit is used for determining distribution tasks in the same distribution area or different distribution areas, and in each distribution area, the express items at the non-transit points need to be delivered to the corresponding transit points first.

In a third aspect, the present invention further provides a computer device, including a memory and a processor, where the memory stores a computer program, and is characterized in that the processor implements the method for delivering the same-city express mail when executing the computer program.

In a fourth aspect, the present invention further provides a computer-readable storage medium, on which a computer program is stored, characterized in that the computer program is executed by a processor to perform the method for delivering the same-city express mail.

Compared with the prior art, the invention has the beneficial effects that:

the invention selects a certain proportion of distributed points from all distributed points as transit points, determines the mapping relation between each transit point and a non-transit point in the distributed points, divides different distribution areas according to the mapping relation, and determines distribution tasks in the same distribution area or between different distribution areas, wherein express items of non-transit points in each distribution area are firstly conveyed to the corresponding transit points and then sent out by the transit points, so that the express items are converged at the transit points, the loading rate of each vehicle is improved, and the transportation cost is reduced.

Drawings

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

FIG. 1 is a simulation diagram of a conventional same-city express delivery mode;

fig. 2 is a schematic flow chart illustrating a method for delivering the same-city express mails according to an embodiment of the present invention;

FIG. 3 is a schematic diagram of the distribution of different distribution areas according to an embodiment of the present invention;

FIG. 4 is an exemplary diagram of a vehicle concatenation with a new distribution network in accordance with an embodiment of the present invention;

FIG. 5 is a schematic structural diagram of a city express delivery apparatus according to an embodiment of the present invention;

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

Detailed Description

The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.

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

As mentioned in the background, the current mixed model of city-sharing and non-city-sharing is a fixed network, the fixed shift determines when the express will arrive at the network site and transit, and the transfer of express is concentrated at the time point of the shift transfer, so that the flood of express will occur no matter at the network site or transit. In order to meet the operation requirement of express peak, human resources and equipment are input according to the peak period, so that the waste of the human resources and the equipment capacity in the off-peak time period is caused; the resource utilization rate is low, the collecting and dispatching process is complex, the time consumed by buckling the ring is too long, and the high-timeliness product cannot be supported. Some of the same-city parts are not large, but the urban area is wide, so that the parts in the same flow direction cannot be gathered on one vehicle or a few vehicles, and the transportation cost is high.

Referring to fig. 2, the present invention provides a method for delivering a city express, which comprises:

as shown in fig. 2, in step 210, a part of the dots are selected from all the dots as hub dots;

in step 220, the hub and distributor form a city high-speed network for transporting city-wide couriers, including:

step 221, dividing the distribution points into transit points and non-transit points, determining a mapping relation between the transit points and the non-transit points, and dividing different distribution areas according to the mapping relation, wherein one transit point corresponds to one distribution area;

step 222 determines distribution tasks in the same distribution area or between different distribution areas, in each of which the express items at the non-transit points need to be delivered to the transit points corresponding to the express items.

In one embodiment, an integer programming model is adopted to select the transit points and determine the mapping relation between each transit point and each non-transit point, and when different distribution areas are divided according to the mapping relation, distribution tasks with the least duration being longer than the length of a time window are obtained.

The specific process is as follows:

OD represents the distribution mission between any starting point O and any end point D of the cargo distribution. The delivery task means that in what time period, which transit points pass through the middle, the delivery of the express from the starting point O to the end point D is completed.

Each OD to be planned needs to provide a starting point, a terminal point, a driving distance between the starting point and the terminal point, a quantity between the starting point and the terminal point, a time window length and a hair straightening time length, wherein the time window length is a difference value between a time window starting time point and a time window ending time point.

The hair straightening time is defined as follows: and arranging the time required for a vehicle to start from the starting point, not to make any transfer on the way and to reach the terminal point.

On the basis of the information, the number of transit points is set, and then an integer programming model is used, so that the OD exceeding the time window length is better as less as possible under the assumption that all the ODs pass through the distribution points, the transit points and the distribution points in sequence.

Specifically, the process of forming this integer programming model includes two steps:

1) selecting a fixed number of transit points from the existing distributed points;

2) and determining the other distributed points, namely the transit points to which the non-transit points belong.

The constraints that the integer programming model needs to satisfy include:

1. any one of the hub and distribution points either becomes a transit point or belongs to a transit point;

2. the number of distributed points covered by each transit point is limited by an upper limit;

in one embodiment, at most six non-transit points correspond to one transit point in each distribution area.

The objective function considered by the model is the minimum overtime OD quantity, and the expression is as follows: sigma min_rw^rWherein r represents an OD, w_rIs a decision variable, w_rIs 0 or 1, for determining whether the OD exceeds the time window length, a value of 1 indicates that the OD exceeds the time window length, and a value of 0 indicates that the OD does not exceed the time window length.

As shown in fig. 3, for example, if there are 21 hub points in a city, 4 transit points are selected, and the remaining 17 points are non-transit points. And determining the non-transit point mapped by each transit point by using an integer programming model, and dividing different distribution areas according to the mapping relation.

The distributed points represented by all circles belong to the same subarea, the transfer points of the subarea are R, the non-transfer points are A, O, F, P, G, the non-transfer points are A, O, F, P and G, the goods are sent to the transfer points R firstly and then are sent out in a centralized manner by the transfer points R, so that the goods can be better gathered at the transfer points, the loading rate of each vehicle is improved, and the effect of sending the vehicle is less under the condition that the freight volume is not changed.

Referring to FIG. 3, illustrating a pair of ODs, the starting point is A, the end point is B, the time window is 780 to 900, and the time window length is 120 minutes;

the transit point corresponding to A is R, the transit point corresponding to B is S, and according to the planned route, the transit points are A to R, then to S and then to B;

if the time from A to R takes 20 minutes, the time from R to S takes 25 minutes, and the time from S to B takes 30 minutes, the duration of the route is 75 minutes;

meanwhile, as the route passes through two transit points (R, S), the two transit points need to be subjected to vehicle changing operation, and the transit time of 20 minutes is required respectively, and the total transit time is 40 minutes;

then the total time required for the route planned by us, 75+40, is 115 minutes, which is less than 120 minutes of the time window length, and the distribution time is satisfied.

Conversely, if it takes 35 minutes for R to S, i.e., the route length becomes 85 minutes, and then the 40-minute transit length is 125 minutes, a time window length of 120 minutes or more is considered to be insufficient for delivery.

In one embodiment, the same-city express distribution method further comprises the following steps:

judging whether the time length required by each distribution task from the starting point to the end point is less than or equal to the length of a time window,

In one embodiment, the distribution tasks with the time duration less than or equal to the time window length are all represented as distribution tasks passing through a non-transit point, a transit point and a non-transit point in sequence, and then the distribution tasks are divided into three sub-distribution tasks by two transit points;

The meaning of the sub-delivery task is that in what time period, the express delivery from which non-transfer point to transfer point, transfer point to transfer point or transfer point to non-transfer point is completed.

The specific process is as follows:

after the mapping relation between the transit point and the non-transit point is obtained, each OD is represented as a distribution task passing through the non-transit point, the transit point and the non-transit point in sequence, the OD with the time length from the starting point to the end point being less than or equal to the time window length is divided, the distribution task can be divided into one sub-distribution task, two sub-distribution tasks or three sub-distribution tasks according to the condition that whether the starting point or the end point is the transit point, and the OD with the time length from the starting point to the end point being greater than the time window length cannot be forcibly divided.

Let ○ denote the non-transit point, it denotes the transit point:

when OD is represented as ○ -it- ○, the OD is split into three segments;

when the range of two transit points in the OD is 0, expressing the OD as ○ -four- ○, when the range from a non-transit point to a transit point is 0, expressing the OD as four- ○, and when the range from a transit point to a non-transit point is 0, expressing the OD as ○ -four-star, and splitting the OD into two sections in all three cases;

when both the two transit points and the range from the transit point to the non-transit point are 0, OD is represented as ○ -, it is when both the range from the non-transit point to the transit point and the range from the transit point to the non-transit point are 0, OD is represented as it-, and when both the range from the non-transit point to the transit point and the range from the two transit points are 0, OD is represented as-it ○.

The split sub-distribution tasks only have three conditions, namely, from a non-transit point to a transit point, from the transit point to the transit point, and from the transit point to the non-transit point, wherein the transit point to the non-transit point, from the non-transit point to the transit point, are connection networks, and the transit point to the transit point are branch networks.

And splitting the sub-delivery tasks, selecting a time window to carry out bottom delivery according to the time windows of the sub-delivery tasks by utilizing a delivery model, aiming at merging the split sub-delivery tasks, and if the starting point and the end point are the same and the time windows can meet each other, merging as much as possible.

Carrying out vehicle dispatching with the bottom of the time window: this situation occurs mainly for sub-distribution tasks between transit points and transit points, if C and D are two transit points, there are multiple ODs that have been torn down for sub-distribution tasks from C to D, and their time windows partially coincide. Assuming that C to D is straight for 15 minutes, three pairs of ODs are removed from C to D sub-distribution tasks, and the time windows are (815, 840), (805, 825), (810, 825), respectively, then to meet the time window of the third OD, a vehicle must be dispatched at 810, even if this would result in the first OD not catching up with the vehicle, but such a dispatching schedule is still needed to guarantee the timeliness of all ODs.

In one example, the delivery vehicles are selected to be full, and the sum of the express items carried by the delivery vehicles of the same combined sub-delivery task does not exceed the capacity of the delivery vehicle.

Filling and dispatching: if multiple ODs have all broken sub-distribution tasks from A to B and their time windows are the same, for example: from 780 to 800. Meanwhile, the sum of the express items carried by the ODs does not exceed the capacity of the vehicle, the line segments can be pieced together, namely, the sub-distribution tasks of the ODs from A to B are executed by the same vehicle.

The express items of the same sub-distribution tasks between the transit points are subjected to forced convergence. According to departure and arrival time after the sub-delivery tasks are combined, the sub-delivery tasks connected with the sub-delivery tasks before splitting are combined to form a new OD for later use. The merged delivery segments are not split at a later stage, but are restored to the original OD at the stage of result processing.

In one embodiment, the distribution tasks and the new distribution tasks, the duration of which is longer than the time window from the starting point to the end point, are converged to form a new distribution task network, the new distribution task network is input into a heuristic model of a vehicle path problem based on the time window, and the new distribution task network is connected in series by vehicles to form a final distribution scheme.

And converging the formed new OD and the overtime original OD to form final OD information, putting the final OD information into a heuristic model based on a vehicle path problem with a time window, and stringing the vehicles for distribution tasks within the set time window by using the least vehicles.

As shown in fig. 4, a tandem process of vehicles is illustrated. If there are three child distribution tasks, the first child distribution task is A to B, and the time window is (780,800); the second sub-dispatching tasks B to C, with time windows (830, 863); a third sub-distribution task D to E with a time window of (900, 950); if the straight-hair time from C to D only requires 20 minutes, the three sub-delivery tasks can be strung together by the same vehicle.

Meanwhile, due to the limitation of the scale of the distributed points, each distributed point has the limitation of the number of times of entering and exiting the train in the dimension of ten minutes, and each network point cannot support a large number of train entering and exiting in a short time.

When the heuristic model operates, the heuristic model is mainly guided by the following three objective functions:

firstly, the method comprises the following steps: and limiting the number of entering and exiting vehicles within ten minutes of all the distributed points: dividing the whole time window of the operation of the newly distributed task network into a plurality of time intervals in ten minutes, counting the number of times of vehicle entering and the number of times of vehicle exiting of each distributed point in each time interval, counting the number of time intervals in which the number of times of vehicle entering exceeds three times and the number of times of vehicle exiting exceeds four times of each distributed point, counting and summing all time intervals in which the number of times of vehicle entering and exiting exceeds the limit, and obtaining the value which is as small as possible through summation.

Secondly, the method comprises the following steps: the cost is as low as possible, the cost structure of the newly distributed task network consists of three parts, namely the number of vehicles, the total mileage of all vehicles and the total number of times of the vehicle stop;

total cost is a × number of vehicles + b × total mileage + c × total number of elapsed stops

The total mileage of the vehicle represents the sum of all vehicle mileage, the total number of times of stopping represents the sum of the number of times of stopping of each vehicle at a network point, a represents the cost of one vehicle, b represents the cost of one kilometer of the vehicle, and c represents the cost of one time of stopping of the vehicle.

Thirdly, the method comprises the following steps: the number of vehicles is as small as possible, and in order to make the possibility of executing the scheme on the ground better, the mileage of each vehicle needs to be as long as possible when necessary, so that the effect of reducing the number of vehicles is achieved.

When the model runs, different constraint combinations and constraint orderings need to be tried continuously, and the domain structures in different model running stages are matched, so that the results of the three objective functions are better.

Processing and analysis of results

Splitting the new ODs formed by combining the upper layers so as to track and analyze the real route situation of each OD;

and restoring the real route condition of each OD, wherein the real route condition comprises an getting-on place and a getting-off place of each section or at most three sections after splitting, the getting-on time and the getting-off time, and the distribution section is specifically taken by which vehicle.

Fig. 5 is a schematic structural diagram of a city express delivery apparatus 500 according to an embodiment of the present invention. As shown in fig. 5, the apparatus may implement the method shown in fig. 5, and the apparatus may include:

a first module 510 for selecting a portion from the mesh points as a hub,

a second module 520, configured to enable the hub to form a high-speed city network for transporting couriers in the same city, the second module comprising:

a first unit 521, configured to divide the hub and distribution point into an intermediate transfer point and a non-intermediate transfer point, determine a mapping relationship between the intermediate transfer point and the non-intermediate transfer point, and divide different distribution areas according to the mapping relationship, where one intermediate transfer point corresponds to one distribution area;

a second unit 522, configured to determine distribution tasks in the same distribution area or between different distribution areas, in each of the distribution areas, the express items at the non-transit points need to be delivered to the corresponding transit points first.

Alternatively, the second unit 522 determines whether or not the time period required for each of the delivery tasks from the start point to the end point is equal to or less than the time window length,

Optionally, the new distribution task network is input into a heuristic model of a vehicle path problem based on a time window, and the new distribution task network is concatenated by vehicles to form a final distribution scheme.

Optionally, the sum of the express items carried by the vehicles of the same merged sub-delivery task does not exceed the capacity of the vehicle.

Optionally, the distribution tasks with the duration less than or equal to the time window length are all represented as distribution tasks passing through a non-transit point, a transit point and a non-transit point in sequence, and then the distribution tasks are split into three sub-distribution tasks by two transit points;

Optionally, an integer programming model is adopted to select the transit points and determine the mapping relation between each transit point and the non-transit point,

Optionally, in each distribution area, one transit point corresponds to at most six non-transit points.

Optionally, the objectives of the heuristic model include at least one of the following:

and running the delivery profile using the least number of vehicles.

The in-city express delivery device provided by this embodiment may implement the embodiments of the method described above, and the implementation principle and technical effect are similar, which are not described herein again.

Fig. 6 is a schematic structural diagram of a computer device according to an embodiment of the present invention. As shown in fig. 6, a schematic structural diagram of a computer system 600 suitable for implementing a terminal device or a server according to an embodiment of the present application is shown.

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

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

In particular, the process described above with reference to fig. 2 may be implemented as a computer software program, according to an embodiment of the present disclosure. 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 above-described method of stand allocation for a plurality of aircraft. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 609, and/or installed from the removable medium 611.

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 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 hardware. The described units or modules may also be provided in a processor. The names of these units or modules do not in some cases constitute a limitation of the unit or module itself.

As another aspect, the present application also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the foregoing device in the foregoing 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 method for stand allocation for a plurality of aircraft described herein.

The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by a person skilled in the art that the scope of the invention as referred to in the present application is not limited to the embodiments with a specific combination of the above-mentioned features, but also covers other embodiments with any combination of the above-mentioned features or their equivalents without departing from the inventive concept. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.

Claims

1. A method for delivering same-city express mails, which comprises the following steps:

2. A method for distribution of co-located couriers according to claim 1,

3. A method for distribution of co-located couriers according to claim 2,

and inputting the new distribution task network into a heuristic model of a vehicle path problem based on a time window, and stringing the new distribution task network by using a vehicle to form a final distribution scheme.

4. A method for distribution of co-located couriers according to claim 3,

the sum of the express delivery quantities carried by the vehicles of the same merged sub-distribution task does not exceed the capacity of the vehicle.

5. A method for distribution of co-located couriers according to claim 2,

representing the distribution tasks with the duration less than or equal to the time window length as the distribution tasks passing through a non-transit point, a transit point and a non-transit point in sequence, and dividing the distribution tasks into three sub-distribution tasks by using two transit points;

6. A method for delivering city-size couriers according to any one of claims 1 to 5,

selecting the transit points by adopting an integer programming model and determining the mapping relation between each transit point and the non-transit point,

7. A method for distribution of co-located couriers according to claim 6,

in each distribution area, one transfer point corresponds to at most six non-transfer points.

8. A method for distribution of co-located couriers according to claim 3,

the objectives of the heuristic model include at least one of the following:

and running the delivery profile using the least number of vehicles.

9. A city express delivery device, comprising:

10. A computer device comprising a memory and a processor, the memory storing a computer program, wherein the processor when executing the computer program implements the method of any one of claims 1 to 8.

11. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the method of any one of claims 1 to 8.