A method, apparatus, and system for transportation route planning based on a network flow model.
By using mathematical abstraction based on network flow models and minimum cost network flow models, the high cost problem of manually constructing schemes in transportation route planning is solved, thereby reducing transportation costs and improving efficiency, and ensuring the global optimality and applicability of transportation schemes.
Patent Information
- Application Number
- CN202210833208.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-07-14
- Publication Date
- 2026-11-10
- Estimated Expiration
- 2042-07-14
AI Technical Summary
In existing technologies, transportation route planning relies on manually constructed schemes, resulting in high labor and time costs. Furthermore, it lacks efficient mathematical modeling methods, making it difficult to apply in real-world scenarios. Traditional models struggle to handle complex transportation network constraints and road conditions.
A network flow model-based approach is adopted, which transforms the objective function and constraints into mathematical expressions through mathematical abstraction, establishes a minimum cost network flow model, calculates the optimal solution to plan transportation routes, utilizes virtual source and sink points to ensure flow conservation, and constructs an accurate optimization model considering transportation volume constraints and unit transportation costs.
This approach reduces transportation costs and improves problem-solving efficiency, ensures the global optimality and applicability of the planning scheme, and enhances the efficiency and cost optimization of transportation scheme design.
Smart Images

Figure CN116644872B_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of transportation route planning technology, and in particular to a transportation route planning method, apparatus and system based on a network flow model. Background Technology
[0002] Transportation route planning is the process of designing transportation route schemes based on the supply and demand relationship between supply and demand points to achieve resource allocation at the optimal cost. Transportation route planning is a critical task in many scenarios, such as open-pit mine spoil transportation and urban waste transfer and cleanup. In transportation route planning, the generated transportation route schemes must meet the basic requirements and constraints of supply points, demand points, and transportation routes. While ensuring overall supply and demand balance, the transportation route schemes must also guarantee that the outflow of resources from supply points equals the supply quantity, and that all resources are transported to the demand points for that resource. Simultaneously, the total inflow of resources to demand points equals the demand quantity.
[0003] To reduce transportation costs, it is necessary to plan the transportation volume of each feasible transportation road based on the unit transportation cost calculated from road data, and design the transportation route scheme with the lowest transportation cost that meets transportation requirements. In actual production scenarios, feasible transportation routes are generated based on complex transportation networks. The spatial conditions of roads and bottlenecks in the transportation route will impose constraints on transportation, which makes it difficult to establish traditional transportation problem models and greatly increases the difficulty of solving the algorithm.
[0004] Currently, actual production scenarios still rely on manually constructing transportation routes. This method requires personnel to possess extensive industry knowledge and practical experience, resulting in high labor and time costs. However, current academic research lacks methods for directly and efficiently modeling and solving this problem, and the complex modeling process further limits the application of mathematical models from academic research in real-world scenarios. Summary of the Invention
[0005] To address the shortcomings of existing technologies, this invention provides a transportation route planning method, apparatus, and system based on a network flow model. By mathematically abstracting the scenario objects, the objective function and constraints are transformed into mathematical expressions suitable for model building, establishing an optimized model for accurate solution. This achieves accurate solution to the problem, significantly reducing transportation costs and improving the efficiency and applicability of problem solving.
[0006] To address the aforementioned technical problems, this invention provides the following technical solution: a transportation route planning method based on a network flow model, comprising the following processes:
[0007] Establish a transportation network based on transportation scenario object data and transportation routes;
[0008] Calculate the unit transportation cost of edges in the transportation network based on the horizontal distance and elevation difference of the transportation routes;
[0009] Calculate the upper limit of the capacity of edges in the transportation network graph based on the transportation volume limits of the transportation routes;
[0010] A minimum cost network flow model is established based on the transportation network graph, the unit transportation cost of the edges, and the upper limit of the edge capacity.
[0011] Calculate the optimal solution for the minimum cost network flow model;
[0012] The optimal transportation scheme between scene objects is derived based on the minimum cost network flow model.
[0013] Furthermore, the transportation network includes a set of nodes, a set of edges, and a cost function and a capacity limit on the edge set, wherein the transportation network is denoted as G, and the cost function and capacity limit on the node set, edge set, and edge set are denoted as V(G), E(G), c, and u, respectively;
[0014] The transportation routes refer to several transportation routes existing between the mining site, spoil heap, entrance / exit, and roads.
[0015] Furthermore, the node set V(G) consists of the coordinates of the nodes formed by the mining site, spoil heap, entrance / exit, and roads;
[0016] The edge set E(G) consists of all line segments with nodes in the node set V(G) as endpoints that contain transportation routes. The edge set E(G) consists of all edges in the transportation network, and the edges are transportation routes formed between mining sites, spoil heaps, entrances and exits and roads.
[0017] The cost function c on the edge set E(G) is given by the horizontal distance and elevation change of the transportation route. The unit mass (volume) transportation cost of each edge in the transportation network is calculated based on the horizontal distance and elevation difference of the transportation route.
[0018] The upper limit u of the capacity on the edge set E(G) is given by the transportation volume limit of the transportation line. The upper limit of the capacity of each edge in the graph structure is calculated based on the length of the construction period, the number of vehicles that can pass through the transportation line per unit time, and the transportation volume of the vehicles.
[0019] Furthermore, the transportation network introduces virtual source and sink points to ensure flow conservation at nodes.
[0020] Furthermore, the number of objects in the transportation scenario includes block data of the mining site, block data of the spoil heap, data of the entrance and exit of the mining site, data of the entrance and exit of the spoil heap, and data of the transportation route between the entrances and exits;
[0021] The block data of the mining site includes the centroid coordinates of each block and the volume of each block;
[0022] The block data of the spoil heap includes the centroid coordinates and maximum capacity of each block;
[0023] The data for the entrance and exit of the mining area includes the coordinates of the entrance and exit and the corresponding data with the mining area blocks;
[0024] The data for the entrance and exit of the spoil heap includes the coordinates of the entrance and exit and the corresponding data of the spoil heap blocks;
[0025] The data for the transportation routes between the entrances and exits consists of the transportation roads connecting the entrances and exits, including the coordinate data of the intermediate nodes of the transportation roads and the horizontal distance and elevation changes of each road.
[0026] Furthermore, the upper limit of the capacity of the edge is the transportation engineering volume limit of the corresponding transportation line in the transportation network.
[0027] Furthermore, the upper limit of the edge capacity also includes the upper limit of the transport line node capacity.
[0028] The present invention also provides an apparatus for use in the above-described transportation route planning method, comprising:
[0029] A transportation network establishment module, which is used to establish a transportation network based on transportation scenario object data and transportation routes;
[0030] A unit transportation cost calculation module is used to calculate the unit transportation cost of an edge in the transportation network based on the horizontal distance and elevation difference of the transportation route.
[0031] A capacity limit calculation module is used to calculate the capacity limit of edges in the transportation network graph based on the transportation volume limit of the transportation route.
[0032] A minimum cost network flow model building module is used to build a minimum cost network flow model based on the transportation network graph, the unit transportation cost of the edge, and the upper limit of the edge capacity.
[0033] An optimal solution calculation module is used to calculate the optimal solution of the minimum cost network flow model.
[0034] The optimal transportation scheme determination module is used to determine the optimal transportation scheme between scene objects based on the minimum cost network flow model.
[0035] The present invention also provides a system for applying the above-mentioned transportation route planning method, comprising:
[0036] processor;
[0037] Memory;
[0038] And one or more programs, wherein the one or more programs are stored in memory and configured to be executed by the processor, the programs being used by the computer to perform the method as described in any one of claims 1-6.
[0039] By employing the above technical solutions, the present invention provides a transportation route planning method, apparatus, and system based on a network flow model, which has at least the following beneficial effects:
[0040] 1. This invention, through mathematical abstraction of scene objects, transforms the objective function and constraints into mathematical expressions suitable for model building, establishes an optimization model for accurate solution, achieves accurate solution of the problem, significantly reduces the transportation cost of the solution obtained by the model, and improves the solution efficiency and applicability.
[0041] 2. This invention abstracts the objective object of the original problem into a mathematical object, transforming the problem into one that can be precisely solved by a minimum-cost network flow model. The solution obtained through the minimum-cost network flow model is globally optimal. Compared to the traditional method of manually constructing schemes for planning transportation routes, the model-based method for planning transportation routes can greatly improve the efficiency of designing transportation schemes while ensuring the optimality of the scheme in terms of transportation costs.
[0042] 3. This invention utilizes transportation networks to perform scientific and reasonable mathematical abstraction of real-world application scenarios, abstracting the transportation process of resources along transportation routes into the flow process of the transportation network, establishing a network flow model, designing algorithms to solve the abstracted optimization problem, and constructing an accurate and cost-optimal transportation route planning scheme. Attached Figure Description
[0043] The accompanying drawings, which are included to provide a further understanding of this application and form part of this application, illustrate exemplary embodiments and are used to explain this application, but do not constitute an undue limitation of this application. In the drawings:
[0044] Figure 1 This is a flowchart of the transportation route planning method of the present invention;
[0045] Figure 2 A schematic diagram illustrating the principle of the method for establishing a transportation network according to the present invention;
[0046] Figure 3 This is a schematic diagram illustrating the principle of node constraint processing in this invention;
[0047] Figure 4 This is a visualization of a transportation route plan based on a real-world example of the present invention.
[0048] Figure 5 This is a schematic diagram of the transportation route planning device of the present invention.
[0049] In the diagram: 100, Transportation network establishment module; 200, Unit transportation cost calculation module for edges; 300, Capacity limit calculation module; 400, Minimum cost network flow model establishment module; 500, Optimal solution calculation module; 600, Optimal transportation scheme derivation module. Detailed Implementation
[0050] To make the above-mentioned objects, features, and advantages of the present invention more apparent and understandable, the present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments. This will allow for a full understanding of how the present application uses technical means to solve technical problems and achieve technical effects, and to facilitate its implementation.
[0051] Those skilled in the art will understand that all or part of the steps in the methods of the above embodiments can be implemented by a program instructing related hardware. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Moreover, this application can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.
[0052] Please refer to Figures 1-5 This illustrates one embodiment of the present invention, a transportation route planning method based on a network flow model, comprising the following processes:
[0053] S11. Establish a transportation network based on transportation scenario object data and transportation routes.
[0054] Virtual source and sink nodes are introduced into the transportation network to ensure the conservation of flow at nodes.
[0055] The number of objects in the transportation scenario includes block data of the mining site, block data of the spoil heap, data of the entrance and exit of the mining site, data of the entrance and exit of the spoil heap, and data of the transportation routes between the entrances and exits.
[0056] The block data for the mining site includes the centroid coordinates and volume of each block; the block data for the spoil heap includes the centroid coordinates and maximum capacity of each block; the data for the mining site entrances and exits includes the coordinates of the entrances and exits and their correspondence with the mining site blocks; the data for the spoil heap entrances and exits includes the coordinates of the entrances and exits and their correspondence with the spoil heap blocks; the data for the transportation routes between the entrances and exits consists of the transportation roads connecting the entrances and exits, including the coordinates of the intermediate nodes of the transportation roads and the horizontal distance and elevation changes of each road.
[0057] The transportation network includes a set of nodes, a set of edges, and a cost function and a capacity limit on the edge set. The transportation network is denoted as G, and the cost function and capacity limit on the set of nodes, edges, and edge set are denoted as V(G), E(G), c, and u, respectively. The transportation lines are several transportation lines existing between the mining area, spoil heap, entrance / exit, and road.
[0058] The node set V(G) consists of the coordinates of the nodes formed by the mining area, spoil heap, entrance / exit, and roads; the edge set E(G) consists of all line segments with nodes in the node set V(G) as endpoints that contain transportation routes. The edge set E(G) consists of all edges in the transportation network, which are the transportation routes formed between the mining area, spoil heap, entrance / exit, and roads; the cost function c on the edge set E(G) is calculated based on the horizontal distance and elevation change of the transportation routes. The unit mass (volume) transportation cost of each edge in the transportation network is calculated based on the horizontal distance and elevation difference of the transportation routes; the capacity limit u on the edge set E(G) is given by the transportation volume limit of the transportation routes. The capacity limit of each edge in the graph structure is calculated based on the construction period length, the number of vehicles that can pass through the transportation routes per unit time, and the transportation volume of the vehicles.
[0059] For example, Figure 2 This document provides an example of a method for establishing a transportation network. In actual transportation, soil blocks within a mining area are transported from the mining area, through the mining area entrance and exit, and the spoil heap entrance and exit, to a designated spoil heap. The source and sink nodes at both ends are virtual nodes added during the modeling process. The final transportation cost is the sum of the product of the transportation workload of each edge and the transportation unit price of that edge over the edge.
[0060] S12. Calculate the unit transportation cost of edges in the transportation network based on the horizontal distance and elevation difference of the transportation routes.
[0061] In a transportation network, the cost of an edge is a linear function of the horizontal distance L and the elevation difference H. Assume the transportation cost per unit horizontal distance is c. l The transportation cost per unit altitude change is c. h For a transportation route P from the quarry to the spoil heap, there is also a unit volume startup cost of c0, where the unit prices mentioned above are the transportation prices per unit of soil block. Converting the factors affecting transportation costs into a quantifiable form and solving the formula, the unit transportation price of edge e calculated from the transportation route is:
[0062] c e =c l *L e +c h *H e
[0063] The unit transportation price for the entire transportation route is:
[0064]
[0065] S13. Calculate the upper limit of the capacity of the edges in the transportation network graph based on the transportation volume limit of the transportation route.
[0066] The capacity limit of a transportation route is determined by the parameters of the road itself. Each transportation route has limitations on the amount of transportation engineering work required during its design and use.
[0067] By decomposing a node with capacity constraints in the transportation network into two virtual nodes and establishing a virtual edge between these two nodes, the upper limit of the edge capacity is used to characterize the upper limit of the node capacity, thus expressing the node constraints in the model.
[0068] The upper limit of edge capacity is the transportation engineering quantity limit of the corresponding transportation line in the transportation network. The capacity of the transportation line is determined by the parameters of its road itself. Each transportation line has a transportation engineering quantity limit when it is designed and used.
[0069] For example, suppose a transportation route determines the number of transportation devices that can pass through the route per unit time as n0, the expected transportation period is T0, and the unit carrying capacity of the transportation devices is v0. Then, within the construction period, the upper limit of the capacity of the edges in the network graph corresponding to the transportation route is:
[0070] u e =n0*T0*v0
[0071] The edge capacity limit also includes the capacity limit of transportation route nodes. In this embodiment, the transportation network graph contains a special type of edge capacity: the capacity limit of transportation route nodes. In real-world applications, nodes such as intersections of transportation routes also have capacity limitations, i.e., the number of transportation devices that can pass through per unit time. To incorporate node capacity constraints into the model, during modeling, nodes with capacity constraints in the transportation network graph are decomposed into two virtual nodes, and a virtual edge is established between these two nodes, such as... Figure 3 As shown, the edge capacity of virtual edges is used to characterize the capacity constraint of nodes.
[0072] S14. Based on the transportation network graph, the unit transportation cost of the edges, and the upper limit of the edge capacity, establish a minimum cost network flow model.
[0073] After establishing the transportation network graph and calculating the unit transportation cost and capacity limit of the edges, a minimum cost network flow model can be established to solve the problem. Based on the transportation network graph and the unit transportation cost and capacity limit of the edges, the original problem is transformed into a minimum cost network flow problem.
[0074] Based on the graph structure of the abstract transportation network, the unit transportation cost of the edges, and the capacity limit, the transportation route planning problem is transformed into a minimum cost network flow problem. A minimum cost network flow model is established and solved, and a transportation scheme for resources between nodes is given.
[0075] S15. Calculate the optimal solution for the minimum cost network flow model.
[0076] Based on the transportation network graph and the cost and capacity limits of the edges, the original problem is transformed into a minimum cost network flow problem, and the optimal solution is calculated using a mature solution algorithm.
[0077] Assuming a node set V, with source node denoted as s and sink node denoted as t, and the set of nodes of the mining block as {a} i |i=1,2,…,m}, the set of nodes for the spoil heap block is {b j |j=1,2,…,n}, the out-degree set d of node i + (i) = {j∈V|(i,j)∈E}, where d is the in-degree set of node i. - (i) = {j∈V|(j,i)∈E}, and the set of transport volumes for each edge is {x e |e∈E}.
[0078] In the model, except for the source and sink nodes, all nodes satisfy the flow conservation condition, that is, for node i, the amount of traffic flowing into that node is constant. The amount of transportation flowing out of this node Equal. The upper limit of the capacity of the directed edge originating from the source node is set to the mining volume of its corresponding mining block, i.e.:
[0079]
[0080] The capacity of directed edges ending at the sink is the upper limit of the spoil heap block corresponding to the directed edge, that is:
[0081]
[0082] In this embodiment, the optimization mathematical model with the objective of minimizing transportation costs is as follows:
[0083]
[0084]
[0085]
[0086] 0≤x e ≤u e ,
[0087]
[0088]
[0089] The objective function of this problem is about the decision variable x. e For linear equations, the minimum cost flow algorithm can be used to find the optimal value.
[0090] Table 1 presents the results of the model in a real-world case and compares them with the optimal solution currently used by the company.
[0091]
[0092]
[0093] Table 1. Comparison of Quantitative Results from Real-World Cases
[0094] S16. Based on the minimum cost network flow model, derive the optimal transportation scheme between scene objects.
[0095] The transportation route planning method uses transportation networks to scientifically and rationally abstract real-world application scenarios, abstracting the transportation process of resources on transportation routes into the flow process of the transportation network, establishing a network flow model, designing algorithms to solve the abstracted optimization problem, and constructing an accurate and cost-optimal transportation route planning scheme.
[0096] The model's results calculate the optimal transport volume for each transport route. The transport plans can be further subdivided based on different production needs. For example... Figure 4 As shown, by using an advanced construction algorithm, the optimal solution for the transportation volume of all edges is transformed into the optimal solution for the transportation volume of the transportation path from the mining area block to the spoil heap block, and this is presented visually. Figure 4 In the demonstration case, the same color was used to mark the corresponding excavation site blocks and spoil heap blocks.
[0097] This embodiment abstracts each objective object mathematically based on the interrelationships between them in a real-world application scenario. Objective objects such as supply points, demand points, and road intersections, which can be considered as points, are abstracted as nodes in a transportation network. The transportation routes connecting these objective objects are abstracted as edges in the transportation network, thus constructing an abstract mathematical structure corresponding to the real-world application scenario.
[0098] This embodiment abstracts the objective object of the original problem into a mathematical object, transforming the problem into one that can be precisely solved by a minimum-cost network flow model. The solution obtained through the minimum-cost network flow model is globally optimal. Compared to the traditional method of manually constructing schemes for planning transportation routes, the model-based method can greatly improve the efficiency of designing transportation schemes while ensuring the optimality of the scheme in terms of transportation costs.
[0099] This embodiment also provides an apparatus for use in the above-described transportation route planning method, comprising:
[0100] The transportation network establishment module 100 is used to establish a transportation network based on transportation scenario object data and transportation routes.
[0101] Unit transportation cost calculation module 200 is used to calculate the unit transportation cost of the edge in the transportation network based on the horizontal distance and elevation difference of the transportation route.
[0102] The capacity limit calculation module 300 is used to calculate the capacity limit of the edges in the transportation network graph based on the transportation volume limit of the transportation route.
[0103] Minimum Cost Network Flow Model Building Module 400: This module is used to build a minimum cost network flow model based on the transportation network graph, the unit transportation cost of the edges, and the upper limit of the edge capacity.
[0104] The optimal solution calculation module 500 is used to calculate the optimal solution of the minimum cost network flow model.
[0105] The optimal transportation scheme determination module 600 is used to determine the optimal transportation scheme between scene objects based on the minimum cost network flow model.
[0106] This embodiment also provides a system applied to the above-described transportation route planning method, including:
[0107] processor;
[0108] Memory;
[0109] And one or more programs, wherein the programs are stored in memory and configured to be executed by a processor, the programs being used by the computer to perform the above-described transportation route planning method.
[0110] This embodiment also provides a readable storage medium on which a computer program is stored, which, when executed by a processor, implements a transportation route planning method.
[0111] This embodiment transforms the objective function and constraints into mathematical expressions suitable for model building by mathematically abstracting the scene objects, thus establishing an optimized model for accurate solution. This achieves an accurate solution to the problem, significantly reduces the transportation cost of the solution obtained from the model, and improves the efficiency and applicability of the solution.
[0112] This invention abstracts the objective object of the original problem into a mathematical object, transforming the problem into one that can be precisely solved by a minimum-cost network flow model. The solution obtained through the minimum-cost network flow model is globally optimal. Compared to the traditional method of manually constructing schemes for planning transportation routes, the model-based method greatly improves the efficiency of designing transportation schemes while ensuring the optimality of the scheme in terms of transportation costs.
[0113] The various embodiments in this specification are described in a progressive manner, with each embodiment focusing on its differences from other embodiments. Similar or identical parts between embodiments can be referred to interchangeably. Since the above embodiments are substantially similar to the method embodiments, their descriptions are relatively simple; relevant parts can be referred to the descriptions of the method embodiments.
[0114] The above embodiments provide a detailed description of the present invention. Specific examples have been used to illustrate the principles and implementation methods of the present invention. The descriptions of the above embodiments are only for the purpose of helping to understand the method and core ideas of the present invention. 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 the present invention. Therefore, the content of this specification should not be construed as a limitation of the present invention.
Claims
1. A transportation route planning method based on a network flow model, characterized in that, Includes the following processes: Establish a transportation network based on transportation scenario object data and transportation routes; Calculate the unit transportation cost of edges in the transportation network based on the horizontal distance and elevation difference of the transportation routes; Calculate the upper limit of the capacity of edges in the transportation network graph based on the transportation volume limits of the transportation routes; The upper limit of edge capacity also includes the upper limit of transportation line node capacity: by decomposing the node with capacity constraints in the transportation network into two virtual nodes and establishing a virtual edge between the two nodes, the edge capacity of the virtual edge is used to characterize the node capacity limit. A minimum cost network flow model is established based on the transportation network graph, the unit transportation cost of the edges, and the upper limit of the edge capacity. Calculate the optimal solution for the minimum cost network flow model; The optimal transportation scheme between scene objects is derived based on the minimum cost network flow model; The transportation network includes a set of nodes, a set of edges, and a cost function and a capacity limit on the edge set, wherein the transportation network is denoted as G, and the cost function and capacity limit on the node set, edge set, and edge set are denoted as V(G), E(G), c, and u, respectively; The transportation routes are several transportation routes existing between the mining site, spoil heap, entrance and exit, and roads; The node set V(G) consists of the coordinates of the nodes formed by the mining site, spoil heap, entrance / exit, and roads. The edge set E(G) consists of all line segments with nodes in the node set V(G) as endpoints that contain transportation routes. The edge set E(G) consists of all edges in the transportation network, and the edges are transportation routes formed between mining sites, spoil heaps, entrances and exits and roads. The cost function c on the edge set E(G) is given by the horizontal distance and elevation change of the transportation route. The unit mass transportation cost of each edge in the transportation network is calculated based on the horizontal distance and elevation difference of the transportation route. The upper limit u of the capacity on the edge set E(G) is given by the transportation volume limit of the transportation line. The upper limit of the capacity of each edge in the graph structure is calculated based on the length of the construction period, the number of vehicles that can pass through the transportation line per unit time, and the transportation volume of the vehicles.
2. The transportation route planning method according to claim 1, characterized in that: The transportation network introduces virtual source and sink points to ensure flow conservation at nodes.
3. The transportation route planning method according to claim 1, characterized in that: The number of objects in the transportation scenario includes block data of the mining site, block data of the spoil heap, data of the entrance and exit of the mining site, data of the entrance and exit of the spoil heap, and data of the transportation routes between the entrances and exits; The block data of the mining site includes the centroid coordinates of each block and the volume of each block; The block data of the spoil heap includes the centroid coordinates and maximum capacity of each block; The data for the entrance and exit of the mining area includes the coordinates of the entrance and exit and the corresponding data with the mining area blocks; The data for the entrance and exit of the spoil heap includes the coordinates of the entrance and exit and the corresponding data of the spoil heap blocks; The data for the transportation routes between the entrances and exits consists of the transportation roads connecting the entrances and exits, including the coordinate data of the intermediate nodes of the transportation roads and the horizontal distance and elevation changes of each road.
4. The transportation route planning method according to claim 1, characterized in that: The upper limit of the capacity of the edge is the transportation engineering volume limit of the corresponding transportation line in the transportation network.
5. An apparatus for use in the transportation route planning method according to any one of claims 1-4, characterized in that, include: A transportation network establishment module (100) is used to establish a transportation network based on transportation scenario object data and transportation routes; Unit transportation cost calculation module (200), the unit transportation cost calculation module (200) is used to calculate the unit transportation cost of the edge in the transportation network based on the horizontal distance and elevation difference of the transportation route; Capacity limit calculation module (300), the capacity limit calculation module (300) is used to calculate the capacity limit of the edges in the transportation network graph according to the transportation volume limit of the transportation line; Minimum cost network flow model building module (400), which is used to build a minimum cost network flow model based on the transportation network graph, the unit transportation cost of the edge and the capacity limit of the edge; An optimal solution calculation module (500) is used to calculate the optimal solution of the minimum cost network flow model; The optimal transportation scheme determination module (600) is used to determine the optimal transportation scheme between scene objects based on the minimum cost network flow model.
6. A system applied to the transportation route planning method according to any one of claims 1-4, characterized in that, include: processor; Memory; And one or more programs, wherein the one or more programs are stored in memory and configured to be executed by the processor, the programs being used by the computer to perform the method as described in any one of claims 1-4.
Citation Information
Patent Citations
Logistics distribution method based on minimum cost flow network model
CN109993362A
