Transportation route planning methods, devices, electronic equipment and readable storage media
By determining transportation routing strategies within the logistics network and comprehensively considering transportation and node processing costs, the problem of low accuracy in logistics transportation route planning is solved, achieving both accuracy and cost reduction in the overall network delivery cost.
Patent Information
- Application Number
- CN202210209184.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-03-04
- Publication Date
- 2026-11-17
- Estimated Expiration
- 2042-03-04
AI Technical Summary
Existing logistics transportation route planning methods are not very accurate and cannot effectively reduce transportation costs.
By acquiring the target goods to be transported in the target logistics network, determining the transportation routing strategy based on the cargo volume, transportation origin node, and destination node, and comprehensively considering transportation costs and node processing costs, the target transportation routing strategy corresponding to the minimum overall network delivery cost is output.
It improves the accuracy of transportation route planning, enabling optimal transportation route planning for all target goods at once, achieving global optimization and reducing transportation costs.
Smart Images

Figure CN117217342B_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of logistics technology, specifically to a transportation route planning method, apparatus, electronic device, and readable storage medium. Background Technology
[0002] With the booming development of e-commerce, the logistics industry has also developed rapidly. However, along with this rapid development, the cost of logistics transportation has also risen sharply. Therefore, how to reduce the cost of logistics transportation has become an increasingly important issue for practitioners in the logistics industry.
[0003] To reduce logistics and transportation costs, an effective method is to plan the transportation routes of the logistics network, and researchers have been paying close attention to this issue. However, current methods for planning transportation routes are still not accurate enough to be applied in actual production. Summary of the Invention
[0004] This application provides a transportation route planning method, apparatus, electronic device, and readable storage medium, aiming to solve the problem of low accuracy in transportation route planning methods.
[0005] Firstly, this application provides a transportation route planning method, including:
[0006] Obtain the target goods to be transported within the target logistics network;
[0007] Based on the cargo volume, transportation origin node, and transportation destination node of each target cargo, a transportation routing strategy is determined, wherein the transportation routing strategy includes the route transportation volume of each target cargo allocated to each preset path in the target logistics network;
[0008] Obtain the transportation cost and node processing cost of each of the aforementioned transportation routing strategies;
[0009] Based on the corresponding transportation cost and node processing cost, determine the network-wide delivery cost of each transportation routing strategy;
[0010] Output the target transportation routing strategy corresponding to the minimum overall network delivery cost.
[0011] In one possible implementation of this application, the transportation cost includes vehicle operating costs;
[0012] The process of obtaining the transportation cost and node processing cost of each of the transportation routing strategies includes:
[0013] Obtain the logistics sub-paths in each of the preset paths;
[0014] Based on the transportation volume of each path in each transportation routing strategy, the line transportation volume of each logistics sub-path in each transportation routing strategy is calculated.
[0015] Based on the transportation volume of each route corresponding to each transportation routing strategy, determine the vehicle driving cost and node processing cost of each transportation routing strategy.
[0016] In one possible implementation of this application, determining the vehicle travel cost and node processing cost for each transportation routing strategy based on the transportation volume of each route corresponding to each transportation routing strategy includes:
[0017] Based on the transportation volume of each route corresponding to each transportation routing strategy, the cargo processing volume of each node in each transportation routing strategy is calculated.
[0018] The node processing cost of each transportation routing strategy is determined based on the preset unit cargo processing cost of each node and the cargo processing volume of each node in each transportation routing strategy.
[0019] Based on the preset cargo capacity of the transport vehicles and the transport volume of each route corresponding to each transport routing strategy, determine the number of vehicles to depart from each logistics sub-path in each transport routing strategy.
[0020] The vehicle travel cost of each transportation routing strategy is determined based on the sub-path distance of each logistics sub-path and the number of departures corresponding to each transportation routing strategy.
[0021] In one possible implementation of this application, the transportation cost also includes transportation timeout costs;
[0022] After determining the vehicle travel cost and node processing cost of each transportation routing strategy based on the transportation volume of each route corresponding to each transportation routing strategy, the method further includes:
[0023] Obtain the preset timeout cost for each of the preset paths;
[0024] The transportation timeout cost of each transportation routing strategy is determined based on the path transportation volume of each preset path in each transportation routing strategy and the corresponding preset timeout cost.
[0025] In one possible implementation of this application, determining the transportation routing strategy based on the quantity of each target cargo, the originating node, and the destination node includes:
[0026] An initial routing strategy is determined based on the cargo volume, originating node, and destination node of each target cargo. The initial routing strategy includes the route transportation volume of each target cargo allocated to each preset path in the target logistics network.
[0027] Based on the route transportation volume of each preset path in each initial routing strategy and the preset transportation capacity information of the target logistics network, each initial routing strategy is filtered to obtain a transportation routing strategy. The preset transportation capacity information includes at least one of the cargo handling capacity information of each node and the transportation timeliness achievement information of each preset path.
[0028] In one possible implementation of this application, the preset transportation capacity information includes at least one of the following: cargo handling capacity information of each node and transportation timeliness achievement information of each preset path.
[0029] The step of filtering each initial routing strategy based on the route transportation volume of each preset path in each initial routing strategy and the preset transportation capacity information of the target logistics network to obtain a transportation routing strategy includes:
[0030] Based on the transportation timeliness achievement information corresponding to each preset path and the path transportation volume of each initial routing strategy, the timeliness achievement ratio of each initial routing strategy is calculated, and the initial routing strategy with the timeliness achievement ratio greater than or equal to the preset ratio threshold is set as the transportation routing strategy.
[0031] and / or
[0032] Based on the transportation volume of each path corresponding to each transportation routing strategy, the cargo handling volume of each node in each transportation routing strategy is calculated. Based on the cargo handling capacity information of each node and the cargo handling volume corresponding to each initial routing strategy, each initial routing strategy is filtered to obtain a transportation routing strategy. The cargo handling volume of each transportation routing strategy is less than or equal to the cargo handling capacity value of the corresponding node. The cargo handling capacity value includes at least one of the number of loading bays and the maximum cargo capacity.
[0033] In one possible implementation of this application, after outputting the target transportation routing strategy corresponding to the minimum network-wide delivery cost, the method further includes:
[0034] Based on the route transportation volume of each preset path in the target transportation routing strategy, and according to the shift information of each node in the target logistics network, the delivery time of each preset path is planned to obtain the target delivery shift strategy with the lowest total logistics cost.
[0035] Output the target delivery schedule strategy.
[0036] Secondly, this application provides a transportation route planning device, comprising:
[0037] The first acquisition module is used to acquire the target goods to be transported in the target logistics network.
[0038] The first determining module is used to determine a transportation routing strategy based on the cargo volume, transportation origin node and transportation destination node of each target cargo, wherein the transportation routing strategy includes the route transportation volume of each target cargo allocated to each preset path in the target logistics network;
[0039] The second acquisition module is used to acquire the transportation cost and node processing cost of each of the aforementioned transportation routing strategies;
[0040] The second determining module is used to determine the network-wide delivery cost of each of the transportation routing strategies based on the corresponding transportation cost and the node processing cost.
[0041] The output module is used to output the target transportation routing strategy corresponding to the minimum overall network delivery cost.
[0042] In one possible implementation of this application, the transportation cost includes vehicle operating costs, and the second acquisition module is further configured to:
[0043] Obtain the logistics sub-paths in each of the preset paths;
[0044] Based on the transportation volume of each path in each transportation routing strategy, the line transportation volume of each logistics sub-path in each transportation routing strategy is calculated.
[0045] Based on the transportation volume of each route corresponding to each transportation routing strategy, determine the vehicle driving cost and node processing cost of each transportation routing strategy.
[0046] In one possible implementation of this application, the second acquisition module is further configured to:
[0047] Based on the transportation volume of each route corresponding to each transportation routing strategy, the cargo processing volume of each node in each transportation routing strategy is calculated.
[0048] The node processing cost of each transportation routing strategy is determined based on the preset unit cargo processing cost of each node and the cargo processing volume of each node in each transportation routing strategy.
[0049] Based on the preset cargo capacity of the transport vehicles and the transport volume of each route corresponding to each transport routing strategy, determine the number of vehicles to depart from each logistics sub-path in each transport routing strategy.
[0050] The vehicle travel cost of each transportation routing strategy is determined based on the sub-path distance of each logistics sub-path and the number of departures corresponding to each transportation routing strategy.
[0051] In one possible implementation of this application, the transportation cost further includes transportation timeout costs, and the second acquisition module is further configured to:
[0052] Obtain the preset timeout cost for each of the preset paths;
[0053] The transportation timeout cost of each transportation routing strategy is determined based on the path transportation volume of each preset path in each transportation routing strategy and the corresponding preset timeout cost.
[0054] In one possible implementation of this application, the first determining module is further configured to:
[0055] An initial routing strategy is determined based on the cargo volume, originating node, and destination node of each target cargo. The initial routing strategy includes the route transportation volume of each target cargo allocated to each preset path in the target logistics network.
[0056] Based on the route transportation volume of each preset path in each initial routing strategy and the preset transportation capacity information of the target logistics network, each initial routing strategy is filtered to obtain a transportation routing strategy. The preset transportation capacity information includes at least one of the cargo handling capacity information of each node and the transportation timeliness achievement information of each preset path.
[0057] In one possible implementation of this application, the first determining module is further configured to:
[0058] Based on the transportation timeliness achievement information corresponding to each preset path and the path transportation volume of each initial routing strategy, the timeliness achievement ratio of each initial routing strategy is calculated, and the initial routing strategy with the timeliness achievement ratio greater than or equal to the preset ratio threshold is set as the transportation routing strategy.
[0059] and / or
[0060] Based on the transportation volume of each path corresponding to each transportation routing strategy, the cargo handling volume of each node in each transportation routing strategy is calculated. Based on the cargo handling capacity information of each node and the cargo handling volume corresponding to each initial routing strategy, each initial routing strategy is filtered to obtain a transportation routing strategy. The cargo handling volume of each transportation routing strategy is less than or equal to the cargo handling capacity value of the corresponding node. The cargo handling capacity value includes at least one of the number of loading bays and the maximum cargo capacity.
[0061] In one possible implementation of this application, the output module is further used for:
[0062] Based on the route transportation volume of each preset path in the target transportation routing strategy, and according to the shift information of each node in the target logistics network, the delivery time of each preset path is planned to obtain the target delivery shift strategy with the lowest total logistics cost.
[0063] Output the target delivery schedule strategy.
[0064] Thirdly, this application also provides an electronic device, which includes a processor, a memory, and a computer program stored in the memory and executable on the processor. When the processor calls the computer program in the memory, it executes the steps in any of the transportation route planning methods provided in this application.
[0065] Fourthly, this application also provides a readable storage medium storing a computer program, which, when executed by a processor, implements the steps in any of the transportation route planning methods provided in this application.
[0066] In summary, the transportation route planning method provided in this application includes: obtaining target goods to be transported in a target logistics network; determining a transportation route strategy based on the cargo volume, transportation origin node, and transportation destination node of each target goods, wherein the transportation route strategy includes the path transportation volume of each target goods allocated to each preset path in the target logistics network; obtaining the transportation cost and node processing cost of each transportation route strategy; determining the network-wide delivery cost of each transportation route strategy based on the corresponding transportation cost and node processing cost; and outputting the target transportation route strategy corresponding to the minimum network-wide delivery cost.
[0067] On the one hand, this method comprehensively considers both transportation costs and node processing costs when calculating the overall network delivery cost. Compared to traditional planning methods, it considers more types of costs, thereby improving the accuracy of the overall network delivery cost. Therefore, planning the transportation route of target goods by obtaining the target transportation routing strategy can directly reduce costs. On the other hand, since the transportation route planning is based on each target good in the target logistics network, the optimal transportation routing strategy can be planned for all target goods at the same time, achieving global optimization that is impossible to achieve manually, and also improving the speed of target goods transportation route planning. Attached Figure Description
[0068] 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.
[0069] Figure 1 This is a schematic diagram illustrating an application scenario of the transportation route planning method provided in the embodiments of this application;
[0070] Figure 2 This is a flowchart illustrating a transportation route planning method provided in an embodiment of this application;
[0071] Figure 3 This is a schematic diagram of a target logistics network provided in the embodiments of this application;
[0072] Figure 4 This is a schematic diagram of a process for obtaining transportation timeout costs provided in an embodiment of this application;
[0073] Figure 5 This is a schematic diagram of a process for obtaining a transportation routing strategy provided in an embodiment of this application;
[0074] Figure 6 This is a schematic diagram of a delivery schedule strategy provided in the embodiments of this application;
[0075] Figure 7 This is a schematic diagram of an embodiment of the transportation route planning device provided in this application.
[0076] Figure 8 This is a schematic diagram of an embodiment of the electronic device provided in this application. Detailed Implementation
[0077] 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.
[0078] 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.
[0079] 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.
[0080] This application provides a transportation route planning method, apparatus, electronic device, and readable storage medium. The transportation route planning apparatus can be integrated into an electronic device, which may be a server or a terminal, etc.
[0081] The execution subject of the transportation route planning method in this application embodiment can be the transportation route 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 transportation route planning device. The transportation route 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).
[0082] The electronic device can operate independently or in a cluster.
[0083] See Figure 1 , Figure 1 This is a schematic diagram of a transportation route planning system provided in an embodiment of this application. The transportation route planning system may include an electronic device 100, which integrates a transportation route planning unit.
[0084] In addition, such as Figure 1 As shown, the transportation route planning system may also include a memory 200 for storing data, such as text data.
[0085] It should be noted that, Figure 1The schematic diagram of the transportation route planning system shown is merely an example. The transportation route planning system and scenario described in this application are intended to more clearly illustrate 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 transportation route planning systems and the emergence of new business scenarios, the technical solutions provided in this application are also applicable to similar technical problems.
[0086] The following describes the transportation route planning method provided in the embodiments of this application. 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 transportation route planning method includes: obtaining target goods to be transported in a target logistics network; determining a transportation route strategy based on the quantity of each target goods, the transportation origin node, and the transportation destination node, wherein the transportation route strategy includes the path transportation volume of each target goods allocated to each preset path in the target logistics network; obtaining the transportation cost and node processing cost of each transportation route strategy; determining the network-wide delivery cost of each transportation route strategy based on the corresponding transportation cost and node processing cost; and outputting the target transportation route strategy corresponding to the minimum network-wide delivery cost.
[0087] Reference Figure 2 , Figure 2 This is a flowchart illustrating a transportation route planning method provided in an embodiment of this application. It should be noted that although a 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. Specifically, the transportation route planning method may include the following steps 201-205, wherein:
[0088] 201. Obtain the target goods to be transported in the target logistics network.
[0089] A logistics network is a network structure composed of two basic elements: paths that carry out the mission of logistics movement and nodes that carry out the mission of logistics cessation (i.e., logistics nodes, or simply nodes). A logistics network contains multiple nodes, as well as multiple pre-defined paths obtained by arranging and combining these nodes according to different flow directions.
[0090] The flow direction refers to the entire route of goods from the place of origin to the destination.
[0091] refer to Figure 3 For ease of explanation, Figure 3 The target logistics network in the text contains only three nodes: node A, node B, and node C. This is understandable. Figure 3The target logistics network also includes 12 preset paths obtained by arranging and combining nodes A, B, and C. Refer to Table 1, which shows the 12 preset paths:
[0092] Preset path 1 A->B->C Preset path 2 A->C->B Preset path 3 B->C->A Preset path 4 B->A->C Preset path 5 C->A->B Preset path 6 C->B->A Preset path 7 A->B Preset path 8 A->C Preset path 9 B->A Preset path 10 B->C Preset path 11 C->A Preset path 12 C->B
[0093] Table 1
[0094] In Table 1, each node is assumed to operate on a two-shift basis, with each node containing only one consolidation shift and one loose cargo shift. This means that when processing target goods at a node, differences in delivery times within the node are not considered to reduce the computational load when obtaining the target transportation routing strategy. For ease of explanation and understanding, unless otherwise specified, the preset paths in this method will be assumed to be based on a two-shift basis in the following text. After obtaining the target transportation routing strategy, the delivery time of each node can be further planned according to the target transportation routing strategy, as explained in detail later.
[0095] A node can refer to a transit point, a sorting plant, etc., and this application does not limit this.
[0096] Target cargo refers to the cargo to be transported between nodes in the target logistics network. In the embodiments of this application, for ease of understanding, a batch of cargo with the same origin and destination can be referred to as a target cargo.
[0097] To facilitate understanding, a specific example will be provided: refer to Table 2 and... Figure 3 Table 2 shows that in Figure 3 This describes one scenario for target goods within a target logistics network, where the quantity of goods can be attributes such as the weight of the target goods.
[0098]
[0099]
[0100] Table 2
[0101] Understandably, in Table 2, target goods A_B correspond to goods from... Figure 3 In the target logistics network, the target goods transported from node A to node B, and target goods A_C correspond to goods transported from node A to node B. Figure 3 The target goods are transported from node A to node C in the target logistics network.
[0102] In some embodiments, information about the target goods can be obtained from orders received at each node in the target logistics network. For example, the origin, destination, and quantity of the target goods can be obtained based on the orders. Figure 3The orders received by nodes A, B, and C are aggregated to obtain the origin and destination of the target goods. Based on the origin and destination, statistics are performed to obtain the quantity of each target goods.
[0103] 202. Determine a transportation routing strategy based on the cargo volume, transportation origin node, and transportation destination node of each target cargo, wherein the transportation routing strategy includes the route transportation volume of each target cargo allocated to each preset path in the target logistics network.
[0104] The origin node of a transport can refer to the place of origin of the corresponding target goods, and the destination node of a transport can refer to the destination of the corresponding target goods. Taking Table 2 as an example, if the target goods are transported from node A to node C, the corresponding origin node is node A, and the destination node is node C.
[0105] The route transportation volume of a target cargo refers to the amount of cargo that needs to be transported on each preset route. It can be understood that for a target cargo, the route transportation volume of all preset routes is equal to the cargo volume of the target cargo. Therefore, in each transportation routing strategy, the cargo volume of the target cargo can be transported from the transportation origin node to the transportation destination node.
[0106] In some embodiments, candidate transportation routes for a target cargo can be selected from various preset routes based on the originating node and destination node of the target cargo. Then, the cargo quantity of the target cargo is randomly allocated to each corresponding candidate transportation route, and the allocation quantity of the target cargo on non-candidate transportation routes in each preset route is set to 0. After performing the same processing on all target cargoes, a transportation routing strategy can be obtained.
[0107] A candidate transport route for a target cargo refers to a preset route that matches the origin node and destination node with the origin node and destination node of the target cargo.
[0108] The following example illustrates this point:
[0109] Tables 1 and 2 Figure 3 For example, if the target logistics network refers to Figure 3In the logistics network, the preset paths in the target logistics network are preset paths 1-12 in Table 1. The path transportation volume of a target cargo refers to the allocation volume of each preset path 1-12 after the cargo volume of the target cargo is distributed to preset paths 1-12. That is, the allocation volume of the target cargo volume that needs to be transported through preset paths 1-12. When obtaining a transportation routing strategy, if the target cargo refers to cargo A_B transported from node A to node B, according to Table 2, the cargo volume of the target cargo is 10kg, and the originating node and destination node are node A and node B respectively. Then, the candidate transportation paths for target cargo A_B are preset paths 2 and 7. The cargo volume is allocated to preset paths 2 and 7, and the path transportation volume of other preset paths is set to 0. Table 3 shows one allocation scenario for target cargo A_B.
[0110]
[0111]
[0112] Table 3
[0113] Understandably, since the originating node and destination node of target cargo A_B are node A and node B respectively, the transportation volume for all preset paths other than preset path 2 and preset path 7 is 0, to avoid misdelivering target cargo A_B to node C. By performing the same processing on target cargo A_B and target cargo C_B, a transportation routing strategy can be obtained.
[0114] Based on the preset routes in Table 1 and the target goods in Table 2, Table 4 shows a transportation routing strategy. Due to space limitations, only the route transportation volume of target goods A_B and target goods C_B is shown in Table 4:
[0115]
[0116]
[0117] Table 4
[0118] Therefore, transportation routing strategy can be understood as the strategy for allocating the quantity of goods to each target cargo.
[0119] In practical applications, due to the large number of nodes in the target logistics network, the number of preset routes is also considerable. Therefore, using a traversal approach to obtain the transportation routing strategy would consume a significant amount of computational resources and take a long time. Thus, a local search method can be used to reduce the planning time.
[0120] Local search is an approximate algorithm, essentially a simple greedy search algorithm. Simply put, local search is the process of generating new feasible solutions by performing a local search within the neighborhood of the current solution, based on a set of feasible solutions.
[0121] When applied to obtain a transportation routing strategy in the embodiments of this application, the route transportation volume of certain target goods on each preset path can be predetermined. Then, based on the predetermined route transportation volume, the cargo volume of other target goods is allocated to obtain the transportation routing strategy. Figure 3 Taking the target logistics network in Table 1 and the target goods in Table 2 as examples, for instance, target goods A_B can be set to direct delivery, that is, all 10kg of target goods A_B are transported through the preset route 7. Then, the quantity of target goods A_C to target goods C_B is allocated to obtain the transportation routing strategy.
[0122] 203. Obtain the transportation cost and node processing cost of each of the aforementioned transportation routing strategies.
[0123] Transportation costs refer to the costs incurred in transporting goods between various nodes. For example, transportation costs may include vehicle operating costs; these costs arise from wear and tear, fuel consumption, and other factors when transporting goods between nodes. Transportation costs can be related to the number of transport vehicles, the total transport distance, and other factors.
[0124] Node processing cost refers to the cost incurred by a node when processing goods. For example, node processing cost may include the labor costs, site rental costs, and packaging material costs incurred by each node when shipping goods. Node processing cost may be related to the amount of goods processed by each node, as well as the address of each node, etc.
[0125] Understandably, since the path transportation volume in different transportation routing strategies is not exactly the same, the transportation cost and node processing cost of different transportation routing strategies are also not exactly the same. The following example illustrates this: In this embodiment, transportation cost refers to vehicle travel cost. Referring to Table 5, Table 5 is a different transportation routing strategy than Table 4, obtained based on the preset paths in Table 1 and the target goods in Table 2. In Tables 4 and 5, except for the path transportation volume of target goods A_B, the path transportation volumes of target goods A_C to target goods C_B are the same:
[0126]
[0127] Table 5
[0128] On the one hand, regarding node processing costs, comparing Tables 4 and 5 reveals that, since the path transportation volume allocated to target cargo A_B on preset path 2 in Table 5 is less than that in Table 4, while in Table 5 the path transportation volume allocated to target cargo B_A on preset path 3, the path transportation volume allocated to target cargo C_B on preset paths 5 and 12, the path transportation volume allocated to target cargo C_A on preset path 6, and the path transportation volume allocated to target cargo C_A on preset path 11 are the same as in Table 4, the amount of cargo that node C needs to process is reduced. With the amount of cargo processed by nodes A and B remaining unchanged (since the path transportation volumes of target cargo A_C and target cargo C_B are the same except for the different path transportation volumes of target cargo A_B), the node processing cost corresponding to Table 5 is less than that corresponding to Table 4.
[0129] On the other hand, regarding transportation costs, the transportation volume of preset route 7 increases, while the transportation volume of preset route 2 decreases. Therefore, assuming the number of transport vehicles remains unchanged, the total transportation distance of the transport vehicles in Table 5 is less than the total transportation distance of the transport vehicles in Table 4, and the transportation cost corresponding to Table 5 is less than the transportation cost corresponding to Table 4.
[0130] In some embodiments, the transportation volume of goods between each two nodes in the target logistics network can be obtained by statistically analyzing the transportation volume of each path corresponding to each target cargo. The node processing cost and vehicle travel cost within the transportation cost can then be obtained based on the transportation volume between each two nodes. In this case, the step "obtaining the transportation cost and node processing cost of each of the aforementioned transportation routing strategies" can be achieved through the following steps:
[0131] (1) Obtain the logistics sub-paths in each of the preset paths.
[0132] Any two adjacent nodes in the preset path constitute a logistics sub-path. Figure 3 For example, the preset path 1 includes logistics sub-paths A->B and B->C.
[0133] (2) Based on the transportation volume of each path in each transportation routing strategy, calculate the line transportation volume of each logistics sub-path in each transportation routing strategy.
[0134] The route transportation volume refers to the transportation volume of target goods on the corresponding logistics sub-path. For example, for a logistics sub-path in a transportation routing strategy, a first preset path containing that logistics sub-path can be selected from preset paths. Then, the route transportation volumes of the first preset path are added together to obtain the route transportation volume of that logistics sub-path. Taking the transportation routing strategy in Table 5 as an example, the first preset paths containing the logistics sub-path C->B in Table 5 are: preset path 2, preset path 6, and preset path 12. Therefore, adding the path transportation volumes corresponding to preset paths 2, 6, and 12 respectively yields the route transportation volume of the logistics sub-path C->B in the transportation routing strategy of Table 5. The route transportation volume of each logistics sub-path in each transportation routing strategy can be obtained using the same method.
[0135] (3) Determine the vehicle driving cost and node processing cost of each transportation routing strategy based on the transportation volume of each route corresponding to each transportation routing strategy.
[0136] The transportation volume of each route corresponding to a transportation routing strategy refers to the transportation volume of each logistics sub-path within that transportation routing strategy. Figure 3 Let's take an example to illustrate, for Figure 3 The target logistics network in the context includes the transportation volume of each route corresponding to each transportation routing strategy, including the transportation volume of each route in each transportation routing strategy: A->B, A->C, B->A, B->C, C->B, and C->A.
[0137] In some embodiments, the vehicle travel cost and node processing cost of each transportation routing strategy can be obtained based on the transportation volume of each route corresponding to each transportation routing strategy using the following method:
[0138] (i) Based on the transportation volume of each route corresponding to each transportation routing strategy, calculate the cargo processing volume of each node in each transportation routing strategy.
[0139] Cargo processing volume refers to the number of target goods processed by the corresponding node. In some embodiments, the shipment volume of each node can be used as the cargo processing volume of the corresponding node. For ease of understanding, the cargo processing volume of each node will be assumed to be the shipment volume of the corresponding node in the following text.
[0140] Since route transport volume refers to the transport volume of target goods on a logistics sub-path, the cargo handling volume of the originating node on the corresponding logistics sub-path can be determined based on the route transport volume. This method allows for the statistical calculation of cargo handling volume for all nodes in the target logistics network. The transport routing strategy in Table 4 is used as an example for illustration: For Figure 3For node A, the cargo handling volume of node A can be obtained by adding the transportation volumes of all logistics sub-paths originating from node A, namely A->B and A->C. Similarly, for node B, the cargo handling volume of node B can be obtained by adding the transportation volumes of B->A and B->C. For node C, the cargo handling volume of node C can be obtained by adding the transportation volumes of C->B and C->A.
[0141] (ii) Determine the node processing cost of each transportation routing strategy based on the preset unit cargo processing cost of each node and the cargo processing volume of each node in each transportation routing strategy.
[0142] The unit cargo processing cost of each node refers to the cost incurred by the corresponding node when processing a unit of cargo. The unit cargo can be determined based on the actual scenario. For example, in this embodiment, 1 kg of target cargo can be considered as the unit cargo. Therefore, the unit cargo processing cost of each node refers to the cost incurred by the corresponding node when processing 1 kg of target cargo. The unit cargo processing costs of each node can be the same or different, depending on the actual situation of each node, and will not be elaborated further.
[0143] Based on the cargo processing volume and unit cargo processing cost of each node in each transportation routing strategy, the actual cost incurred by each node in processing cargo in the corresponding transportation routing strategy can be obtained. The node processing cost of the corresponding transportation routing strategy can be obtained by adding up the actual costs in each transportation routing strategy.
[0144] (iii) Determine the number of vehicles to depart from each logistics sub-path in each transportation routing strategy based on the preset cargo capacity of the transport vehicles and the transportation volume of each route corresponding to each transportation routing strategy.
[0145] The preset cargo capacity may refer to the maximum cargo capacity of a transport vehicle. In this embodiment of the application, for ease of understanding, it is assumed that the target logistics network uses the same transport vehicles for transportation, but this should not be taken as a limitation on the embodiment of the application.
[0146] Since the process of loading a transport vehicle to its maximum capacity before loading the next one is implemented, the number of departures for each logistics sub-path within each transportation routing strategy can be determined based on the ratio between the transport volume and the preset load capacity for each route. For example, if the transport volume for logistics sub-path C->B in Table 4 is 500kg and the preset load capacity is 100kg, then the number of departures for logistics sub-path C->B in the transportation routing strategy of Table 4 is 5.
[0147] (iv) Determine the vehicle travel cost of each of the transportation routing strategies based on the sub-path distance of each of the logistics sub-paths and the number of departures corresponding to each of the transportation routing strategies.
[0148] For example, the vehicle travel cost of a transportation routing strategy can be calculated based on the unit distance travel cost of each transport vehicle, the sub-path distance of each logistics sub-path, and the number of departures corresponding to each transportation routing strategy. The unit distance travel cost can refer to the travel cost per kilometer, or the travel cost per 100 kilometers, etc. This application embodiment does not limit this; for ease of understanding, the unit distance travel cost will be considered as the travel cost per kilometer in the following text.
[0149] Continuing with the example in step (iii), if the distance of the logistics sub-path C->B is 100 kilometers and the unit distance travel cost of each transport vehicle is 50 yuan, then the vehicle travel cost in the transportation routing strategy in Table 4 is 250,000 yuan.
[0150] 204. Based on the corresponding transportation cost and node processing cost, determine the network-wide delivery cost of each transportation routing strategy.
[0151] The total delivery cost refers to the total cost required by a transportation routing strategy to deliver each target item. For example, the total delivery cost of each transportation routing strategy can be the sum of the corresponding transportation cost and the node processing cost.
[0152] 205. Output the target transportation routing strategy corresponding to the minimum overall network delivery cost.
[0153] After obtaining the total network delivery cost of each transportation routing strategy, the total network delivery costs can be compared to obtain the target transportation routing strategy with the lowest total network delivery cost.
[0154] In some embodiments, the target transportation routing policy can be displayed on the target terminal. The target terminal can be a smartphone, a node management platform for each node, etc., and this application embodiment does not limit this.
[0155] In summary, the transportation route planning method provided in this application includes: obtaining target goods to be transported in a target logistics network; determining a transportation route strategy based on the quantity of each target goods, the originating node, and the destination node, wherein the transportation route strategy includes the route transportation volume of each target goods allocated to each preset path in the target logistics network; obtaining the transportation cost and node processing cost of each transportation route strategy; determining the overall delivery cost of each transportation route strategy based on the corresponding transportation cost and node processing cost; and outputting the target transportation route strategy corresponding to the minimum overall delivery cost.
[0156] On the one hand, this method comprehensively considers both transportation costs and node processing costs when calculating the overall network delivery cost. Compared to traditional planning methods, it considers more types of costs, thereby improving the accuracy of the overall network delivery cost. Therefore, planning the transportation route of target goods by obtaining the target transportation routing strategy can directly reduce costs. On the other hand, since the transportation route planning is based on each target good in the target logistics network, the optimal transportation routing strategy can be planned for all target goods at the same time, achieving global optimization that is impossible to achieve manually, and also improving the speed of target goods transportation route planning.
[0157] In some embodiments, the costs incurred when the target goods are delivered late can also be included in the calculation of the overall network delivery cost to further improve the accuracy of the overall network delivery cost calculation. (Reference) Figure 4 At this point, after step "determine the vehicle driving cost and node processing cost of each transportation routing strategy based on the transportation volume of each route corresponding to each transportation routing strategy", the method further includes:
[0158] 401. Obtain the preset timeout cost for each preset path.
[0159] In this embodiment, the preset timeout cost is the timeout cost incurred when transporting target goods along a corresponding preset route. The preset timeout cost can be determined based on preset route information, which may include the route distance, origin node, destination node, etc. It is understood that the preset timeout cost for each preset route can be different or the same.
[0160] In some embodiments, a preset timeout cost can be obtained based on the path distance, originating node, and destination node in the preset path information, for example:
[0161] (a) Determine the on-board transportation time for each preset route based on the preset route distance and the preset vehicle speed.
[0162] Onboard transportation time refers to the travel time of the transport vehicle on the corresponding preset route.
[0163] The preset speed of the transport vehicle can be the average speed of the transport vehicle obtained from experience, or it can be the maximum speed that the transport vehicle can reach. This application embodiment does not limit this.
[0164] The onboard transportation time for each preset route can be calculated based on the ratio between the route distance and the preset vehicle speed.
[0165] (b) Determine the preset overtime cost for each preset route based on the on-board transportation time, origin node and destination node of each preset route.
[0166] When determining the preset overtime cost, the preset routes can be grouped according to the origin node and destination node. Then, the preset overtime cost of each preset route in the group can be determined according to the different on-board transportation times corresponding to each preset route in the group.
[0167] For example, the preset paths can first be divided into multiple path groups based on their origin and destination nodes. For a path group, the relationship between the preset timeout costs corresponding to each preset path is related to the on-board transportation time of each preset path. For a preset path in the path group with a longer on-board transportation time, its corresponding preset timeout cost can be higher than that of a preset path in the path group with a shorter on-board transportation time. For example, in the path group, if the on-board transportation time of preset path 1 is longer than that of preset path 2, then the preset timeout cost corresponding to preset path 1 can be higher than that of preset path 2.
[0168] By performing the same processing on each group of paths, the preset timeout cost for each preset path can be obtained.
[0169] 402. Determine the transportation timeout cost of each transportation routing strategy based on the path transportation volume of each preset path and the corresponding preset timeout cost in each transportation routing strategy.
[0170] Transportation delay costs refer to the costs incurred when the target goods fail to arrive within the preset timeframe. For example, transportation delay costs may include costs arising from customer complaints, labor costs incurred due to delays, etc. For example, transportation delay costs can be calculated using formula (1):
[0171]
[0172] Where x is the transportation timeout cost, K is the set of all target goods, and P k G is the set of candidate transportation routes corresponding to target cargo k in each preset path. kβ is the quantity of target cargo k. p It refers to P k The percentage of the transport volume of the p-th candidate transport route relative to the total volume of the target cargo k, L p It refers to P k The preset timeout cost for the p-th candidate transportation route.
[0173] In summary, the total delivery cost across the entire network in this application embodiment can be obtained from formula (2):
[0174]
[0175] Where y is the total delivery cost across the network, N is the set of nodes in the target logistics network, and d ij This refers to the distance between node i and node j, i.e., the sub-path distance of the logistics sub-path i->j, where c is the unit distance travel cost for each transport vehicle, and Y is the distance between node i and node j. ij P is the number of departures between node i and node j, i.e., the number of departures along the logistics sub-path i->j. K is the set of all target goods. k It is the set of candidate transportation routes corresponding to target cargo k in each preset path, i p This refers to the nodes on the candidate transportation path p. It is node i p Unit cargo handling cost, G k β is the quantity of target cargo k. p It refers to P k The percentage of the transport volume of the p-th candidate transport route relative to the total volume of the target cargo k, L p It refers to P k The preset timeout cost of the p-th candidate transportation route. It can be seen that the overall delivery cost obtained by formula (2) also takes into account the time cost of the target goods, and is therefore more accurate, which has great practical significance in the express logistics industry where timeliness is crucial.
[0176] In some embodiments, the allocation of route transportation volume can be further constrained based on the preset transportation capacity information of the target logistics network, so that the resulting transportation routing strategies are more realistic and the computational load of this method can be reduced. (Reference) Figure 5 At this point, the step "determine the transportation routing strategy based on the quantity of each target cargo, the originating node of the transportation, and the destination node of the transportation" includes:
[0177] 501. Determine the initial routing strategy based on the cargo quantity, originating node, and destination node of each target cargo.
[0178] The initial routing strategy refers to all possible routing strategies obtained based on the quantity of each target cargo, the originating node, and the destination node, without considering constraints.
[0179] 502. Based on the route transportation volume of each preset path in each initial routing strategy and the preset transportation capacity information of the target logistics network, each initial routing strategy is filtered to obtain a transportation routing strategy.
[0180] The preset transportation capacity information refers to the capacity information of the target logistics network when transporting goods. For example, the preset transportation capacity information may include at least one of the following: the cargo handling capacity information of each node and the transportation timeliness achievement information of each preset route.
[0181] For example, cargo handling capacity information may include at least one of the number of loading bays and the maximum cargo capacity.
[0182] Loading bays refer to the positions where transport vehicles are parked when loading goods. Typically, one loading bay corresponds to one transport vehicle. Therefore, the number of loading bays in a node limits the number of transport vehicles that can be dispatched. In other words, the number of loading bays limits the maximum number of goods that can be shipped from the corresponding node.
[0183] The maximum cargo capacity refers to the maximum number of goods that a node can hold. The maximum cargo capacity can be determined based on node information such as the number of manpower and sorting equipment in the corresponding node, the size of the node's site area, etc. Similarly, the maximum cargo capacity limits the maximum number of goods that the corresponding node can ship.
[0184] The transit time achievement information for a preset route refers to whether the target goods will be delivered late when transported via that preset route. Taking Table 3 as an example, if target goods A_B will be delivered late when transported via preset route 2, then the transit time achievement information for target goods A_B via preset route 2 is "delivered late," which can be recorded as 1. If target goods A_B can be delivered on time when transported via preset route 7, then the transit time achievement information for target goods A_B via preset route 7 is "delivered on time," which can be recorded as 0.
[0185] The following two scenarios illustrate the screening method:
[0186] Case 1, using transportation timeliness achievement information as a constraint: based on the transportation timeliness achievement information corresponding to each preset path and the path transportation volume of each initial routing strategy, the timeliness achievement ratio of each initial routing strategy is calculated, and the initial routing strategy with the timeliness achievement ratio greater than or equal to the preset ratio threshold is set as the transportation routing strategy.
[0187] The on-time delivery rate refers to the ratio between the amount of goods delivered on time in the initial routing strategy and the total amount of goods for each target.
[0188] In scenario one, the timeliness achievement information of each preset path can be used as a constraint to ensure that the proportion of on-time delivery of target goods is greater than or equal to a preset threshold, thereby improving the timeliness achievement rate of the target transportation routing strategy. Continuing with Table 4 as an example, in Table 4, the transport volume of target goods A_B on preset path 2 is 7kg, and the transport volume on preset path 7 is 3kg. Therefore, for target goods A_B, if target goods A_B will be delivered late when transported via preset path 2, but can be delivered on time when transported via preset path 7, then the on-time delivery volume is 7kg. After obtaining the on-time delivery volume of target goods A_C - target goods C_B using the same method, the timeliness achievement rate of the initial routing strategy corresponding to Table 4 can be calculated. If the timely delivery quantities of target goods A_C and target goods C_B are 10kg, 15kg, 20kg, 25kg, and 30kg respectively, then the timeliness achievement rate of the initial routing strategy corresponding to Table 4 is: (7+10+15+20+25+30) / (10+20+30+40+50+60), which is 51%.
[0189] Scenario 2, using cargo handling capacity information as a constraint: Based on the transportation volume of each path corresponding to each of the transportation routing strategies, the cargo handling volume of each node in each of the transportation routing strategies is calculated. Based on the cargo handling capacity information of each node and the cargo handling volume corresponding to each of the initial routing strategies, each of the initial routing strategies is filtered to obtain the transportation routing strategy.
[0190] In Case 2, the transportation routing strategy refers to a routing strategy in which the cargo handling volume of each node is less than or equal to the corresponding cargo handling capacity value.
[0191] The following example illustrates this point. Figure 3 Taking the target logistics network as an example, if the maximum amount of goods that node B can ship is 100kg according to the cargo handling capacity information, then the route transportation volume of preset path 1, preset path 3, preset path 4, preset path 6, preset path 9 and preset path 10 and the routing strategy that exceeds 100kg can be removed from each initial routing strategy to obtain the transportation routing strategy.
[0192] In some embodiments, based on the target transportation routing strategy, the delivery time of each preset path in the target logistics network can be planned according to the shift information of each node in the target logistics network. The shift information can include the delivery time of each node. In this case, multiple delivery shift strategies can be obtained by randomly selecting from multiple preset delivery times for each node in each preset path using the same method as determining the transportation routing strategy. The target delivery shift strategy with the lowest total logistics cost can then be obtained. The total logistics cost can also include transportation costs and node processing costs.
[0193] The process of obtaining the delivery schedule strategy can be understood as follows: after determining the route transportation volume of each preset route, the delivery time of each node on each preset route is planned to obtain multiple time routes corresponding to each preset route, and the optimal time route of each preset route is obtained from the multiple time routes corresponding to each preset route. Here, a time route contains a planning situation of the delivery time of each node on each preset route.
[0194] The time when each node can ship goods can be determined according to the actual scenario. For example, it is possible to set all nodes in the target logistics network to ship goods at 8:00 and 18:00 every day.
[0195] Since there are countless possible dates corresponding to the shipping time, for example, for preset path 2 in Table 3, after node C receives the 7kg target goods A_B sent by A on December 29, 2021, it can send the 7kg target goods A_B to node B on December 30, 2021, or it can send the 7kg target goods A_B to node B on December 31, 2021, and so on. Therefore, in order to reduce the number of time paths corresponding to each preset path, we can obtain the candidate transportation paths corresponding to each target goods in the preset path, and then filter the initial time paths corresponding to each candidate transportation path according to the preset timeliness of the target goods corresponding to each candidate transportation path, so as to obtain multiple shipping time paths corresponding to each candidate transportation path. Among them, the initial time path refers to the time path obtained without considering the date corresponding to the shipping time, and the shipping time path refers to the time path obtained with considering the date corresponding to the shipping time.
[0196] Continuing with the example above, if the preset timeframe for target goods A_B is January 2, 2022, then based on this preset timeframe, the initial time paths can be filtered. For example, the preset timeframe can be extended to 3 days, and the initial time paths that cannot reach node B by January 5, 2022 can be removed to obtain multiple shipping time paths corresponding to preset path 2.
[0197] It should be noted that when calculating the transportation costs of each shipping strategy, the transportation timeout cost in the transportation cost can also include the cost incurred by the target goods staying at each node. Therefore, the obtained target shipping strategy comprehensively considers the vehicle transportation cost reduction caused by cargo consolidation and the transportation timeout cost caused by cargo consolidation, which is closer to actual production applications.
[0198] The following example illustrates this point. Figure 3 Taking the target logistics network as an example, the impact of preset routes 2 and 9 on cargo collection is explained. Assume the transportation time from node B to node A is 4 hours, from node A to node C is 10 hours, and from node C to node B is 2 hours. (Refer to...) Figure 6 , Figure 6 The image shows the shipping time paths corresponding to preset routes 2 and 9 in two shipping strategies, assuming... Figure 6 In the shipping strategy 1 and shipping strategy 2, all other information is the same. It is understandable that if the preset time limit for target goods A_B is "same-day arrival", then in shipping strategy 1, the transportation timeout cost is higher than that in shipping strategy 2 because the transportation of target goods A_B exceeds the time limit. In shipping strategy 1, since target goods A_B and target goods B_C are collected at node A and transported to node C, the number of vehicles dispatched on the logistics sub-path A->C is less than that in shipping strategy 2. Therefore, the vehicle operating cost of shipping strategy 1 is lower than that of shipping strategy 2.
[0199] This application's method of first obtaining the target transportation routing strategy and then obtaining the target delivery schedule strategy based on the target transportation routing strategy is more computationally efficient than traditional methods. Traditional methods typically obtain the delivery schedule strategy directly based on the cargo volume, originating node, destination node, and schedule information of each target cargo in the target logistics network. Then, the target delivery schedule strategy is determined based on the total logistics cost of each delivery schedule strategy. However, this method consumes excessive computational resources when the target logistics network has a large number of nodes and a large cargo volume, placing a significant burden on computing equipment. In contrast, the method in this application, after determining the route transportation volume on each preset path, only needs to plan the delivery time for each preset path, thus relatively reducing the computational requirements.
[0200] In summary, in one embodiment of this application, each node can be assumed to operate on a two-shift basis. This means that when a node processes the target goods, the difference in delivery time between nodes is not considered. Therefore, the minimum cost allocation strategy for the target goods on each preset path can be determined first. Then, based on the obtained allocation strategy, delivery times are planned to obtain a target delivery shift strategy that better reflects actual transportation conditions. Compared to methods that simultaneously plan delivery times and the allocation of target goods on each preset path, this embodiment significantly reduces planning time and computational requirements through a two-stage solution method. It is evident that the transportation route planning method provided in this embodiment can plan the target goods in a short time, even when the number of preset routes in the target logistics network is large and the types of delivery times (shift types) are numerous. Furthermore, the transportation route planning method provided in this embodiment eliminates the need to divide the cargo transportation business area into multiple sub-business areas to reduce planning time; instead, it allows for planning of the entire business area, saving human resources associated with manual division of business areas and avoiding the impact of improper sub-business area division on the planning results.
[0201] To better implement the transportation route planning method in the embodiments of this application, based on the transportation route planning method, the embodiments of this application also provide a transportation route planning device, such as... Figure 7 The diagram shown is a structural schematic of one embodiment of the transportation route planning device in this application. The transportation route planning device 600 includes:
[0202] The first acquisition module 601 is used to acquire the target goods to be transported in the target logistics network.
[0203] The first determining module 602 is used to determine a transportation routing strategy based on the cargo volume, transportation origin node and transportation destination node of each target cargo, wherein the transportation routing strategy includes the route transportation volume of each target cargo allocated to each preset path in the target logistics network;
[0204] The second acquisition module 603 is used to acquire the transportation cost and node processing cost of each of the transportation routing strategies.
[0205] The second determining module 604 is used to determine the network-wide delivery cost of each of the transportation routing strategies based on the corresponding transportation cost and the node processing cost.
[0206] Output module 605 is used to output the target transportation routing strategy corresponding to the minimum network-wide delivery cost.
[0207] In one possible implementation of this application, the transportation cost includes vehicle operating costs, and the second acquisition module 603 is further configured to:
[0208] Obtain the logistics sub-paths in each of the preset paths;
[0209] Based on the transportation volume of each path in each transportation routing strategy, the line transportation volume of each logistics sub-path in each transportation routing strategy is calculated.
[0210] Based on the transportation volume of each route corresponding to each transportation routing strategy, determine the vehicle driving cost and node processing cost of each transportation routing strategy.
[0211] In one possible implementation of this application, the second acquisition module 603 is further configured to:
[0212] Based on the transportation volume of each route corresponding to each transportation routing strategy, the cargo processing volume of each node in each transportation routing strategy is calculated.
[0213] The node processing cost of each transportation routing strategy is determined based on the preset unit cargo processing cost of each node and the cargo processing volume of each node in each transportation routing strategy.
[0214] Based on the preset cargo capacity of the transport vehicles and the transport volume of each route corresponding to each transport routing strategy, determine the number of vehicles to depart from each logistics sub-path in each transport routing strategy.
[0215] The vehicle travel cost of each transportation routing strategy is determined based on the sub-path distance of each logistics sub-path and the number of departures corresponding to each transportation routing strategy.
[0216] In one possible implementation of this application, the transportation cost also includes transportation timeout costs, and the second acquisition module 603 is further configured to:
[0217] Obtain the preset timeout cost for each of the preset paths;
[0218] The transportation timeout cost of each transportation routing strategy is determined based on the path transportation volume of each preset path in each transportation routing strategy and the corresponding preset timeout cost.
[0219] In one possible implementation of this application, the first determining module 602 is further configured to:
[0220] An initial routing strategy is determined based on the cargo volume, originating node, and destination node of each target cargo. The initial routing strategy includes the route transportation volume of each target cargo allocated to each preset path in the target logistics network.
[0221] Based on the route transportation volume of each preset path in each initial routing strategy and the preset transportation capacity information of the target logistics network, each initial routing strategy is filtered to obtain a transportation routing strategy. The preset transportation capacity information includes at least one of the cargo handling capacity information of each node and the transportation timeliness achievement information of each preset path.
[0222] In one possible implementation of this application, the first determining module 602 is further configured to:
[0223] Based on the transportation timeliness achievement information corresponding to each preset path and the path transportation volume of each initial routing strategy, the timeliness achievement ratio of each initial routing strategy is calculated, and the initial routing strategy with the timeliness achievement ratio greater than or equal to the preset ratio threshold is set as the transportation routing strategy.
[0224] and / or
[0225] Based on the transportation volume of each path corresponding to each transportation routing strategy, the cargo handling volume of each node in each transportation routing strategy is calculated. Based on the cargo handling capacity information of each node and the cargo handling volume corresponding to each initial routing strategy, each initial routing strategy is filtered to obtain a transportation routing strategy. The cargo handling volume of each transportation routing strategy is less than or equal to the cargo handling capacity value of the corresponding node. The cargo handling capacity value includes at least one of the number of loading bays and the maximum cargo capacity.
[0226] In one possible implementation of this application, the output module 605 is further configured to:
[0227] Based on the route transportation volume of each preset path in the target transportation routing strategy, and according to the shift information of each node in the target logistics network, the delivery time of each preset path is planned to obtain the target delivery shift strategy with the lowest total logistics cost.
[0228] Output the target delivery schedule strategy.
[0229] In practice, the above modules can be implemented as independent entities or combined in any way to be implemented as the same or several entities. For the specific implementation of the above modules, please refer to the previous method implementation examples, which will not be repeated here.
[0230] Since the transportation route planning device can execute the steps in the transportation route planning method in any embodiment, it can achieve the beneficial effects that the transportation route planning method in any embodiment of this application can achieve, as detailed in the preceding description, and will not be repeated here.
[0231] Furthermore, to better implement the transportation route planning method in the embodiments of this application, based on the transportation route 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 701. The processor 701 executes a computer program stored in a memory 702 to implement each step of the transportation route planning method in any embodiment; or, the processor 701 executes a computer program stored in a memory 702 to implement, for example... Figure 7 The functions of each module in the corresponding embodiment.
[0232] For example, a computer program can be divided into one or more modules / units, one or more of which are stored in memory 702 and executed by processor 701 to complete the embodiments of this application. One or more modules / units can 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.
[0233] The electronic device may include, but is not limited to, processor 701 and memory 702. 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 use different components.
[0234] The processor 701 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.
[0235] The memory 702 can be used to store computer programs and / or modules. The processor 701 implements various functions of the computer device by running or executing the computer programs and / or modules stored in the memory 702 and by calling data stored in the memory 702. The memory 702 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.
[0236] Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working process of the transportation route planning device, electronic equipment and its corresponding modules described above can be referred to the description of the transportation route planning method in any embodiment, and will not be repeated here.
[0237] Those skilled in the art will understand that all or part of the steps in the various methods of the above embodiments can be implemented by instructions, or by instructions controlling related hardware. These instructions can be stored in a readable storage medium and loaded and executed by a processor.
[0238] Therefore, embodiments of this application provide a readable storage medium storing a computer program. When the computer program is executed by a processor, it performs the steps in the transportation route planning method in any embodiment of this application. For specific operations, please refer to the description of the transportation route planning method in any embodiment, which will not be repeated here.
[0239] The readable storage medium may include: read-only memory (ROM), random access memory (RAM), magnetic disk or optical disk, etc.
[0240] Since the instructions stored in the readable storage medium can execute the steps in the transportation route planning method in any embodiment of this application, the beneficial effects that the transportation route planning method in any embodiment of this application can achieve can be realized, as detailed in the preceding description, and will not be repeated here.
[0241] The above provides a detailed description of a transportation route planning method, apparatus, storage medium, and electronic device 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 transportation route planning method, characterized in that, include: Obtain the target goods to be transported within the target logistics network; Based on the cargo volume, transportation origin node, and transportation destination node of each target cargo, a transportation routing strategy is determined, wherein the transportation routing strategy includes the route transportation volume of each target cargo allocated to each preset path in the target logistics network; Obtain the transportation cost and node processing cost of each of the aforementioned transportation routing strategies; Based on the corresponding transportation cost and node processing cost, determine the network-wide delivery cost of each transportation routing strategy; Output the target transportation routing strategy corresponding to the minimum overall network delivery cost; Based on the route transportation volume of each preset path in the target transportation routing strategy, and according to the shift information of each node in the target logistics network, the delivery time of each preset path is planned to obtain the target delivery shift strategy with the lowest total logistics cost. Output the target delivery schedule strategy.
2. The transportation route planning method according to claim 1, characterized in that, The transportation costs include vehicle operating costs; The process of obtaining the transportation cost and node processing cost of each of the transportation routing strategies includes: Obtain the logistics sub-paths in each of the preset paths; Based on the transportation volume of each path in each transportation routing strategy, the line transportation volume of each logistics sub-path in each transportation routing strategy is calculated. Based on the transportation volume of each route corresponding to each transportation routing strategy, determine the vehicle driving cost and node processing cost of each transportation routing strategy.
3. The transportation route planning method according to claim 2, characterized in that, The step of determining the vehicle travel cost and node processing cost for each transportation routing strategy based on the transportation volume of each route corresponding to each transportation routing strategy includes: Based on the transportation volume of each route corresponding to each transportation routing strategy, the cargo processing volume of each node in each transportation routing strategy is calculated. The node processing cost of each transportation routing strategy is determined based on the preset unit cargo processing cost of each node and the cargo processing volume of each node in each transportation routing strategy. Based on the preset cargo capacity of the transport vehicles and the transport volume of each route corresponding to each transport routing strategy, determine the number of vehicles to depart from each logistics sub-path in each transport routing strategy. The vehicle travel cost of each transportation routing strategy is determined based on the sub-path distance of each logistics sub-path and the number of departures corresponding to each transportation routing strategy.
4. The transportation route planning method according to claim 2, characterized in that, The transportation costs also include transportation timeout costs; After determining the vehicle travel cost and node processing cost of each transportation routing strategy based on the transportation volume of each route corresponding to each transportation routing strategy, the method further includes: Obtain the preset timeout cost for each of the preset paths; The transportation timeout cost of each transportation routing strategy is determined based on the path transportation volume of each preset path in each transportation routing strategy and the corresponding preset timeout cost.
5. The transportation route planning method according to claim 1, characterized in that, The step of determining the transportation routing strategy based on the quantity of each target cargo, the originating node, and the destination node includes: An initial routing strategy is determined based on the cargo volume, originating node, and destination node of each target cargo. The initial routing strategy includes the route transportation volume of each target cargo allocated to each preset path in the target logistics network. Based on the route transportation volume of each preset path in each initial routing strategy and the preset transportation capacity information of the target logistics network, each initial routing strategy is filtered to obtain a transportation routing strategy. The preset transportation capacity information includes at least one of the cargo handling capacity information of each node and the transportation timeliness achievement information of each preset path.
6. The transportation route planning method according to claim 5, characterized in that, The preset transportation capacity information includes at least one of the following: cargo handling capacity information of each node, and transportation timeliness achievement information of each preset route. The step of filtering each initial routing strategy based on the route transportation volume of each preset path in each initial routing strategy and the preset transportation capacity information of the target logistics network to obtain a transportation routing strategy includes: Based on the transportation timeliness achievement information corresponding to each preset path and the path transportation volume of each initial routing strategy, the timeliness achievement ratio of each initial routing strategy is calculated, and the initial routing strategy with the timeliness achievement ratio greater than or equal to the preset ratio threshold is set as the transportation routing strategy. and / or Based on the transportation volume of each path corresponding to each transportation routing strategy, the cargo handling volume of each node in each transportation routing strategy is calculated. Based on the cargo handling capacity information of each node and the cargo handling volume corresponding to each initial routing strategy, each initial routing strategy is filtered to obtain a transportation routing strategy. The cargo handling volume of each transportation routing strategy is less than or equal to the cargo handling capacity value of the corresponding node. The cargo handling capacity value includes at least one of the number of loading bays and the maximum cargo capacity.
7. A transportation route planning device, characterized in that, include: The first acquisition module is used to acquire the target goods to be transported in the target logistics network. The first determining module is used to determine a transportation routing strategy based on the cargo volume, transportation origin node and transportation destination node of each target cargo, wherein the transportation routing strategy includes the route transportation volume of each target cargo allocated to each preset path in the target logistics network; The second acquisition module is used to acquire the transportation cost and node processing cost of each of the transportation routing strategies. The second determining module is used to determine the network-wide delivery cost of each of the transportation routing strategies based on the corresponding transportation cost and the node processing cost. The output module is used to output the target transportation routing strategy corresponding to the minimum network-wide delivery cost; Based on the route transportation volume of each preset path in the target transportation routing strategy, and according to the shift information of each node in the target logistics network, the delivery time of each preset path is planned to obtain the target delivery shift strategy with the lowest total logistics cost. Output the target delivery schedule strategy.
8. An electronic device, characterized in that, The electronic device includes a processor, a memory, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the steps of the transportation route planning method as described in any one of claims 1 to 6.
9. A readable storage medium, characterized in that, The readable storage medium stores a computer program that, when executed by a processor, implements the steps of the transportation route planning method according to any one of claims 1 to 6.
Citation Information
Patent Citations
Transportation route planning method, device and equipment apparatus and storage medium
CN111340431A
