Departure time planning method and device, electronic equipment and storage medium

Abstract

The application provides a departure time planning method and device, electronic equipment and a computer readable storage medium. The departure time planning method comprises: based on the preset departure time variable of each line in the target whole network n lines, constructing the expression of the whole network flow direction timeliness corresponding to the departure time planning strategy; obtaining the logistics transportation information of each preset flow direction in the target whole network M preset flow directions; obtaining the departure time value range of each line in the n lines; according to the departure time value range of each line in the n lines, the logistics transportation information and the expression, determining the whole network flow direction timeliness corresponding to each departure time planning strategy of the target whole network; output the target departure time planning strategy corresponding to the shortest whole network flow direction timeliness. In the application, the problem that the logistics timeliness can only be improved within a certain range due to cost limitation when relying solely on route optimization can be avoided, and the logistics timeliness can be maximally improved under the condition of unchanged cost.

Description

Technical Field

[0001] This application relates to the field of computer technology, and specifically to a departure time planning method, apparatus, electronic device, and computer-readable storage medium. Background Technology

[0002] The booming development of e-commerce has driven the rapid growth of the logistics industry. People are increasingly reliant on logistics, making it crucial for the industry to provide excellent service to users. Delivery timeliness is a key service indicator for the logistics sector.

[0003] Current technologies generally improve logistics efficiency through route optimization. However, relying solely on route optimization can only improve logistics efficiency to a certain extent and cannot guarantee an effective improvement in logistics efficiency. Summary of the Invention

[0004] This application provides a departure time planning method, apparatus, electronic device, and computer-readable storage medium, aiming to solve the problem that relying solely on route optimization can only improve logistics timeliness to a certain extent and cannot guarantee an effective improvement in logistics timeliness.

[0005] Firstly, this application provides a departure time planning method, the method comprising:

[0006] Based on the preset departure time variable for each of the n routes in the target network, construct an expression for the network-wide flow timeliness corresponding to the departure time planning strategy;

[0007] Obtain the logistics transportation information for each of the M preset flow directions in the target network, wherein the logistics transportation information includes the cargo volume for each preset flow direction and the N values ​​for each preset flow direction. k The route transport time for each of the routes, and the preset flow direction N k The operation time of each line in the network, M, N k Both n and are positive integers greater than 0;

[0008] Obtain the range of departure times for each of the n routes;

[0009] Based on the departure time range of each of the n routes, the logistics transportation information, and the expression, determine the overall network flow timeliness corresponding to each departure time planning strategy of the target network;

[0010] Output the target departure time planning strategy that corresponds to the shortest time of the entire network flow, wherein the target departure time planning strategy is used to indicate the target departure time of each of the n routes.

[0011] Secondly, this application provides a departure time planning device, the departure time planning device comprising:

[0012] The processing unit is used to construct an expression for the network-wide flow timeliness corresponding to the departure time planning strategy based on the preset departure time variable of each of the n lines in the target network.

[0013] The processing unit is further configured to acquire logistics transportation information for each of the M preset flow directions in the target network, wherein the logistics transportation information includes the cargo volume for each preset flow direction and the N values ​​for each preset flow direction. k The route transport time for each of the routes, and the preset flow direction N k The operation time of each line in the network, M, N k Both n and are positive integers greater than 0;

[0014] The processing unit is also used to obtain the range of departure times for each of the n routes;

[0015] The processing unit is also used to determine the network-wide flow timeliness corresponding to each departure time planning strategy of the target network based on the departure time range of each of the n routes, the logistics transportation information, and the expression.

[0016] The output unit is used to output the target departure time planning strategy with the shortest timeliness for the entire network flow, wherein the target departure time planning strategy is used to indicate the target departure time for each of the n lines.

[0017] Thirdly, this application also provides an electronic device, which includes a processor and a memory, wherein the memory stores a computer program, and when the processor calls the computer program in the memory, it executes the steps in any of the departure time planning methods provided in this application.

[0018] Fourthly, this application also provides a computer-readable storage medium having a computer program stored thereon, the computer program being loaded by a processor to execute the steps in the departure time planning method.

[0019] This application constructs an expression for the overall network flow efficiency corresponding to a departure time planning strategy by using the preset departure time variables for each of the n routes in the target network. Based on the departure time range, logistics transportation information, and the expression for each of the n routes, it determines the overall network flow efficiency corresponding to each departure time planning strategy for the target network. Finally, it outputs the target departure time planning strategy with the shortest overall network flow efficiency. On one hand, since departure time planning is based on the preset flow logistics transportation information of the target network, there is no need to change the route planning of the target network. By planning departure times while keeping the route planning unchanged, and selecting the target departure time planning strategy with the shortest overall network flow efficiency, this avoids the problem that simply relying on route optimization can only improve logistics efficiency to a certain extent. Improving logistics efficiency through departure time planning is a deeper and more effective way to improve logistics efficiency, resulting in a greater improvement in overall efficiency. On the other hand, since the departure time planning is based on setting variables from the route data of the entire target network, the optimal departure time for multiple routes in the entire target network can be planned simultaneously at one time, achieving global optimization that cannot be achieved manually; and since the departure time of multiple routes in the entire target network is planned simultaneously, the planning speed of the departure time of the routes in the entire target network can be improved. Attached Figure Description

[0020] To more clearly illustrate the technical solutions in the embodiments of this application, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0021] Figure 1 This is a schematic diagram of a scenario for the departure time planning and detection system provided in the embodiments of this application;

[0022] Figure 2 This is a flowchart illustrating a departure time planning method provided in an embodiment of this application;

[0023] Figure 3 This is a schematic diagram illustrating the target network provided in the embodiments of this application;

[0024] Figure 4 This is a flowchart illustrating an embodiment of the departure time planning strategy provided in this application.

[0025] Figure 5 This is a flowchart illustrating an embodiment of the network-wide flow timeliness corresponding to the departure time planning strategy provided in this application.

[0026] Figure 6This is a flowchart illustrating another embodiment of the network-wide flow timeliness corresponding to the departure time planning strategy provided in this application.

[0027] Figure 7 This is a schematic diagram of an embodiment of the departure time planning device provided in this application.

[0028] Figure 8 This is a schematic diagram of an embodiment of the electronic device provided in this application. Detailed Implementation

[0029] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0030] In the description of the embodiments of this application, it should be understood that the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of indicated technical features. Therefore, features defined with "first" and "second" may explicitly or implicitly include one or more of the stated features. In the description of the embodiments of this application, "multiple" means two or more, unless otherwise explicitly specified.

[0031] To enable any person skilled in the art to implement and use this application, the following description is provided. In this description, details are set forth for purposes of explanation. It should be understood that those skilled in the art will recognize that this application can be implemented without using these specific details. In other instances, well-known processes will not be described in detail to avoid obscuring the description of the embodiments of this application with unnecessary detail. Therefore, this application is not intended to be limited to the embodiments shown, but is consistent with the broadest scope of the principles and features disclosed in the embodiments of this application.

[0032] The execution subject of the departure time planning method in this application embodiment can be the departure time planning device provided in this application embodiment, or different types of electronic devices such as server equipment, physical host, or user equipment (UE) that integrate the departure time planning device. The departure time planning device can be implemented in hardware or software. The UE can be a terminal device such as a smartphone, tablet computer, laptop computer, handheld computer, desktop computer, or personal digital assistant (PDA).

[0033] The electronic device can operate independently or in a cluster. By applying the departure time planning method provided in this application, the problem that relying solely on route optimization can only improve logistics efficiency to a certain extent can be avoided, thus enabling a greater improvement in logistics efficiency.

[0034] See Figure 1 , Figure 1 This is a schematic diagram of a departure time planning system provided in an embodiment of this application. The departure time planning system may include an electronic device 100, which integrates a departure time planning device. For example, the electronic device can acquire logistics transportation information for each preset flow direction in the target network; acquire the departure time range for each of the n routes; acquire various departure time planning strategies for the target network based on the departure time range for each of the n routes; acquire the network-wide flow direction timeliness corresponding to each departure time planning strategy based on the logistics transportation information and each departure time planning strategy; and output the target departure time planning strategy.

[0035] In addition, such as Figure 1 As shown, the departure time planning system may also include a memory 200 for storing data, such as logistics transportation information.

[0036] It should be noted that, Figure 1 The schematic diagram of the departure time planning system shown is merely an example. The departure time planning system and scenario described in this application are for the purpose of more clearly illustrating the technical solutions of this application and do not constitute a limitation on the technical solutions provided in this application. As those skilled in the art will know, with the evolution of departure time planning systems and the emergence of new business scenarios, the technical solutions provided in this invention are also applicable to similar technical problems.

[0037] The following describes the departure time planning method provided in this application embodiment. In this embodiment, an electronic device is used as the execution subject. For simplicity and ease of description, this execution subject will be omitted in subsequent method embodiments. The departure time planning method includes: constructing an expression for the network-wide flow timeliness corresponding to the departure time planning strategy based on the preset departure time variables of each of the n routes in the target network; obtaining the logistics transportation information of each of the M preset flow directions in the target network, wherein the logistics transportation information includes the cargo volume of each preset flow direction, and the N values ​​of each preset flow direction. k The route transport time for each of the routes, and the preset flow direction N. k The operation time of each line in the network, M, N kBoth n and n are positive integers greater than 0; obtain the range of departure times for each of the n routes; based on the range of departure times for each of the n routes, logistics transportation information, and expressions, determine the overall network flow timeliness corresponding to each departure time planning strategy of the target network; output the target departure time planning strategy with the shortest overall network flow timeliness, where the target departure time planning strategy is used to indicate the target departure time for each of the n routes.

[0038] Reference Figure 2 , Figure 2 This is a flowchart illustrating a departure time planning method provided in an embodiment of this application. It should be noted that although the logical order is shown in the flowchart, in some cases, the steps shown or described may be performed in a different order than that shown here. The departure time planning method includes steps 201-205, wherein:

[0039] 201. Based on the preset departure time variables of each of the n routes in the target network, construct an expression for the network-wide flow timeliness corresponding to the departure time planning strategy.

[0040] In some embodiments, the overall network flow timeliness is the sum of the product of the timeliness of each preset flow direction and the cargo volume of each preset flow direction among the M preset flow directions in the target network. For example, the overall network flow timeliness can be expressed by the following formula (1):

[0041]

[0042] In formula (1), T k vol represents the timeliness of the k-th preset flow among M preset flows in the entire network. k T represents the quantity of goods in the k-th preset direction out of M preset directions in the entire network. ki T represents the timeliness of the i-th line in the k-th preset flow direction. ki It is a function of the departure time variable of the k-th preset flow to the i-th line.

[0043] In some embodiments, the overall network flow timeliness is the sum of the products of the timeliness of each of the n routes in the target network and the cargo volume of each route. For example, the overall network flow timeliness can be expressed by the following formula (2):

[0044]

[0045] In formula (2), T i vol represents the timeliness of the i-th line out of n lines in the entire network. i T represents the cargo volume of the i-th route out of n routes in the entire network. iIt is a function of the departure time variable of the i-th line out of the n lines in the target network.

[0046] 202. Obtain the logistics transportation information for each of the M preset flow directions in the target network.

[0047] The target network includes M preset flow directions, and each preset flow direction includes N k There are n routes, and the target network includes n routes. The logistics transportation information includes the cargo volume for each preset flow direction and N for each preset flow direction. k The route transport time for each of the routes, and the preset flow direction N. k The operation time of each line in the network.

[0048] M, N k Both and n are positive integers greater than 0, 1≤k≤M, and k is a positive integer. k represents the k-th preset flow direction among the M preset flow directions of the target network.

[0049] Logistics network structure refers to a network structure composed of two basic elements: routes that carry out the mission of logistics movement and nodes that carry out the mission of logistics stoppage (i.e., logistics nodes, or simply nodes).

[0050] The flow direction refers to the entire route of goods from the place of origin to the destination.

[0051] A line is formed between any two adjacent logistics nodes in the flow direction, and each line is also called a route.

[0052] In this embodiment, the target network can be a logistics network structure consisting of all routes and nodes planned by a logistics company. Alternatively, the target network can be a logistics network structure consisting of all routes and nodes planned within a specific logistics transportation area, such as globally, in a country, a province, or a city. The preset flow direction can be a flow direction pre-planned within the target network based on the origin and destination of the logistics goods.

[0053] Please refer to Figure 3 , Figure 3This is a schematic diagram illustrating the target network provided in the embodiments of this application. For example, the target network includes M = 4 preset flow directions, namely preset flow directions 1, 2, 3, and 4; the target network includes 12 logistics nodes A, B, C, D, E, F, G, H, I, J, K, and L. Among them, preset flow direction 1 is: H->I->J->K->L, preset flow direction 2 is: A->B->C->D->E, preset flow direction 3 is: F->B->C->D->E, and preset flow direction 4 is: G->C->D->E. Preset flow direction 1 includes N1 = 4 lines: line HI, line IJ, line JK, line KL; preset flow direction 2 includes N2 = 4 lines: line AB, line BC, line CD, line DE; preset flow direction 3 includes N3 = 4 lines: line FB, line BC, line CD, line DE; preset flow direction 4 includes N4 = 3 lines: line GC, line CD, line DE. Therefore, it can be determined that the target network includes n = 10 lines.

[0054] Where n represents the number of lines in the target network, M represents the number of preset flow directions in the target network, and N k This represents the number of lines in the k-th preset flow direction out of M preset flow directions. It can be understood that the total number of lines n in the target network is equal to the total number of unique lines in the M preset flow directions.

[0055] The route transportation time for each route refers to the transportation time required to transport goods from the j-th logistics node to the (j+1)-th logistics node of the route.

[0056] The operation time for each route refers to the time spent loading and unloading goods at the j-th logistics node of that route. In this embodiment, the time involved can be in units such as minutes, hours, or days, and there is no specific limitation.

[0057] The unit of measurement for the quantity of goods in the preset flow direction can be pieces, weight, etc., and can be adjusted according to the actual situation. No specific restrictions are imposed in this embodiment.

[0058] It is understood that, in the embodiments of this application, each preset flow direction may include N. k There are several routes, but the number of routes in two different preset flow directions is not exactly the same. For example, Figure 3 The target network shown includes M=4 preset flow directions. Preset flow direction 1 includes N1=4 lines, preset flow direction 2 includes N2=4 lines, preset flow direction 3 includes N3=4 lines, and preset flow direction 4 includes N4=3 lines.

[0059] For example, "obtaining logistics transportation information for each preset flow direction in the target network" may include the following steps:

[0060] 1) Read the location of each node in the target network from the preset database, and calculate the distance of each line in the target network.

[0061] 2) Read the cargo volume for each preset flow direction and the cargo volume for each route in the target network from the preset database. This will give you the cargo volume for each preset flow direction.

[0062] 3) Based on the cargo volume of each route in 2), calculate the vehicle allocation and vehicle type for each route.

[0063] 4) For each route, considering the vehicle assignment and type, and the distance of each route, calculate the route transportation time and operation time for each route. At this point, the preset flow direction N can be obtained. k The route transport time for each of the routes, and the preset flow direction N. k The operation time of each line in the network.

[0064] 203. Obtain the range of departure times for each of the n routes.

[0065] In this embodiment, departure time planning refers to planning the departure time of each of the n routes in the target network throughout the day. For example, if the planned departure time for route 1 is 9:00, for route 2 it is 12:30, and for route 3 it is 15:30, then this embodiment uses the departure time of each route in the target network as a variable. Correspondingly, the range of values ​​for the departure time of each of the n routes can be set according to the actual business scenario of each node in the target network.

[0066] In step 203, there are multiple ways to obtain the range of departure times for each of the n routes. For example, these include:

[0067] (1) The departure time range can be set as a continuous time variable, and the departure time planning period of the departure node of the i-th line out of n lines is taken as the departure time range of the i-th line. Specifically, the departure time planning period of each node in the target network is obtained; then, based on the departure time planning period of each node in the target network, the departure time planning period of the departure node of the i-th line out of n lines is obtained, which is taken as the departure time range of the i-th line out of n lines; thus, the departure time range of each line out of n lines can be obtained.

[0068] In this article, 1 ≤ i ≤ n, where i is a positive integer, and i represents the i-th route among the n routes in the target network. The departure node of the i-th route refers to the first logistics node in the flow direction among the two logistics nodes of the i-th route, such as... Figure 3As shown in the diagram, the departure node of route FB is logistics node F.

[0069] For example, if there are n=3 routes, and the planned departure time for the departure node of route 1 is 9:00-12:00, the planned departure time for the departure node of route 2 is 8:00-13:00, and the planned departure time for the departure node of route 3 is 14:00-18:00, then the departure time ranges for routes 1, 2, and 3 can be set to 9:00-12:00, 8:00-13:00, and 14:00-18:00, respectively.

[0070] In real-world business scenarios, the planned departure times for each node are not entirely consistent. For example, some nodes may have a larger volume of goods in the morning and a smaller volume in the afternoon. To reduce labor and time costs, the planned departure times for these nodes are typically from 9:00 AM to 12:30 PM. Therefore, in this embodiment, by obtaining different departure time ranges for different routes and planning departure times accordingly, the cost of logistics transportation can be reduced to some extent.

[0071] (2) The departure time range can also be set as a non-continuous integer time variable. Specifically, the logistics transportation information obtained in step 202 above also includes the earliest departure time and the latest departure time of each of the n routes. In this case, step 202 may specifically include: obtaining a preset time segmentation interval value; performing time segmentation based on the time segmentation interval value, the earliest departure time of each of the n routes, and the latest departure time of each of the n routes to obtain the departure time range of each of the n routes.

[0072] The departure time of each of the n routes includes multiple time segmentation values.

[0073] The time segmentation value is the value of each time point obtained by dividing the time period from the earliest departure time to the latest departure time according to the preset time segmentation interval value.

[0074] The earliest departure time refers to the earliest time point in the planned departure time period of the departure node, specifically the earliest time point in the planned departure time period of the departure node of the i-th route out of n routes.

[0075] The latest departure time refers to the latest time point in the planned departure time period of the departure node, specifically the latest time point in the planned departure time period of the departure node of the i-th route out of n routes.

[0076] For example, if the departure point of the i-th route among n routes can be arranged 24 hours a day, that is, the earliest departure time is 0:00 and the latest departure time is 24:00, then according to the preset time segmentation interval value of 0.5h, the day is divided into 48 time points. The departure time of the i-th route among n routes can be set to the range of 0≤Xi≤47, where Xi=0~47 represent the time points of the day: 0:00, 0:30, 1:00, 1:30, ..., 24:00.

[0077] In this article, Xi represents the optional time value for the i-th route, which refers to each value within the range of departure time values.

[0078] The above time segmentation intervals, earliest departure time, and latest departure time are just examples. The specific values ​​can be adjusted according to the actual business needs and are not limited to these.

[0079] Since the time of day is a continuous variable with a large number of possible values ​​and relatively inconsistent changes, on the one hand, dividing the time points into multiple integer variables reduces the number of possible values ​​for each route's departure time variable. This reduces the number of possible values ​​within the range of departure time values ​​for each route, thereby reducing the data processing workload for generating the departure time planning strategy and improving the output speed of the target departure time planning strategy. On the other hand, dividing the time values ​​using preset time segmentation intervals avoids the departure time range from including multiple consecutive time values ​​with inconsistent changes, while also ensuring the reasonableness of the time value intervals to a certain extent.

[0080] 204. Based on the departure time range of each of the n routes, the logistics transportation information, and the expression, determine the network-wide flow timeliness corresponding to each departure time planning strategy of the target network.

[0081] Specifically, step 204 may include: obtaining the departure time planning strategies for the entire target network based on the departure time range of each of the n routes; and determining the network-wide flow timeliness corresponding to each departure time planning strategy for the entire target network based on the logistics transportation information and the expression.

[0082] For example, such as Figure 4 As shown, the step "based on the departure time range of each of the n routes, obtain the departure time planning strategy for the entire target network" can specifically include the following steps 401 to 402:

[0083] 401. Based on the departure time range of each of the n routes, obtain the preset departure time variable setting value of each of the n routes, and obtain the set of setting values ​​for the n routes.

[0084] Each departure time planning strategy includes a set value for the departure time variable for each of the n routes. Each departure time planning strategy is used to indicate the departure time for each of the n routes.

[0085] Among the n routes, the departure time of the i-th route has a range of Yi selectable time values.

[0086] Specifically, among the Yi values ​​included in the range of departure time values ​​for the i-th route in the n routes, any one selectable time value is chosen as the set value of the departure time variable for the i-th route in the n routes. The set of set values ​​of the departure time variable for each of the n routes constitutes a departure time planning strategy for the entire target network.

[0087] For example, in the target network of n=3 routes, the departure times for route 1 are 9:00, 9:30, 10:00, 10:30, and 11:00; for route 2, they are 14:00, 14:30, 15:00, and 15:30; and for route 3, they are 18:00, 18:30, 19:00, 19:30, and 20:00. Any one of the possible departure times from the range of route 1, such as 9:00, is chosen as the setpoint for the departure time variable of route 1; any one of the possible departure times from the range of route 2, such as 14:00, is chosen as the setpoint for the departure time variable of route 2; and any one of the possible departure times from the range of route 3, such as 19:00, is chosen as the setpoint for the departure time variable of route 3. The departure time variables for Route 1 are set at 9:00, for Route 2 at 14:00, and for Route 3 at 19:00, which constitute a departure time planning strategy for the entire target network.

[0088] Specifically, in step 401, all time combinations of the n routes are determined based on the range of departure times for each of the n routes; each time combination serves as a set of preset values ​​for the n routes, wherein each time combination includes the preset value of the departure time variable for each of the n routes.

[0089] Here, the selectable time values ​​for the i-th route refer to all values ​​within the range of departure time values ​​for the i-th route.

[0090] Specifically, each time, an optional time value is selected from the range of departure times for each of the n routes, resulting in a time combination. Each time combination refers to the set of the n optional time values ​​obtained each time.

[0091] For example, in n=2 routes, the departure time range for route 1 includes the optional time values ​​a1 and b1, and the departure time range for route 2 includes the optional time values ​​a2 and b2. Therefore, all time combinations for the n=2 routes can be determined as: Time combination 1 (a1, a2), Time combination 2 (a1, b2), Time combination 3 (b1, a2), and Time combination 4 (b1, b2).

[0092] 402. Take the set of settings for the n routes as the departure time planning strategy for the target network, and obtain the departure time planning strategies for the target network.

[0093] To facilitate understanding, let's continue with the example from step 401 above. For instance, time combination 1 (a1, a2) is used as a departure time planning strategy to indicate the set value of the departure time variable for each of the n=2 routes: the set values ​​for the departure time variables of the 1st and 2nd routes are a1 and a2, respectively. Time combination 2 (a1, b2) is used as a departure time planning strategy to indicate the set value of the departure time variable for each of the n=2 routes: the set values ​​for the departure time variables of the 1st and 2nd routes are a1 and b2, respectively. Time combination 3 (b1, a2) is used as a departure time planning strategy to indicate the set value of the departure time variable for each of the n=2 routes: the set values ​​for the departure time variables of the 1st and 2nd routes are b1 and a2, respectively. Time combination 4 (b1, b2) is used as a departure time planning strategy to indicate the set value of the departure time variable for each of the n=2 routes: the set values ​​of the departure time variable for the 1st and 2nd routes are b1 and b2, respectively.

[0094] Furthermore, in actual business scenarios, to avoid excessively long transportation times for goods, the dwell time of goods at each logistics node is controlled. In this embodiment, after determining all time combinations for n routes in step 401, it is detected whether the interval between the j-th logistics node (departure time and arrival time) on the k-th preset flow direction exceeds a preset dwell time threshold. If it is detected that a certain time combination has an interval between the j-th logistics node (departure time and arrival time) on the k-th preset flow direction exceeding the preset dwell time threshold, then that time combination is filtered out, and only the target time combination is retained (wherein, the target time combination refers to a combination in which there is no interval between the j-th logistics node on the k-th preset flow direction exceeding the preset dwell time threshold), so as to further improve the transportation timeliness brought by the planned departure time.

[0095] The following uses the expressions for the network-wide flow timeliness corresponding to the departure time planning strategies shown in formulas (1) and (2) as examples to illustrate how to determine the network-wide flow timeliness corresponding to each departure time planning strategy of the target network.

[0096] (i) When the expression for the timeliness of the entire network flow corresponding to the departure time planning strategy is as shown in formula (1).

[0097] At this time, as Figure 5 As shown, the step "determine the network-wide flow timeliness corresponding to each departure time planning strategy of the target network based on the logistics transportation information and the expression" may specifically include the following steps 2041A to 2042A:

[0098] 2041A. Under each of the aforementioned departure time planning strategies, the expression is used to determine the destination N based on each of the preset flow directions. k The set value of the departure time variable for each route in the route, and the preset flow direction N k The route transport time for each of the routes, and the preset flow direction N. k The operation time of each line in the network is obtained, and the total duration of each preset flow direction is obtained.

[0099] There are several ways to implement step 2041A, such as including:

[0100] Method 1: Calculate each preset flow direction N separately k The total travel time of each route in the N routes, and the preset flow direction N k The total travel time of each route in the given routes is added together to obtain the total travel time for each preset flow direction. At this point, step 2041A may specifically include the following steps a1 to a3:

[0101] a1. Under the planning strategy at each departure time, based on each preset flow direction N k The set value of the departure time variable for each route in each route, and the preset flow direction N. k The route transport time for each of the routes, and the preset flow direction N. k The operation time of each line in the network determines the preset flow direction N. k The dwell time for each route within the total number of routes.

[0102] a2. Based on each preset flow direction N k The route transport time for each of the routes, and the preset flow direction N. k The dwell time of each route in the network determines the preset flow direction N. k The total travel time for each route within the total number of routes.

[0103] a3. Direct each preset flow to N k The total travel time of each route is added together to obtain the total travel time of each preset flow direction.

[0104] In this paper, 1≤i'≤N k i' is a positive integer, representing each preset flow direction N. k The i'th line among the lines.

[0105] For example, in the k-th preset flow direction, the departure time variable of the i'-th route is set to 20:00, that is, the j-th departure time of the i'-th route... i’ The departure time for each logistics node is 20:00; the transportation time for the i'th route is 20 hours, meaning the journey begins at the j-th node of the i'th route. i’ The logistics node reaches the (j+1)th node. i’ The transportation time for each logistics node is 20 hours. The departure time variable for the (i'+1)th route is set to 10:00, which is the j-th time of the (i'+1)th route. (i+1)’ The departure time for the first logistics node is 10:00, and the operation time for the (i'+1)th route is 1 hour. Wherein, the (j+1)th... i’ The logistics node and the j-th (i+1)’ Each logistics node belongs to the same logistics node.

[0106] However, because the vehicle transporting the goods arrived at (j+1)th... i’ The j-th (i+1)’ The logistics node time is 10:00, therefore, it cannot be guaranteed that the goods will arrive at the j-th node. (i+1)’ After the first logistics node, the goods will be dispatched at 10:00 AM on the same day, but will need to arrive at the j-th logistics node. (i+1)’ The shipment is scheduled to depart from each logistics node at 10:00 the next day. At this time, it can be determined that the dwell time of the i'+1th route is 24 hours.

[0107] Similarly, based on the departure time of the i'-1th route (20:00) and the route transportation time (20h), and the departure time of the i'th route (10:00) and the operation time (1h), the dwell time of the i'th route can be determined to be 24h.

[0108] Then, based on the dwell time of 24 hours and the transportation time of 20 hours for the i'th route, the total journey time of the i'th route can be determined to be 42 hours. For example, the kth preset flow direction N can be obtained. k = The total travel time of each of the three routes. For example, the total travel times of routes 1, 2, and 3 in the k-th preset flow direction are 42h, 10h, and 30h, respectively.

[0109] Finally, the kth preset is directed to N. k =The total travel time of each of the three routes is added together to get the total travel time of the kth preset flow direction: 42h + 10h + 30h = 82h.

[0110] Method 2: Calculate each preset flow direction N separately kThe arrival time of the (j+1)th node on each of the routes is calculated, and each preset flow direction is assigned to N. k The arrival time of the last node in each route is used as the total duration for each preset flow direction. In this case, step 2041A may specifically include the following steps b1 to b2:

[0111] b1. According to each of the preset flow directions N k The set value of the departure time variable for each route in the route, and the preset flow direction N k The route transport time for each of the routes, and the preset flow direction N. k The operation time of each line in the network is obtained, and the preset flow direction N is obtained. k The number of days for transmission, the precise transmission time, and the preset flow direction N for each of the j-th nodes in each line. k The arrival time variable for the (j+1)th node of each route in the given routes.

[0112] The value of the number of days for the j-th node of each line to issue refers to the number of days required until the j-th node of each line issues the document.

[0113] The precise value of the transmission time variable for the j-th node of each line refers to the precise time when the j-th node of each line transmits the transmission.

[0114] The arrival time variable for the (j+1)th node of each route refers to the number of days required to reach the (j+1)th node of each route.

[0115] The exact arrival time variable for the j-th node of each line refers to the precise time when the j-th node of each line arrives.

[0116] For example, when the duration is in hours, firstly, according to each preset flow direction N k The set value of the departure time variable for each route in each route, and the preset flow direction N. k The route transport time for each of the routes, and the preset flow direction N. k The operation time of each line in the network determines the preset flow direction N. k The dwell time for each route within each route.

[0117] Then, according to each preset flow direction N k The route transport time for each of the routes, and the preset flow direction N. k The dwell time of each route in the network determines the preset flow direction N. k The total travel time for each route within each route.

[0118] Finally, first direct each preset flow to N. kThe total travel time of the first route in each route is divided by a preset number of days (here, the travel time is in hours, so the preset number of days is 24), and this value is used as the basis for each preset flow direction N. k The arrival day variable value of the (j+1)th node of the first route in each route; and the preset flow direction N k The arrival day variable value of the (j+1)th node of the i'th route in each route, and the value of each preset flow direction N. k The sum of the values ​​obtained by dividing the total duration of the (i'+1)th route in each route by the preset number of days is used as the value for each preset flow direction N. k The arrival day variable value for the (i'+1)th node of the (j+1)th route in each route. Similarly, the arrival day variable value for each preset flow direction N can be determined. k The arrival time variable for the (j+1)th node of each route in the given routes.

[0119] For ease of understanding, we will continue to use steps a1 to a3 as examples. Please refer to... Figure 3 Assume the k-th preset flow direction is Figure 3 The preset flow direction 4 is: G->C->D->E. For example, when obtaining the k-th preset flow direction N... k =The total travel time of each of the three routes, such as the total travel times of routes 1 (i.e., route GC), 2 (i.e., route CD), and 3 (i.e., route DE) in the k-th preset flow direction, which are 42h, 10h, and 30h respectively: ① Divide the total travel time of route 1, 42h, by the preset day conversion value of 24h / day, and use it as the arrival day variable value of 1.75 days for the (j+1)th node (i.e., node C) of route 1. ② Add the arrival day variable value of 1.75 days for the (j+1)th node (i.e., node C) of route 1 to the value obtained by dividing the total travel time of route 2, 10h, by the preset day conversion value of 24h / day (approximately 0.42 days) (i.e., 1.75 days + 0.42 days = 2.17 days), and use it as the arrival day variable value of 2.17 days for the (j+1)th node (i.e., node D) of route 2.

[0120] b2. Determine the total duration of each preset flow direction based on the arrival day variable value of the last node of each preset flow direction.

[0121] Wherein, the last node of each preset flow direction is the Nth node of each preset flow direction. k The (j+1)th node of each line.

[0122] For example, the arrival time of the last node in each preset flow direction can be directly used as the total duration of the preset flow direction.

[0123] 2042A. Using the expression, based on the total duration of each preset flow and the cargo volume of each preset flow, obtain the total cargo timeliness of M preset flows, which serves as the network-wide flow timeliness corresponding to each departure time planning strategy.

[0124] For example, under departure time planning strategy 1, it can be determined that among the target network M = 3 preset routes, the total journey time of the 1st, 2nd, and 3rd preset routes is 20h, 20h, and 20h respectively, and the cargo volume of the 1st, 2nd, and 3rd preset routes is 20, 20, and 20 respectively. Then the total cargo time of M preset routes is: 20h*20 + 20h*20 + 20h*20 = 1200h. Thus, the total network time of departure time planning strategy 1 is determined to be 1200h.

[0125] Because the calculation of the timeliness of the entire network flow takes into account the volume of goods in the preset flow direction, the timeliness of the flow direction with high volume of goods can be guaranteed first.

[0126] (ii) When the expression for the timeliness of the entire network flow corresponding to the departure time planning strategy is as shown in formula (2).

[0127] At this time, as Figure 6 As shown, step 204 may specifically include the following steps 2041B to 2043B:

[0128] 2041B. Under each of the departure time planning strategies, the dwell time of each of the n routes is obtained by means of the expression, based on the set value of the departure time variable of each of the n routes, the route transportation time of each of the n routes, and the operation time of each of the n routes.

[0129] For example, in the same preset flow direction, the departure time variable of the i'th route is set to 20:00, that is, the j'th departure time of the i'th route... i’ The departure time for each logistics node is 20:00; the transportation time for the i'th route is 20 hours, meaning the journey begins at the j-th node of the i'th route. i’ The logistics node reaches the (j+1)th node. i’ The transportation time for each logistics node is 20 hours. The departure time variable for the (i'+1)th route is set to 10:00, which is the j-th time of the (i'+1)th route. (i+1)’ The departure time for the first logistics node is 10:00, and the operation time for the (i'+1)th route is 1 hour. Wherein, the (j+1)th... i’ The logistics node and the j-th (i+1)’ Each logistics node belongs to the same logistics node.

[0130] However, because the vehicle transporting the goods arrived at (j+1)th... i’The j-th (i+1)’ The logistics node time is 10:00, therefore it cannot be guaranteed that the goods will arrive at the j-th node. (i+1)’ After the first logistics node, the goods will be dispatched at 10:00 AM on the same day, but will need to arrive at the j-th logistics node. (i+1)’ The shipment is scheduled to depart from each logistics node at 10:00 the next day. At this time, it can be determined that the dwell time of the i'+1th route is 24 hours.

[0131] 2042B. Using the expression, determine the total duration of each of the n routes based on the route transportation time of each of the n routes and the dwell time of each of the n routes.

[0132] For example, if the travel time of the i-th route among n routes is 12 hours and the stop time of the i-th route is 24 hours, then the total travel time of the i-th route can be determined as: 12 + 24 = 36 hours.

[0133] 2043B. Using the expression, based on the total journey time of each of the n routes and the cargo volume of each of the n routes, the total cargo timeliness of the n routes is obtained, which is used as the overall network flow timeliness corresponding to each departure time planning strategy.

[0134] For example, under departure time planning strategy 2, it can be determined that the total journey time of the 1st, 2nd, and 3rd routes out of n=3 routes is 10h, 20h, and 30h respectively, and the cargo volume of the 1st, 2nd, and 3rd routes is 10, 20, and 30 respectively. Then the total cargo transit time of n routes is: 10h*10+20h*20+30h*30=1400h. Thus, the overall network flow transit time corresponding to departure time planning strategy 2 is determined to be 1400h.

[0135] Because the freight volume of a route is taken into account when calculating the timeliness of the entire network flow, priority can be given to ensuring the timeliness of routes with high freight volume.

[0136] 205. Output the target departure time planning strategy that corresponds to the shortest timeliness of the entire network flow.

[0137] Among them, the target departure time planning strategy is the one with the shortest timeliness for the entire network flow among all departure time planning strategies. The target departure time planning strategy is used to indicate the target departure time for each of the n routes.

[0138] For example, in step 203, three departure time planning strategies for the entire target network are obtained: departure time planning strategies 1, 2, and 3. The corresponding network-wide flow timeliness for departure time planning strategies 1, 2, and 3 are 400h, 500h, and 600h, respectively. Since departure time planning strategy 1 corresponds to the shortest network-wide flow timeliness, it is adopted as the target departure time planning strategy and output as such. This allows relevant logistics management personnel to view the strategy and rationally arrange the departure times of n routes in the target network, thereby improving the overall timeliness of the target network.

[0139] In this embodiment, an expression for the overall network flow efficiency corresponding to the departure time planning strategy is constructed based on the preset departure time variables of each of the n routes in the target network. According to the departure time range, logistics transportation information, and the expression for each of the n routes, the overall network flow efficiency corresponding to each departure time planning strategy of the target network is determined. The target departure time planning strategy with the shortest overall network flow efficiency is then output. On the one hand, since departure time planning is based on the preset flow logistics transportation information of the target network, there is no need to change the route planning of the target network. With the route planning of the target network unchanged, departure time planning is performed, and the target departure time planning strategy with the shortest overall network flow efficiency is selected. This avoids the problem that relying solely on route optimization due to cost constraints can only improve logistics efficiency to a certain extent. Improving logistics efficiency through departure time planning improves logistics efficiency at a deeper level, maximizing the improvement of logistics efficiency without changing costs. On the other hand, since the departure time planning is based on setting variables from the route data of the entire target network, the optimal departure time for multiple routes in the entire target network can be planned simultaneously at one time, achieving global optimization that cannot be achieved manually; and since the departure time of multiple routes in the entire target network is planned simultaneously, the planning speed of the departure time of the routes in the entire target network can be improved.

[0140] Furthermore, in step b1 above, each preset flow direction N can be further determined. k The precise arrival time variable value of the (j+1)th node in each of the several routes is determined to identify the precise arrival time variable value of the last node in each preset flow direction. Specifically, the precise arrival time variable value of each preset flow direction N is determined. k The precise arrival time variable value of the (j+1)th node in each of the routes can specifically include: based on the preset flow direction N. k The set value of the departure time variable for each route in the route, and the preset flow direction N k The route transportation time for each of the several routes is obtained, and the preset flow direction N is obtained. k The precise arrival time variable value of the (j+1)th node in each of the routes.

[0141] For example, in the k-th preset flow direction, according to the k-th preset flow direction N k The departure time variable of the i'th route is set to a value (e.g., 12:00), the transportation time of the i'th route is 25 hours, and the precise arrival time variable value of the i'th route is determined (i.e., 1:00).

[0142] At this point, step b2 may specifically include the following steps b21 to b22:

[0143] b21. Determine the target delivery time for each preset flow direction based on the precise variable value of the arrival time of the last node of each preset flow direction.

[0144] Step b21 may specifically include: obtaining the target delivery time that has a mapping relationship with the target value of each preset flow direction according to a preset mapping relationship table.

[0145] The target value for each preset flow direction is the precise arrival time variable value of the last node of each preset flow direction. The mapping table includes multiple preset time values ​​and delivery durations that are mapped to each preset time value.

[0146] The target delivery time refers to the time required for goods in a preset flow direction to be delivered after arriving at the last node of the preset flow direction.

[0147] To facilitate understanding, a specific example will be used. For instance, the mapping relationship table is shown in Table 1 below:

[0148] 0：00≤T＜10：00 6 10：00≤T＜16：00 2 16：00≤T＜24：00 10

[0149] If the arrival time of the last node in the k-th preset flow direction is 10:30, then the delivery time of 6h, which is mapped to the arrival time of 10:30, can be obtained from Table 1 and used as the target delivery time for the k-th preset flow direction.

[0150] b22. Determine the total duration of each preset flow based on the arrival day variable value of the last node of each preset flow and the target delivery time of each preset flow.

[0151] Specifically, the total duration of the k-th preset flow is determined by first dividing the target delivery time of the k-th preset flow by the preset number of days conversion value, and then adding the result to the arrival day variable value of the last node of the k-th preset flow.

[0152] For example, if the arrival time of the last node of the k-th preset flow is 2 days and the target delivery time of the k-th preset flow is 10 hours, then the total duration of the k-th preset flow can be determined as: 2 days + (10 / 24) days ≈ 2.42 days.

[0153] As can be seen, after determining the precise arrival time of the last node in each preset flow direction, the total duration of each preset flow direction can be determined by combining the arrival day of the last node in each preset flow direction with the delivery time in each preset flow direction. Because the delivery time is also incorporated into determining the total duration of each preset flow direction, the corresponding network-wide flow timeliness calculation becomes more accurate.

[0154] To better implement the departure time planning method in the embodiments of this application, a departure time planning device is also provided in the embodiments of this application, such as... Figure 7 The diagram shown is a structural schematic of one embodiment of the departure time planning device in this application. The departure time planning device 700 includes:

[0155] Processing unit 701 is used to construct an expression for the network-wide flow timeliness corresponding to the departure time planning strategy based on the preset departure time variable of each of the n lines in the target network.

[0156] The processing unit 701 is further configured to acquire logistics transportation information for each of the M preset flow directions in the target network, wherein the logistics transportation information includes the cargo volume of each preset flow direction and the N values ​​of each preset flow direction. k The route transport time for each of the routes, and the preset flow direction N k The operation time of each line in the network, M, N k Both n and are positive integers greater than 0;

[0157] The processing unit 701 is also used to obtain the range of departure times for each of the n routes;

[0158] The processing unit 701 further determines the overall network flow timeliness corresponding to each departure time planning strategy of the target network based on the departure time range of each of the n routes, the logistics transportation information, and the expression;

[0159] Output unit 702 is used to output the target departure time planning strategy with the shortest timeliness for the entire network flow direction, wherein the target departure time planning strategy is used to indicate the target departure time of each of the n lines.

[0160] In some embodiments of this application, the processing unit 701 is specifically used for:

[0161] Based on the range of departure times for each of the n routes, the preset values ​​of the departure time variables for each of the n routes are obtained, resulting in a set of preset values ​​for the n routes.

[0162] The set of settings for the n routes is used as the departure time planning strategy for the entire target network, thus obtaining the departure time planning strategies for the entire target network.

[0163] Based on the logistics transportation information and the expression, determine the network-wide flow timeliness corresponding to each departure time planning strategy of the target network.

[0164] In some embodiments of this application, the processing unit 701 is specifically used for:

[0165] Based on the expression, according to each of the preset flow directions N k The set value of the departure time variable for each route in the route, and the preset flow direction N k The route transport time for each of the routes, and the preset flow direction N. k The operation time of each line in the line is obtained, and the total duration of each preset flow direction is obtained.

[0166] Based on the expression, the total cargo timeliness of M preset routes is obtained according to the total duration of each preset route and the cargo volume of each preset route, and is used as the overall network route timeliness corresponding to the departure time planning strategy.

[0167] In some embodiments of this application, the processing unit 701 is specifically used for:

[0168] According to each of the preset flow directions N k The set value of the departure time variable for each route in the route, and the preset flow direction N k The route transport time for each of the routes, and the preset flow direction N. k The operation time of each line in the network is obtained, and the preset flow direction N is obtained. k The number of days for transmission, the precise transmission time, and the preset flow direction N for each of the j-th nodes in each line. k The arrival time variable value of the (j+1)th node of each route in the route;

[0169] Based on the arrival day variable value of the last node in each preset flow direction, the total duration of each preset flow direction is determined, wherein the last node in each preset flow direction is the Nth node in each preset flow direction. k The (j+1)th node of each line.

[0170] In some embodiments of this application, the processing unit 701 is specifically used for:

[0171] According to each of the preset flow directions N k The set value of the departure time variable for each route in the route, and the preset flow direction N k The route transportation time for each of the routes is obtained, and the preset flow direction N is obtained. k The precise arrival time variable value of the (j+1)th node of each of the routes;

[0172] The target delivery time for each preset flow direction is determined based on the precise variable value of the arrival time of the last node in each preset flow direction.

[0173] The total duration of each preset flow is determined based on the arrival day variable value of the last node of each preset flow and the target delivery time of each preset flow.

[0174] In some embodiments of this application, the processing unit 701 is specifically used for:

[0175] According to a preset mapping table, the target delivery time that is mapped to the target value of each preset flow direction is obtained. The target value of each preset flow direction is the precise arrival time variable value of the last node of each preset flow direction. The mapping table includes multiple preset time values ​​and delivery times that are mapped to each preset time value.

[0176] In some embodiments of this application, the processing unit 701 is specifically used for:

[0177] Get the preset time segmentation interval value;

[0178] The time values ​​are segmented based on the time segmentation interval value, the earliest departure time of each of the n routes, and the latest departure time of each of the n routes to obtain the departure time range of each of the n routes. The departure time range of each of the n routes includes multiple time segmentation values.

[0179] In practice, each of the above units can be implemented as an independent entity or can be arbitrarily combined to be implemented as the same or several entities. For the specific implementation of each of the above units, please refer to the previous method embodiments, which will not be repeated here.

[0180] Because this departure time planning device can perform the functions described in this application, Figures 1 to 6 Corresponding to the steps in the departure time planning method in any embodiment, the present application can be implemented as described above. Figures 1 to 6For details on the beneficial effects that the departure time planning method can achieve in any of the embodiments, please refer to the preceding description, which will not be repeated here.

[0181] Furthermore, to better implement the departure time planning method in the embodiments of this application, based on the departure time planning method, the embodiments of this application also provide an electronic device, see below. Figure 8 , Figure 8 This illustration shows a structural diagram of an electronic device according to an embodiment of this application. Specifically, the electronic device provided in this embodiment includes a processor 801, which executes a computer program stored in a memory 802 to implement, for example... Figures 1 to 6 Corresponding to each step of the departure time planning method in any embodiment; or, when the processor 801 executes the computer program stored in the memory 802, it implements as follows: Figure 7 The functions of each unit in the corresponding embodiment.

[0182] For example, a computer program may be divided into one or more modules / units, one or more of which are stored in memory 802 and executed by processor 801 to complete the embodiments of this application. One or more modules / units may be a series of computer program instruction segments capable of performing a specific function, which describe the execution process of the computer program in a computer device.

[0183] The electronic device may include, but is not limited to, processor 801 and memory 802. Those skilled in the art will understand that the illustrations are merely examples of an electronic device and do not constitute a limitation on the electronic device. It may include more or fewer components than illustrated, or combine certain components, or different components. For example, the electronic device may also include input / output devices, network access devices, buses, etc., with processor 801, memory 802, input / output devices, and network access devices connected via a bus.

[0184] The processor 801 can be a Central Processing Unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor can be a microprocessor or any conventional processor. The processor is the control center of the electronic device, connecting various parts of the electronic device through various interfaces and lines.

[0185] The memory 802 can be used to store computer programs and / or modules. The processor 801 implements various functions of the computer device by running or executing the computer programs and / or modules stored in the memory 802 and by calling data stored in the memory 802. The memory 802 may mainly include a program storage area and a data storage area. The program storage area may store the operating system, application programs required for at least one function (such as sound playback function, image playback function, etc.), etc.; the data storage area may store data created according to the use of the electronic device (such as audio data, video data, etc.). In addition, the memory may include high-speed random access memory, and may also include non-volatile memory, such as hard disk, RAM, plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, at least one disk storage device, flash memory device, or other volatile solid-state storage device.

[0186] Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working process of the departure time planning device, electronic equipment, and their corresponding units described above can be found in, for example... Figures 1 to 6 The specific details of the departure time planning method in any embodiment will not be repeated here.

[0187] Those skilled in the art will understand that all or part of the steps in the various methods of the above embodiments can be performed by instructions, or by instructions controlling related hardware. These instructions can be stored in a computer-readable storage medium and loaded and executed by a processor.

[0188] Therefore, embodiments of this application provide a computer-readable storage medium storing a plurality of instructions that can be loaded by a processor to execute the present application. Figures 1 to 6 For the steps in the departure time planning method corresponding to any embodiment, please refer to the following for specific operations: Figures 1 to 6 The descriptions of the departure time planning methods in any of the embodiments will not be repeated here.

[0189] The computer-readable storage medium may include: read-only memory (ROM), random access memory (RAM), disk or optical disk, etc.

[0190] Because of the instructions stored in the computer-readable storage medium, the present application can be executed as described above. Figures 1 to 6 Corresponding to the steps in the departure time planning method in any embodiment, the present application can be implemented as described above. Figures 1 to 6For details on the beneficial effects that the departure time planning method can achieve in any of the embodiments, please refer to the preceding description, which will not be repeated here.

[0191] The above provides a detailed description of a departure time planning method, apparatus, electronic device, and computer-readable storage medium provided in the embodiments of this application. Specific examples have been used to illustrate the principles and implementation methods of this application. The descriptions of the above embodiments are only for the purpose of helping to understand the method and core ideas of this application. At the same time, for those skilled in the art, there will be changes in the specific implementation methods and application scope based on the ideas of this application. Therefore, the content of this specification should not be construed as a limitation of this application.

Claims

1. A departure time planning method, characterized in that, The method includes: Based on the preset departure time variable for each of the n routes in the target network, an expression for the network-wide flow timeliness corresponding to the departure time planning strategy is constructed, wherein the expression is: ； T k vol represents the timeliness of the k-th preset flow among M preset flows in the entire network. k T represents the quantity of goods in the k-th preset direction out of M preset directions in the entire network. ki This indicates the timeliness of the i-th line in the k-th preset flow direction; Obtain the logistics transportation information for each of the M preset flow directions in the target network, wherein the logistics transportation information includes the cargo volume of each preset flow direction and the N values ​​of each preset flow direction. k The route transport time for each of the routes, and the preset flow direction N k The operation time of each line in the network, M, N k Both n and are positive integers greater than 0; Obtain the range of departure times for each of the n routes; based on the range of departure times for each of the n routes, obtain the preset value of the departure time variable for each of the n routes. Based on the departure time range of each of the n routes, the logistics transportation information, and the expression, the network-wide flow timeliness corresponding to each departure time planning strategy of the target network is determined; wherein, the expression is used to determine the timeliness of each preset flow direction N. k The set value of the departure time variable for each route in the route, and the preset flow direction N k The route transport time for each of the routes, and the preset flow direction N. k The operation time of each line in the network is obtained, and the preset flow direction N is obtained. k The number of days for transmission, the precise transmission time, and the preset flow direction N for each of the j-th nodes in each line. k The arrival day variable value of the (j+1)th node in each route; based on the arrival day variable value of the last node in each preset flow direction, the total duration of each preset flow direction is determined, wherein the last node in each preset flow direction is the Nth node in each preset flow direction. k The (j+1)th node of each route; using the expression, based on the total duration of each preset flow and the cargo volume of each preset flow, obtain the total cargo timeliness of M preset flows, which serves as the overall network flow timeliness corresponding to each departure time planning strategy; Output the target departure time planning strategy that corresponds to the shortest time of the entire network flow, wherein the target departure time planning strategy is used to indicate the target departure time of each of the n routes.

2. The departure time planning method according to claim 1, characterized in that, The step of determining the network-wide flow timeliness corresponding to each departure time planning strategy of the target network based on the departure time range of each of the n routes, the logistics transportation information, and the expression includes: Based on the preset departure time variable settings for each of the n routes, a set of preset values ​​for the n routes is obtained. The set of settings for the n routes is used as the departure time planning strategy for the entire target network, thus obtaining the departure time planning strategies for the entire target network. Based on the logistics transportation information and the expression, determine the network-wide flow timeliness corresponding to each departure time planning strategy of the target network.

3. The departure time planning method according to claim 1, characterized in that, The method further includes: According to each of the preset flow directions N k The set value of the departure time variable for each route in the route, and the preset flow direction N k The route transportation time for each of the routes is obtained, and the preset flow direction N is obtained. k The precise arrival time variable value of the (j+1)th node of each of the routes; The step of determining the total duration of each preset flow direction based on the arrival day variable value of the last node of each preset flow direction includes: The target delivery time for each preset flow direction is determined based on the precise variable value of the arrival time of the last node in each preset flow direction. The total duration of each preset flow is determined based on the arrival day variable value of the last node of each preset flow and the target delivery time of each preset flow.

4. The departure time planning method according to claim 3, characterized in that, The step of determining the target delivery time for each preset flow direction based on the precise variable value of the arrival time of the last node in each preset flow direction includes: According to a preset mapping table, the target delivery time that is mapped to the target value of each preset flow direction is obtained. The target value of each preset flow direction is the precise arrival time variable value of the last node of each preset flow direction. The mapping table includes multiple preset time values ​​and delivery times that are mapped to each preset time value.

5. The departure time planning method according to any one of claims 1 to 4, characterized in that, The logistics transportation information also includes the earliest departure time and the latest departure time for each of the n routes. Obtaining the range of departure times for each of the n routes includes: Get the preset time segmentation interval value; The time values ​​are segmented based on the time segmentation interval value, the earliest departure time of each of the n routes, and the latest departure time of each of the n routes to obtain the departure time range of each of the n routes. The departure time range of each of the n routes includes multiple time segmentation values.

6. A departure time planning device, characterized in that, The departure time planning device includes: The processing unit is used to construct an expression for the network-wide flow timeliness corresponding to the departure time planning strategy, based on the preset departure time variable of each of the n lines in the target network. The expression is: ； T k vol represents the timeliness of the k-th preset flow among M preset flows in the entire network. k T represents the quantity of goods in the k-th preset direction out of M preset directions in the entire network. ki This indicates the timeliness of the i-th line in the k-th preset flow direction; The processing unit is further configured to acquire logistics transportation information for each of the M preset flow directions in the target network, wherein the logistics transportation information includes the cargo volume for each preset flow direction and the N values ​​for each preset flow direction. k The route transport time for each of the routes, and the preset flow direction N k The operation time of each line in the network, M, N k Both n and are positive integers greater than 0; The processing unit is also used to obtain the range of departure times for each of the n routes; The processing unit is further configured to determine the network-wide flow timeliness corresponding to each departure time planning strategy of the target network based on the departure time range of each of the n routes, the logistics transportation information, and the expression; wherein, the expression is used to determine the network-wide flow timeliness corresponding to each of the preset flow directions N. k The set value of the departure time variable for each route in the route, and the preset flow direction N k The route transport time for each of the routes, and the preset flow direction N. k The operation time of each line in the network is obtained, and the preset flow direction N is obtained. k The number of days for transmission, the precise transmission time, and the preset flow direction N for each of the j-th nodes in each line. k The arrival day variable value of the (j+1)th node in each route; based on the arrival day variable value of the last node in each preset flow direction, the total duration of each preset flow direction is determined, wherein the last node in each preset flow direction is the Nth node in each preset flow direction. k The (j+1)th node of each route; using the expression, based on the total duration of each preset flow and the cargo volume of each preset flow, obtain the total cargo timeliness of M preset flows, which serves as the overall network flow timeliness corresponding to each departure time planning strategy; The output unit is used to output the target departure time planning strategy with the shortest timeliness for the entire network flow, wherein the target departure time planning strategy is used to indicate the target departure time for each of the n lines.

7. An electronic device, characterized in that, It includes a processor and a memory, wherein the memory stores a computer program, and the processor executes the departure time planning method as described in any one of claims 1 to 5 when it invokes the computer program in the memory.

8. A computer-readable storage medium, characterized in that, It stores a computer program, which is loaded by a processor to execute the steps in the departure time planning method according to any one of claims 1 to 5.

Images