CN-121981626-A - Transportation task planning method and related device

CN121981626ACN 121981626 ACN121981626 ACN 121981626ACN-121981626-A

Abstract

The application provides a transportation task planning method and a related device, and relates to the technical field of logistics transportation. The method comprises the steps of determining planned traffic of each departure shift of a target departure place to each destination according to traffic of each departure shift to the destinations in a plurality of days of the history of the target departure place, planning a straight-forward task of each departure shift of the target departure place to each destination according to the planned traffic, planning a series-point task of the target departure place to the destinations according to first residual traffic of the planned traffic after the traffic of the straight-forward task is removed, and optimizing departure time of the planned transportation task of each departure shift according to vehicle loading capacity of the planned transportation task of each departure shift of the target departure place. The technical scheme provided by the application can solve the problem of how to reasonably plan logistics transportation tasks so as to reduce transportation cost in the prior art.

Inventors

ZHANG MINGSHENG
CHEN RUIQIAN
PAN XIN
LIU ZHIJIN
CHEN BINHUI
GUAN YUECHAO
CHEN HUI
SHEN ZHENYUAN

Assignees

顺丰科技有限公司

Dates

Publication Date: 20260505
Application Date: 20251208

Claims (10)

1. A transportation mission planning method, the method comprising: according to the traffic of each departure shift to a plurality of destinations in a plurality of days of a target departure place history, determining the planned traffic of each departure shift of the target departure place to each destination; planning a straight-forward task from each departure shift to each destination of the target departure place according to the planning traffic volume; Planning a series-point task from the target departure place to the multiple destinations according to a first residual traffic volume, wherein the first residual traffic volume refers to the traffic volume after the planned traffic volume removes the traffic volume of the straight-sending task; Optimizing departure time of each departure shift planned transport task according to the vehicle load capacity of each departure shift planned transport task of the target departure place, wherein the transport tasks comprise planned straight-departure tasks and serial-point tasks.
2. The transportation mission planning method as claimed in claim 1, wherein said determining a planned transportation volume for each departure shift of the destination departure place to each destination according to the transportation volumes of each departure shift to a plurality of destinations in a plurality of days of the departure place history of the destination, comprises: Counting the traffic of the same departure shift to different destinations every day in a plurality of days of the target departure place history; sequencing the traffic of the same departure shift of the target departure place to the same destination every day according to the order of the traffic from small to large to obtain a target sequence; and taking the target quantile of the target sequence as the planned traffic of the same departure shift of the target departure place to the same destination.
3. The transportation task planning method of claim 1, wherein the hair-straightening task comprises a steady-state hair-straightening task and a dynamic hair-straightening task; and planning a straight-forward task from each departure shift to each destination of the target departure place according to the planned traffic volume, wherein the straight-forward task comprises the following steps: Inputting first information into a pre-trained straight-sending task model, and outputting each departure shift of the target departure place to a steady-state straight-sending task of each destination through the straight-sending task model, wherein the first information comprises the planned traffic volume, and the starting time and the ending time of the corresponding departure shift; And planning a dynamic straight-forward task for the preset traffic in the second residual traffic under the condition that the second residual traffic is larger than or equal to the preset traffic, wherein the second residual traffic is the residual traffic after the planned traffic of each destination removes the traffic of the steady-state straight-forward task.
4. A transportation mission planning method as claimed in claim 3, wherein said inputting the first information into a pre-trained straight mission model, outputting a steady straight mission from each departure shift to each destination at the target departure place via the straight mission model, comprises: Inputting the first information into the straight-sending task model, and outputting each departure shift of the target departure place to a steady-state straight-sending task of each destination through the straight-sending task model according to a first constraint condition and a first planning target; the first constraint condition comprises at least one of that the traffic of a steady-state straight-sending task from each departure shift to each destination is smaller than or equal to the corresponding planned traffic, the departure time is between the starting time and the ending time of the departure shift, and the goods falling amount after the steady-state straight-sending task is ended is larger than or equal to 0; Wherein the first planning target comprises at least one of the following items that the target departure place has the least amount of falling goods and the departure time is as early as possible.
5. A transportation mission planning method as claimed in claim 1 or 3, wherein the planning of the series-point mission from the target departure point to the plurality of destinations based on the first remaining transportation volume comprises: Inputting second information into a trained string point task model, and outputting string point tasks from each departure shift of the target departure place to the multiple destinations through the string point task model; The second information comprises at least one of the second residual traffic volume, the earliest departure time, the latest arrival time, business hours, service time and the allowed maximum vehicle type of each destination corresponding to the same departure shift, time distance information corresponding to each destination in the same departure shift and vehicle information of the target departure place.
6. The transportation mission planning method of claim 5, wherein inputting the second information into the trained punctuation mission model, outputting the punctuation mission for each departure shift of the target departure place to the plurality of destinations via the punctuation mission model, comprises: Inputting second information into a pre-trained string point task model, and outputting string point tasks from each departure shift of a target departure place to the multiple destinations according to a second constraint condition and a second planning target through the string point task model; The second constraint condition comprises at least one of a destination being only strung once, the number of the destinations being smaller than a preset value, the time requirement of the destination being met, the maximum vehicle type requirement of the destination being met, the total distance of tasks being smaller than or equal to a preset distance, the route around ratio of tasks being smaller than or equal to a preset ratio, the vehicle starting from the destination departure place and returning to the destination departure place, the destination arrival sequence limitation, and the vehicle capacity limitation; The second planning target comprises at least one of the following items of minimum total line mileage, minimum goods falling amount of the departure place of the target, minimum waiting time at the destination, as late as possible departure time, as small as possible using vehicle type and as short as possible driving distance of vehicles with large goods.
7. The transportation mission planning method as claimed in claim 1, wherein optimizing departure time of each departure shift planned transportation mission according to a type of vehicle used by the transportation mission of each departure shift planned according to the target departure place comprises: And inputting third information into a pre-trained frequency-raising planning model, and optimizing the departure time of each departure shift planned transportation task through the frequency-raising planning model, wherein the third information comprises at least one of all transportation tasks corresponding to the same destination, the planned departure time of each transportation task and the type of vehicle used for executing the transportation task.
8. The transportation mission planning method of claim 7, wherein inputting the third information into a pre-trained frequency-raising planning model, optimizing departure time of each departure shift planned transportation mission by the frequency-raising planning model, comprises: Inputting the third information into the frequency-raising planning model, and optimizing the departure time of each departure shift planned transportation task according to a third constraint condition and a third planning target; the third constraint condition comprises at least one of that each vehicle starts from a starting point to an ending point, each transport task is only visited once, each destination only corresponds to one transport task execution sequence, the departure time is longer than the earliest departure time and shorter than the latest departure time of the corresponding transport task execution sequence, the transport task type selected by the vehicle is consistent with the vehicle type corresponding to the transport task, and each vehicle starts from the starting point and returns to the starting point; the third planning target comprises at least one of the following steps that the sum of the used vehicle weights is minimum, and different types of vehicles correspond to different using weights.
9. An electronic device is characterized by comprising a memory and a processor; the memory is connected with the processor and used for storing programs; the processor is configured to implement the transportation mission planning method as claimed in any one of claims 1 to 8 by running a program in the memory.
10. A storage medium having stored thereon a computer program which, when executed by a processor, implements a transportation mission planning method as claimed in any one of claims 1 to 8.

Description

Transportation task planning method and related device Technical Field The application relates to the technical field of logistics transportation, in particular to a transportation task planning method and a related device. Background Logistics transportation is an indispensable ring in modern economic systems, and with the development of globalization trade and the rising of electronic commerce, the logistics industry has come up with unprecedented growth opportunities. However, with the proliferation of traffic, logistics enterprises face tremendous cost pressures, including transportation costs, storage costs, labor costs, and the like. Among the numerous costs, transportation costs are a considerable proportion. Efficient transportation mission planning is critical to reduce these costs, and therefore, how to rationally plan logistics transportation mission to reduce logistics transportation costs is a technical problem to be solved. Disclosure of Invention Based on the defects and shortcomings of the prior art, the application provides a transportation task planning method and a related device, which can solve the problem of how to reasonably plan logistics transportation tasks to reduce transportation cost in the prior art. According to a first aspect of an embodiment of the present application, there is provided a transportation mission planning method, the method including: The method comprises the steps of determining planned traffic of each departure shift of a target departure place to each destination in a plurality of days according to the traffic of each departure shift to the plurality of destinations in a target departure place history, planning a straight-forward task of each departure shift of the target departure place to each destination according to the planned traffic, planning a series-point task of the target departure place to the plurality of destinations according to a first residual traffic, wherein the first residual traffic refers to the traffic of the planned traffic after the traffic of the straight-forward task is removed, optimizing the departure time of the planned traffic task of each departure shift according to the vehicle load of the planned traffic task of each departure shift of the target departure place, and the traffic tasks comprise the planned straight-forward task and the series-point task. According to a second aspect of an embodiment of the present application, there is provided a transportation mission planning apparatus, the apparatus comprising: And the processing module is used for determining the planned traffic of each departure shift of the target departure place to each destination according to the traffic of each departure shift to a plurality of destinations in a plurality of days of the history of the target departure place. And the first planning module is used for planning the straight-forward task from each departure shift to each destination of the target departure place according to the planning traffic volume. And the second planning module is used for planning the series-point tasks from the target departure place to the plurality of destinations according to the first residual traffic, wherein the first residual traffic is the traffic after the planned traffic removes the traffic of the straight-sending task. The third planning module is used for optimizing the departure time of each departure shift planned transportation task according to the vehicle load capacity of each departure shift planned transportation task of the target departure place, wherein the transportation tasks comprise planned straight-departure tasks and serial-point tasks. According to a third aspect of an embodiment of the present application, there is provided an electronic device including a memory and a processor; the memory is connected with the processor and used for storing programs; The processor is configured to implement the transportation task planning method according to the first aspect by running a program in the memory. According to a fourth aspect of embodiments of the present application, there is provided a storage medium having stored thereon a computer program which, when executed by a processor, implements the transportation task planning method according to the first aspect. According to a fifth aspect of embodiments of the present application, there is provided a computer program product or computer program, the computer program product comprising the computer program, which when executed by a processor implements the steps of the transportation mission planning method as described in the first aspect. In the technical scheme provided by the application, the basic traffic volume (namely the planned traffic volume) for planning the transportation task is determined based on the traffic volume information of a plurality of historical days, then the direct-sending task is planned on the basic traffic volume, then the series-point task is planned, and