CN111311138B - Method, device, equipment and storage medium for delivering same-city express mail - Google Patents
Method, device, equipment and storage medium for delivering same-city express mail Download PDFInfo
- Publication number
- CN111311138B CN111311138B CN201811513008.2A CN201811513008A CN111311138B CN 111311138 B CN111311138 B CN 111311138B CN 201811513008 A CN201811513008 A CN 201811513008A CN 111311138 B CN111311138 B CN 111311138B
- Authority
- CN
- China
- Prior art keywords
- point
- delivery
- time window
- length
- points
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 37
- 238000013507 mapping Methods 0.000 claims abstract description 26
- 230000007935 neutral effect Effects 0.000 claims abstract description 26
- 238000004590 computer program Methods 0.000 claims description 14
- 238000010586 diagram Methods 0.000 description 12
- 230000006870 function Effects 0.000 description 8
- 238000012546 transfer Methods 0.000 description 8
- 238000004891 communication Methods 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 3
- 238000005192 partition Methods 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 230000032683 aging Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 235000011888 snacks Nutrition 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Quality & Reliability (AREA)
- Entrepreneurship & Innovation (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses a method, a device, equipment and a storage medium for delivering express mail in the same city, wherein the method comprises the following steps: selecting part of the network points from all the network points as a distributed point, wherein the distributed point forms a same-city high-speed network for transporting express items in the same city, and the distributed point comprises the following components: dividing the distributed points into a middle turning point and a non-middle turning point, determining the mapping relation between the middle turning point and the non-middle turning point, dividing different distribution areas according to the mapping relation, wherein one middle turning point corresponds to one distribution area; determining delivery tasks in the same delivery area or among different delivery areas, wherein in each delivery area, the non-neutral point express pieces need to be delivered to the corresponding neutral points. The method can make the express items gathered at the middle point, improve the loading rate of each vehicle and reduce the transportation cost.
Description
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 mail in the same city.
Background
At present, the same city part is basically from a connection point to a network point, then is sent to a corresponding transfer field for transfer, and is a flow of connecting a net to a large net and then returning to the connection net, for example: from the View zone to the Douyun zone in Guangzhou, as shown in FIG. 1:
however, the current mode of mixing with co-and non-co-metropolitan parts has the following disadvantages:
1) The fixed network and the fixed shift determine when the express mail arrives at the website and the transfer site, and the transfer of the express mail is concentrated at the time point of the shift transfer, so that the flood peak of the express mail can occur no matter in the website or the transfer site;
2) In order to cope with the operation requirement of express mail flood peak, human resources and equipment are input according to the flood peak period, so that the waste of human resources and equipment productivity in off-peak time periods is caused;
3) The resource utilization rate is low, the receiving and dispatching process is complex, the time consumption is too long for the ring-to-ring buckling, and the high-aging products cannot be supported;
4) On the premise of continuously increasing the amount of the parts, in order to meet the receiving and dispatching requirements, the network points can only be increased or detached continuously, but the acquisition of the proper network point address in the first-line city is difficult;
5) Some parts in the same city have a small quantity, but the city range is wide, and the parts in the same flow direction cannot be converged on one vehicle or a few vehicles, so that the transportation cost is high.
Disclosure of Invention
In view of the foregoing drawbacks or shortcomings of the prior art, it is desirable to provide a method, apparatus, device and storage medium for co-city express delivery.
In order to overcome the defects in 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 express mail in the same city, which is characterized in that the method includes:
selecting part of the net points from all net points as distributed points,
the distributed points form a same-city high-speed network for transporting express items in the same city, and the distributed points comprise:
dividing the distributed points into a middle turning point and a non-middle turning point, determining the mapping relation between the middle turning point and the non-middle turning point, dividing different distribution areas according to the mapping relation, wherein one middle turning point corresponds to one distribution area;
determining delivery tasks in the same delivery area or among different delivery areas, wherein in each delivery area, the non-neutral point express pieces need to be delivered to the corresponding neutral points.
Further, judging whether the time length required by each delivery task from the starting point to the end point is less than or equal to the time window length,
if the time length is less than or equal to the time window length, taking the middle point as a splitting point to split each delivery task into different sub-delivery tasks, combining a plurality of sub-delivery tasks with the same starting point and end point and the time window overlapping part length longer than the vehicle straight-transmitting time length, and forming a new delivery task;
if the duration is longer than the length of the time window, reserving the delivery task with the duration longer than the length of the time window;
and converging the delivery tasks with the time length longer than the time window and the new delivery tasks to form a new delivery task network.
Further, 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 strung by a vehicle to form a final distribution scheme.
Further, the sum of the quantity of the express items delivered by the vehicles of the same sub-delivery task after merging does not exceed the capacity of the vehicles.
Further, the delivery tasks with the time length less than or equal to the time window length are all represented as delivery tasks passing through a non-middle point, a middle point and a non-middle point in sequence, and then the delivery tasks are split into three sub-delivery tasks by two middle points;
the length of the time window is set to be three parts, wherein two parts are set to be the time duration of the vehicle straight running from the non-middle point to the middle point and from the middle point to the non-middle point, and the other part is set to be the time duration required for the vehicle to pass through two middle points.
Further, an integer programming model is adopted to select the medium-turning points and the mapping relation between each medium-turning point and the non-medium-turning point is determined,
and when different distribution areas are divided according to the mapping relation, acquiring a minimum distribution task with the duration longer than the time window.
Further, within each dispensing zone, one of the centerpoints corresponds to at most six of the non-centerpoints.
Further, the objectives of the heuristic model include at least one of:
dividing the whole time window for running the final distribution scheme into a plurality of same time intervals, wherein the number of time intervals with the number of in-out vehicles exceeding the limit is the least;
the sum of the cost of using the vehicle, the cost of the travel distance of the vehicle and the cost of stopping the vehicle is minimum for running the distribution scheme;
and the minimum number of vehicles used to run the distribution scheme.
In a second aspect, the present invention also provides a same 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 distributed point,
the second module is used for the distributed points to form a same-city high-speed network for transporting the same-city express items, and comprises:
a first unit, configured to divide the distributed points into a middle point and a non-middle point, determine a mapping relationship between the middle point and the non-middle point, and divide different distribution areas according to the mapping relationship, where one middle point corresponds to one distribution area;
and the second unit is used for determining delivery tasks in the same delivery area or among different delivery areas, and in each delivery area, the non-neutral point express needs to be delivered to the corresponding neutral point.
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 the special feature is that the processor implements a method for delivering same city express items as described above 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, which is characterized in that the computer program, when executed by a processor, is a method for delivering same city express items as described above.
Compared with the prior art, the invention has the beneficial effects that:
according to the invention, a certain proportion of distributed points are selected as the middle points in all distributed points, the mapping relation between each middle point and each non-middle point in the distributed points is determined, different distribution areas are divided according to the mapping relation, the distribution tasks in the same distribution area or among different distribution areas are determined, and the non-middle point express in each distribution area is firstly conveyed to the corresponding middle point and then sent out by the middle point, so that the express is gathered at the middle point, 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 detailed description of non-limiting embodiments, made with reference to the following drawings, in which:
FIG. 1 is a simulation diagram of a conventional same-city express delivery mode;
FIG. 2 is a flow chart of a method for delivering same city express mail according to an embodiment of the present invention;
FIG. 3 is a schematic diagram showing distribution of different distribution areas according to an embodiment of the present invention;
FIG. 4 is an exemplary diagram of a vehicle to new distribution network concatenation in accordance with an embodiment of the present invention;
FIG. 5 is a schematic diagram of a city express delivery device 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 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.
As mentioned in the background, the mode of mixing the same city component and the non-same city component is a fixed network, the fixed shift determines when the express component arrives at the website and the transit field, and the handover of the express component is concentrated at the time point of the shift handover, so that the flood peak of the express component occurs in both the website and the transit field. In order to cope with the operation requirement of express mail flood peak, human resources and equipment are input according to the flood peak period, so that the waste of human resources and equipment productivity in off-peak time periods is caused; the resource utilization rate is low, the receiving and dispatching process is complex, the time consumption is too long to link up, and the high-aging product cannot be supported. Some parts in the same city have a small quantity, but the city range is wide, and the parts in the same flow direction cannot be converged on one vehicle or a few vehicles, so that the transportation cost is high.
Referring to fig. 2, the present invention provides a method for delivering express mail in the same city, which includes:
as shown in fig. 2, in step 210, a portion of the dots are selected from all dots as a distributed dot;
in step 220, the distributed points form a co-city high-speed network for transporting the same-city express, including:
step 221, dividing the distributed points into a middle point and a non-middle point, determining the mapping relation between the middle point and the non-middle point, dividing different distribution areas according to the mapping relation, wherein one middle point corresponds to one distribution area;
step 222 determines the delivery tasks within the same delivery area or between different delivery areas, wherein in each delivery area, the non-neutral point of the snack piece needs to be delivered to its corresponding neutral point first.
In one embodiment, an integer programming model is used to select the middle points and determine the mapping relation between each middle point and each non-middle point, and when different distribution areas are divided according to the mapping relation, a minimum distribution task with the duration longer than the time window length is obtained.
The specific process is as follows:
OD represents a delivery task between any start point O and any end point D of the delivery of the cargo. The delivery task means that in what time period, which intermediate points are passed, which pair of the starting point O to the end point D of the delivery of the express item is completed.
Each OD to be planned needs to provide a start point, an end point, a driving distance between the start point and the end point, a piece quantity between the start point and the end point, a time window length and a straight-transmitting duration, and the time window length is a difference value between a time window start time point and a time window end time point.
The definition of the hair straightening period is: a vehicle is arranged to start from a starting point, without any transit in the middle, and the time required to reach the end point.
Based on the above information, the number of intermediate points is set first, and then an integer programming model is used, so that the fewer OD exceeding the time window length is better under the assumption of the paths of all OD passing through the distributed point, intermediate point and distributed point in turn.
Specifically, the process of forming this integer programming model includes two steps:
1) Selecting a fixed number of medium-point points from the existing distributed points;
2) The remaining distributed points, i.e. the intermediate points to which the non-intermediate points belong, are determined.
Constraints that the integer programming model needs to satisfy include:
1. any distributed point is either a neutral point or a neutral point;
2. the number of distributed points covered by each medium-speed point is limited by an upper limit;
in one embodiment, at most six non-neutral points are associated with one neutral point in each dispensing zone.
The objective function considered by the model is the minimum timeout OD number, and the expression is: min sigma r w r Wherein r represents an OD, w r Is a decision variable, w r And (2) is 0 or 1, for judging whether the OD exceeds the time window length, wherein 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, in the case of 21 distributed points in a city, if 4 intermediate points are selected, the remaining 17 points are non-intermediate points. Using an integer programming model, determining a non-centralised point mapped by each centralised point, and dividing different delivery areas by the mapping relationship.
All the distributed points represented by circles belong to the same partition, the middle points of the partition are R, the non-middle points are A, O, F, P and G, and the non-middle points A, O, F, P and G are all sent to the middle points R first and then are sent out in a concentrated way by the middle points R, so that the goods can be better gathered at the middle points, the loading rate of each vehicle is improved, and the effect of less departure is achieved under the condition of unchanged freight quantity.
Referring to FIG. 3, a pair of ODs is illustrated, starting at A, ending at B, with a time window of 780 to 900, and a time window length of 120 minutes;
the corresponding intermediate point of A is R, the corresponding intermediate point of B is S, and the route planned by us is A to R, S to B;
if a to R take 20 minutes, R to S take 25 minutes, S to B take 30 minutes, then the length of the journey is 75 minutes;
meanwhile, as the route passes through two middle points (R, S), vehicle changing operation is needed to be carried out on the two middle points, and each route needs a transfer time length of 20 minutes, and the total transfer time length is 40 minutes;
then the total length of the route planned by us is 75+40=115 minutes, which is less than 120 minutes, which is the time window length to meet the delivery timeliness.
Conversely, if R to S take 35 minutes, i.e., the length of the journey becomes 85 minutes, plus the transit time of 40 minutes, i.e., 125 minutes, greater than 120 minutes over the length of the time window, this is considered to be an unsatisfactory dispensing schedule.
In one embodiment, the method for delivering the same city express 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 time window length,
if the time length is less than or equal to the time window length, taking the middle point as a splitting point to split each delivery task into different sub-delivery tasks, combining a plurality of sub-delivery tasks with the same starting point and end point and the time window overlapping part length longer than the vehicle straight-transmitting time length, and forming a new delivery task;
if the duration is longer than the length of the time window, reserving the delivery task with the duration longer than the length of the time window;
and converging the delivery tasks with the time length longer than the time window and the new delivery tasks to form a new delivery task network.
In one embodiment, the delivery tasks with the time length less than or equal to the time window length are all represented as delivery tasks passing through a non-middle point, a middle point and a non-middle point in sequence, and then the delivery tasks are split into three sub-delivery tasks by two middle points;
the length of the time window is set to be three parts, wherein two parts are set to be the time duration of the vehicle straight running from the non-middle point to the middle point and from the middle point to the non-middle point, and the other part is set to be the time duration required for the vehicle to pass through two middle points.
The meaning of the sub-delivery task is in what time period, which non-neutral to neutral, or neutral to non-neutral delivery of the shutter is completed.
The specific process is as follows:
after the mapping relation between the middle point and the non-middle point is obtained, each OD is expressed as a delivery task passing through the non-middle point, the middle point and the non-middle point in sequence, the OD with the time length less than or equal to the time window length from the starting point to the end point is split, and the delivery task can be split into one sub-delivery task, two sub-delivery tasks or three sub-delivery tasks according to the condition that whether the starting point or the end point is the middle point, and the OD with the time length greater than the time window length from the starting point to the end point can not be forcibly split.
Let O denote the non-neutral point and four denote the neutral point:
when OD is expressed as O-four-four, splitting OD into three segments;
when the range from the middle point to the non-middle point in the OD is 0, the OD is represented as O [ four-star ] -, when the range from the non-middle point to the middle point is 0, the OD is represented as O [ four ] -, when the range from the middle point to the non-middle point is 0, the OD is represented as O [ four ] -, and the OD is split into two sections in all three cases;
when the ranges from the two middle points and the middle point to the non-middle point are both 0, the OD is represented as o-, when the ranges from the non-middle point to the middle point and the middle point to the non-middle point are both 0, the OD is represented as o-, and when the ranges from the non-middle point to the middle point and the two middle points are both 0, the OD is represented as o-.
The sub-distribution tasks obtained by splitting are only three cases, namely, a non-middle point to a middle point, a middle point to a middle point and a middle point to a non-middle point, wherein the middle point to the non-middle point, the non-middle point to the middle point are connected nets, and the middle point to the middle point is a branch net.
The split sub-delivery tasks are combined, and if the starting point and the end point are the same and the time windows can be met, the split sub-delivery tasks are combined as much as possible.
Bottom departure of the time window pocket: this situation occurs mainly in the sub-distribution task between the middle point and the middle point, and if C and D are two middle points, there are multiple ODs that are removed from the sub-distribution task from C to D and their time windows partially overlap. Assuming that a C to D straight-on takes 15 minutes, with three pairs of OD's removed from the C to D sub-distribution tasks, the time windows are (815, 840), (805, 825), (810, 825), respectively, then to meet the time window of the third OD, there must be a car to launch at this point in time 810, even though this would result in the first OD not driving up to this car, but in order to guarantee the aging of all OD's, such a launch arrangement would still need to be made.
In one example, the delivery vehicles with the same sub-delivery tasks are selected to be filled with delivery vehicles, and the sum of the quantity of the delivery vehicles with the same sub-delivery tasks is not more than the capacity of the delivery vehicles.
Filling and departure: if multiple OD's are all removed from the sub-delivery tasks from a to B and their time windows are the same, for example: from 780 to 800. At the same time, the sum of the quantity of the express items carried by the ODs does not exceed the capacity of the vehicle, so that the line segments can be spliced, i.e. the sub-distribution tasks from A to B of the plurality of ODs are executed by the same vehicle.
The above performs a forced convergence on the same sub-delivery task of the express items between the intermediate points. And according to the departure time and the arrival time after the sub-delivery tasks are combined, the sub-delivery tasks connected with the sub-delivery tasks before splitting are spliced to form a new OD for later use. The combined delivery segments are not split off again at a later stage, but are restored to the original OD at the stage of the result processing.
In one embodiment, the delivery tasks with the time length longer than the time window length required from the starting point to the end point are converged with the new delivery tasks to form a new delivery task network, the new delivery task network is input into a heuristic model of a vehicle path problem based on the time window, and the new delivery task network is strung together by a vehicle to form a final delivery 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 the vehicle path problem with a time window, and stringing the distribution task vehicles with the least vehicles within the set time window.
As shown in fig. 4, a tandem process of vehicles is illustrated. If there are three sub-distribution tasks, the first sub-distribution task is A to B, and the time window is (780,800); a second sub-distribution task B through C, the time window being (830, 863); a third sub-distribution task D through E, time window (900, 950); if the straight-out time from C to D only needs 20 minutes, the three sub-delivery tasks can be strung together by the same vehicle.
Meanwhile, due to the limitation of the size of the distributed points, each distributed point has the limitation of the number of times of entering and exiting vehicles in the dimension of ten minutes, and each network point cannot support a large number of times of entering and exiting vehicles in a short time.
The heuristic model is mainly guided by the following three objective functions when running:
first: limit the number of incoming and outgoing vehicles within ten minutes at all distributed points: dividing an integral time window of the operation of the new distribution task network into a plurality of time intervals in ten minutes, counting the number of times of entering and exiting of each distributed point in each time interval, counting the number of time intervals of times of entering and exiting of each distributed point exceeding three times, counting and summing all time intervals of times of entering and exiting exceeding a limit, and summing the values obtained by summation should be as small as possible.
Second,: the cost is as low as possible, and the cost structure of the new distribution task network consists of three parts, namely the number of vehicles, the total mileage of all vehicles and the total number of times of vehicle warp stop;
total cost = a x number of vehicles + b x total mileage + c x total number of stops
Wherein the total mileage of the vehicle represents the sum of the mileage of all the vehicles, the total number of times of passing and stopping represents the sum of the times of passing and stopping of each vehicle at the net 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.
Third,: the number of vehicles is as small as possible, so that the possibility of implementing the scheme on the ground is better, and the mileage of each vehicle needs to be as long as possible if necessary, thereby achieving the effect of reducing the number of vehicles.
When the model runs, different constraint combinations and constraint sequences are required to be tried continuously, and the three objective functions are matched with the domain structures in different model running stages, so that the results of the three objective functions are better.
Processing and analysis of results
Splitting the combined OD to form new OD so as to trace and analyze the real route condition of each OD;
and restoring the real route condition of each OD, wherein the real route condition comprises a get-on place and a get-off place, a get-on time and a get-off time of each section or at most three sections after splitting, and the distribution section is particularly responsible for which vehicle.
Fig. 5 is a schematic diagram illustrating a city express delivery device 500 according to an embodiment of the 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 distributed point,
a second module 520, configured to form a co-city high-speed network for transporting express items in the same city, includes:
a first unit 521, configured to divide the distributed points into a middle point and a non-middle point, determine a mapping relationship between the middle point and the non-middle point, and divide different distribution areas according to the mapping relationship, where one middle point corresponds to one distribution area;
a second unit 522 for determining delivery tasks within the same delivery area or between different delivery areas, wherein in each delivery area, the non-neutral point of the express item needs to be delivered to its corresponding neutral point first.
Optionally, the second unit 522 determines whether the time period required for each of the delivery tasks from the start point to the end point is less than or equal to the time window length,
if the time length is less than or equal to the time window length, taking the middle point as a splitting point to split each delivery task into different sub-delivery tasks, combining a plurality of sub-delivery tasks with the same starting point and end point and the time window overlapping part length longer than the vehicle straight-transmitting time length, and forming a new delivery task;
if the duration is longer than the length of the time window, reserving the delivery task with the duration longer than the length of the time window;
and converging the delivery tasks with the time length longer than the time window and the new delivery tasks to form a new delivery task network.
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 strung together by a vehicle to form a final distribution scheme.
Optionally, the sum of the quantity of the express items delivered by the vehicles of the same sub-delivery task after merging does not exceed the capacity of the vehicle.
Optionally, the delivery tasks with the time length less than or equal to the time window length are all represented as delivery tasks passing through a non-middle point, a middle point and a non-middle point in sequence, and then the delivery tasks are split into three sub-delivery tasks by two middle points;
the length of the time window is set to be three parts, wherein two parts are set to be the time duration of the vehicle straight running from the non-middle point to the middle point and from the middle point to the non-middle point, and the other part is set to be the time duration required for the vehicle to pass through two middle points.
Optionally, selecting the medium-turning points using an integer programming model and determining a mapping of each of the medium-turning points to the non-medium-turning points,
and when different distribution areas are divided according to the mapping relation, acquiring a minimum distribution task with the duration longer than the time window.
Optionally, at most six non-neutral points are associated with one neutral point in each dispensing zone.
Optionally, the objective of the heuristic model comprises at least one of:
dividing the whole time window for running the final distribution scheme into a plurality of same time intervals, wherein the number of time intervals with the number of in-out vehicles exceeding the limit is the least;
the sum of the cost of using the vehicle, the cost of the travel distance of the vehicle and the cost of stopping the vehicle is minimum for running the distribution scheme;
and the minimum number of vehicles used to run the distribution scheme.
The same city express delivery device provided in this embodiment may execute the embodiment of the method, and its implementation principle and technical effects are similar, and will not be described herein.
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 diagram of a computer system 600 suitable for use in implementing a terminal device or server of an embodiment of the present application is shown.
As shown in fig. 6, the computer system 600 includes a Central Processing Unit (CPU) 601, which 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 required for the operation of the system 600 are also stored. The CPU 601, ROM 602, and RAM 603 are connected to each other through 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, mouse, etc.; an output portion 607 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, a speaker, and the like; 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 drive 610 is also connected to the I/O interface 606 as needed. Removable media 611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is installed as needed on drive 610 so that a computer program read therefrom is installed as needed into storage section 608.
In particular, according to embodiments of the present disclosure, the process described above with reference to fig. 2 may be implemented as a computer software program. 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 aircraft stand allocation method of a plurality of aircraft as described above. In such an embodiment, the computer program may be downloaded and installed from a network through the communication portion 609, and/or installed from the removable medium 611.
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. The names of these units or modules do not in some way 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 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 aircraft stand allocation methods described herein for a plurality of aircraft.
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 (10)
1. A method for delivering same-city express items, the method comprising:
selecting part of the net points from all net points as distributed points,
the distributed points form a same-city high-speed network for transporting express items in the same city, and the distributed points comprise:
dividing the distributed points into a middle turning point and a non-middle turning point, determining the mapping relation between the middle turning point and the non-middle turning point, dividing different distribution areas according to the mapping relation, wherein one middle turning point corresponds to one distribution area;
determining delivery tasks in the same delivery area or among different delivery areas, wherein in each delivery area, the non-neutral point express needs to be delivered to the corresponding neutral point;
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 time window length,
if the time length is less than or equal to the time window length, taking the middle point as a splitting point to split each delivery task into different sub-delivery tasks, combining a plurality of sub-delivery tasks with the same starting point and end point and the time window overlapping part length longer than the vehicle straight-transmitting time length, and forming a new delivery task;
if the duration is longer than the length of the time window, reserving the delivery task with the duration longer than the length of the time window;
and converging the delivery tasks with the time length longer than the time window and the new delivery tasks to form a new delivery task network.
2. The method for peer-to-peer express delivery of claim 1 wherein,
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.
3. The method for peer-to-peer express delivery of claim 2 wherein,
the sum of the quantity of the express items transported by the vehicles of the same sub-delivery task after merging does not exceed the capacity of the vehicles.
4. The method for peer-to-peer express delivery of claim 1 wherein,
the distribution tasks with the time length smaller than or equal to the time window length are all represented as distribution tasks passing through a non-middle point, a middle point and a non-middle point in sequence, and then the distribution tasks are split into three sub distribution tasks by two middle points;
the length of the time window is set to be three parts, wherein two parts are set to be the time duration of the vehicle straight running from the non-middle point to the middle point and from the middle point to the non-middle point, and the other part is set to be the time duration required for the vehicle to pass through two middle points.
5. The method for peer-to-peer express delivery of any of claims 1 to 4 wherein,
selecting the medium-turning points by adopting an integer programming model and determining the mapping relation between each medium-turning point and the non-medium-turning points,
and when different distribution areas are divided according to the mapping relation, acquiring a minimum distribution task with the duration longer than the time window.
6. The method for peer-to-peer express delivery of claim 5 wherein,
within each dispensing zone, one of the centerpoints corresponds to at most six of the non-centerpoints.
7. The method for peer-to-peer express delivery of claim 2 wherein,
the objectives of the heuristic model include at least one of:
dividing the whole time window for running the final distribution scheme into a plurality of same time intervals, wherein the number of time intervals with the number of in-out vehicles exceeding the limit is the least;
the sum of the cost of using the vehicle, the cost of the travel distance of the vehicle and the cost of stopping the vehicle is minimum for running the distribution scheme;
and the minimum number of vehicles used to run the distribution scheme.
8. A co-city express delivery device, comprising:
a first module for selecting a portion from the mesh points as a distributed point,
the second module is used for the distributed points to form a same-city high-speed network for transporting the same-city express items, and comprises:
a first unit, configured to divide the distributed points into a middle point and a non-middle point, determine a mapping relationship between the middle point and the non-middle point, and divide different distribution areas according to the mapping relationship, where one middle point corresponds to one distribution area;
a second unit for determining delivery tasks within the same delivery area or between different delivery areas, wherein in each delivery area, the non-neutral point express items need to be delivered to their corresponding neutral points first;
the second unit is further configured to determine whether a time period required from the start point to the end point of each of the delivery tasks is equal to or less than a time window length,
if the time length is less than or equal to the time window length, taking the middle point as a splitting point to split each delivery task into different sub-delivery tasks, combining a plurality of sub-delivery tasks with the same starting point and end point and the time window overlapping part length longer than the vehicle straight-transmitting time length, and forming a new delivery task;
if the duration is longer than the length of the time window, reserving the delivery task with the duration longer than the length of the time window;
and converging the delivery tasks with the time length longer than the time window and the new delivery tasks to form a new delivery task network.
9. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the method of any one of claims 1-7 when executing the computer program.
10. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the method of any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811513008.2A CN111311138B (en) | 2018-12-11 | 2018-12-11 | Method, device, equipment and storage medium for delivering same-city express mail |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811513008.2A CN111311138B (en) | 2018-12-11 | 2018-12-11 | Method, device, equipment and storage medium for delivering same-city express mail |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111311138A CN111311138A (en) | 2020-06-19 |
| CN111311138B true CN111311138B (en) | 2024-03-26 |
Family
ID=71146727
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811513008.2A Active CN111311138B (en) | 2018-12-11 | 2018-12-11 | Method, device, equipment and storage medium for delivering same-city express mail |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111311138B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113902359A (en) * | 2020-07-06 | 2022-01-07 | 上海顺如丰来技术有限公司 | Logistics distribution path planning method and device, computer equipment and storage medium |
| CN112801371A (en) * | 2021-01-29 | 2021-05-14 | 广船国际有限公司 | Flat car route planning method, device, equipment and storage medium |
| CN112907176A (en) * | 2021-03-05 | 2021-06-04 | 上海中通吉网络技术有限公司 | Method, device and equipment for transporting express in same city |
| CN112950119B (en) * | 2021-03-10 | 2022-09-30 | 北京邮电大学 | Method, device, equipment and storage medium for splitting instant logistics order |
| CN113393086B (en) * | 2021-05-18 | 2023-12-01 | 阿里巴巴新加坡控股有限公司 | Distribution task information processing method and device |
| CN113469417B (en) * | 2021-06-10 | 2022-08-05 | 哈尔滨工业大学 | Express vehicle transportation scheduling method, system and equipment |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE10211715A1 (en) * | 2002-03-16 | 2003-10-09 | Daimler Chrysler Ag | Transport order processing method for use in an e-commerce environment, whereby individual orders that could be executed in a single vehicle journey are grouped together and offered for tender in an electronic market place |
| CN101604416A (en) * | 2009-07-21 | 2009-12-16 | 华中科技大学 | A kind of transportation dispatching method and dispatching system thereof of joining the center based on the third-party logistics collection |
| CN104732368A (en) * | 2015-03-25 | 2015-06-24 | 广州天图物流有限公司 | Order route system and method |
| CN107093050A (en) * | 2017-06-15 | 2017-08-25 | 上海汽车集团股份有限公司 | A kind of vehicle dispatching method and system |
| CN107844933A (en) * | 2017-09-21 | 2018-03-27 | 北京小度信息科技有限公司 | order processing method and device |
| CN108230073A (en) * | 2016-12-21 | 2018-06-29 | 天脉聚源（北京）科技有限公司 | A kind of method and system of managing internet sequence information |
| CN108921472A (en) * | 2018-06-30 | 2018-11-30 | 华南理工大学 | A kind of two stages vehicle and goods matching method of multi-vehicle-type |
-
2018
- 2018-12-11 CN CN201811513008.2A patent/CN111311138B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE10211715A1 (en) * | 2002-03-16 | 2003-10-09 | Daimler Chrysler Ag | Transport order processing method for use in an e-commerce environment, whereby individual orders that could be executed in a single vehicle journey are grouped together and offered for tender in an electronic market place |
| CN101604416A (en) * | 2009-07-21 | 2009-12-16 | 华中科技大学 | A kind of transportation dispatching method and dispatching system thereof of joining the center based on the third-party logistics collection |
| CN104732368A (en) * | 2015-03-25 | 2015-06-24 | 广州天图物流有限公司 | Order route system and method |
| CN108230073A (en) * | 2016-12-21 | 2018-06-29 | 天脉聚源（北京）科技有限公司 | A kind of method and system of managing internet sequence information |
| CN107093050A (en) * | 2017-06-15 | 2017-08-25 | 上海汽车集团股份有限公司 | A kind of vehicle dispatching method and system |
| CN107844933A (en) * | 2017-09-21 | 2018-03-27 | 北京小度信息科技有限公司 | order processing method and device |
| CN108921472A (en) * | 2018-06-30 | 2018-11-30 | 华南理工大学 | A kind of two stages vehicle and goods matching method of multi-vehicle-type |
Non-Patent Citations (2)
| Title |
|---|
| 何梦军 ; 吴怀岗 ; 丁翔."带时间窗的同城物流配送区域划分与路径优化".《南京师范大学学报(工程技术版)》.2018,18(02),70-76. * |
| 王勇 ; 毛海军 ; 刘静."带时间窗的物流配送区域划分模型及其算法".《东南大学学报(自然科学版)》.2010,40(05),1077-1083. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111311138A (en) | 2020-06-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111311138B (en) | Method, device, equipment and storage medium for delivering same-city express mail | |
| Kirchler et al. | A granular tabu search algorithm for the dial-a-ride problem | |
| Shafahi et al. | A practical model for transfer optimization in a transit network: Model formulations and solutions | |
| Tang et al. | An exact algorithm for the multi-trip vehicle routing and scheduling problem of pickup and delivery of customers to the airport | |
| US8572001B2 (en) | Simultaneous vehicle routing, vehicle scheduling, and crew scheduling | |
| Dullaert et al. | New heuristics for the fleet size and mix vehicle routing problem with time windows | |
| Ibeas et al. | Optimizing bus stop spacing in urban areas | |
| Nesheli et al. | Improved reliability of public transportation using real-time transfer synchronization | |
| Bettinelli et al. | A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities | |
| Wolfinger et al. | A matheuristic for a multimodal long haul routing problem | |
| CN111967828A (en) | Whole-process logistics-oriented road-rail combined transport product collaborative optimization method | |
| CN111667085A (en) | Method, device, medium and electronic equipment for determining logistics routing network | |
| Qiu et al. | Making the most of fleets: A profit-maximizing multi-vehicle pickup and delivery selection problem | |
| Ninikas et al. | Reoptimization strategies for a dynamic vehicle routing problem with mixed backhauls | |
| Lin et al. | Route design for last-in, first-out deliveries with backhauling | |
| Gaul et al. | Solving the dynamic dial-a-ride problem using a rolling-horizon event-based graph | |
| Caris et al. | A deterministic annealing algorithm for the pre-and end-haulage of intermodal container terminals | |
| CN112184092A (en) | Logistics node determination method, device, server and storage medium | |
| de Groot et al. | Vehicle and crew scheduling: solving large real-world instances with an integrated approach | |
| CN112529314A (en) | Multi-mode intermodal transport scheduling system, method and equipment | |
| Amberg et al. | Increasing delay-tolerance of vehicle and crew schedules in public transport by sequential, partial-integrated and integrated approaches | |
| Perrykkad et al. | A simultaneous Magnanti-Wong method to accelerate benders decomposition for the metropolitan container transportation problem | |
| Berov | A vehicle routing planning system for goods distribution in urban areas using google maps and genetic algorithm | |
| CN114862038A (en) | Scheduling method of cold-chain logistics vehicle and related equipment | |
| CN111260106B (en) | Transportation task allocation method, device, equipment and storage medium thereof |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |