Natural gas conveying bottleneck determination method, device, equipment and medium

Abstract

The invention discloses a natural gas conveying bottleneck determination method and device, equipment and a medium, which are used for quickly and accurately determining whether a natural gas conveying bottleneck exists or not. According to the method and the device, when the conveying bottleneck determination instruction is received, each source gas supply node and each target gas supply node carried in the conveying bottleneck determination instruction can be identified, and the gas supply path from the source gas supply node to each target gas supply node is determined for each source gas supply node; the method comprises the following steps: determining whether a solution meeting a set constraint condition exists or not when a target function constructed based on a decision variable is solved based on an operational research linear programming algorithm by taking the transportation gas quantity distributed for each gas supply path as the decision variable; if the solution exists, the natural gas conveying bottleneck does not exist; if no solution exists, it can be considered that the natural gas conveying bottleneck exists, and on the basis, the purpose of rapidly and accurately determining whether the natural gas conveying bottleneck exists or not can be achieved.

Description

Technical Field

[0001] The present application relates to the field of data processing technology, and in particular to a method, device, equipment and medium for determining a natural gas transmission bottleneck. Background Art

[0002] The natural gas pipeline network can be used to transport natural gas from the gas supply node to the gas replenishment node (gas consumption node). So far, the process of determining whether there is a transportation bottleneck when transporting natural gas from the source gas supply node to the target gas replenishment node still mainly relies on manual experience. However, with the continuous construction and improvement of my country's natural gas pipelines, a natural gas pipeline network with interconnected pipelines has been formed. The topological structure of the natural gas pipeline network is complex. This method that relies on manual experience is difficult to ensure the speed and accuracy of determining whether there is a natural gas transportation bottleneck.

[0003] Therefore, there is an urgent need for a technical solution that can quickly and accurately determine whether there is a bottleneck in natural gas transportation. Summary of the invention

[0004] The present application provides a natural gas transmission bottleneck determination method, device, equipment and medium for quickly and accurately determining whether a natural gas transmission bottleneck exists.

[0005] In a first aspect, the present application provides a method for determining a natural gas transmission bottleneck, the method comprising: receiving a transport bottleneck determination instruction, wherein the transport bottleneck determination instruction carries at least one source gas supply node and at least one target gas supply node; For each of the source gas supply nodes, determine a gas supply path from the source gas supply node to each target gas supply node; The transport gas volume allocated to each gas replenishment path is determined as a decision variable, and based on an operations research linear programming algorithm, it is determined whether there is a solution that satisfies the set constraint conditions when solving an objective function constructed based on the decision variable; If there is a solution, there will be no bottleneck in natural gas transportation; if there is no solution, there will be a bottleneck in natural gas transportation.

[0006] In a possible implementation, the constraint condition includes at least one of the following: For each gas supply path, the transport gas volume allocated to the gas supply path is not greater than the maximum set gas supply and distribution volume of the gas supply path; For each gas supply source node, the sum of the transported gas volumes allocated to each gas supply path corresponding to the gas supply source node is not greater than the total gas supply volume of the gas supply source node; For each target gas supply node, the sum of the transported gas volumes allocated to each gas supply path corresponding to the target gas supply node is equal to the total gas volume required by the target gas supply node; For each gas replenishment path, the transport gas volume allocated to the gas replenishment path is a non-negative number; For each intermediate node in each gas supply path, the sum of the transport gas volumes allocated to each gas supply path where the intermediate node is located is not greater than the maximum set gas transmission and distribution volume of the intermediate node.

[0007] In a possible implementation, the method further includes: If there is no solution, a prompt message indicating that there is a bottleneck in natural gas transportation will be output.

[0008] In a possible implementation manner, if there is no solution, before outputting the prompt information that there is a natural gas transmission bottleneck, the method further includes: For each target gas supply node, based on the total gas volume demanded by the target gas supply node and the maximum set gas supply and distribution volume of each gas supply path corresponding to the target gas supply node, determine the estimated gas supply and distribution flow of each gas supply path corresponding to the target gas supply node; The output indicates that there is a bottleneck in natural gas transmission, including: The output carries the estimated transmission and distribution flow rate of each gas supply path corresponding to each target gas supply node and the prompt information of the maximum set gas transmission and distribution volume, and the prompt information is used to indicate the existence of a natural gas transmission bottleneck.

[0009] In a possible implementation, for each target gas supply node, based on the total gas volume required by the target gas supply node and the maximum set gas supply and distribution volume of each gas supply path corresponding to the target gas supply node, determining the estimated gas supply and distribution flow of each gas supply path corresponding to the target gas supply node includes: For each target gas supply node, the gas supply volume ratio of each gas supply path corresponding to the target gas supply node is determined according to the maximum set gas supply volume of each gas supply path corresponding to the target gas supply node; based on the total gas demand of the target gas supply node and the gas supply volume ratio, the expected gas supply flow of each gas supply path corresponding to the target gas supply node is determined.

[0010] In a possible implementation, constructing an objective function based on the decision variables includes: For each target gas supply node, an objective function is constructed based on maximizing the total gas demand of the target gas supply node by matching the sum of the transported gas volumes allocated to each gas supply path corresponding to the target gas supply node.

[0011] In a possible implementation manner, for each of the source gas supply nodes, determining the gas supply paths from the source gas supply node to each target gas supply node respectively includes: For each of the source gas supply nodes, based on the Yen algorithm, a set number of gas supply paths from the source gas supply node to each target gas supply node are determined respectively.

[0012] In a second aspect, the present application provides a natural gas transmission bottleneck determination device, the device comprising: A receiving module, configured to receive a transport bottleneck determination instruction, wherein the transport bottleneck determination instruction carries at least one source gas supply node and at least one target gas supply node; A determination module, for determining, for each of the source gas supply nodes, gas supply paths from the source gas supply node to each target gas supply node; The judgment module is used to determine the transport gas volume allocated to each gas replenishment path as a decision variable, and based on the operations research linear programming algorithm, judge whether there is a solution that meets the set constraint conditions when solving the objective function constructed based on the decision variable; if there is a solution, there is no natural gas transportation bottleneck; if there is no solution, there is a natural gas transportation bottleneck.

[0013] In a possible implementation, the constraint condition includes at least one of the following: For each gas supply path, the transport gas volume allocated to the gas supply path is not greater than the maximum set gas supply and distribution volume of the gas supply path; For each gas supply source node, the sum of the transported gas volumes allocated to each gas supply path corresponding to the gas supply source node is not greater than the total gas supply volume of the gas supply source node; For each target gas supply node, the sum of the transported gas volumes allocated to each gas supply path corresponding to the target gas supply node is equal to the total gas volume required by the target gas supply node; For each gas replenishment path, the transport gas volume allocated to the gas replenishment path is a non-negative number; For each intermediate node in each gas supply path, the sum of the transport gas volumes allocated to each gas supply path where the intermediate node is located is not greater than the maximum set gas transmission and distribution volume of the intermediate node.

[0014] In a possible implementation, the device further includes: The output module is used to output a prompt message indicating that there is a bottleneck in natural gas transportation if there is no solution.

[0015] In a possible implementation manner, the output module is further used to: For each target gas supply node, based on the total gas volume demanded by the target gas supply node and the maximum set gas supply and distribution volume of each gas supply path corresponding to the target gas supply node, determine the estimated gas supply and distribution flow of each gas supply path corresponding to the target gas supply node; The output carries the estimated transmission and distribution flow rate of each gas supply path corresponding to each target gas supply node and the prompt information of the maximum set gas transmission and distribution volume, and the prompt information is used to indicate the existence of a natural gas transmission bottleneck.

[0016] In a possible implementation manner, the output module is specifically used to: For each target gas supply node, the gas supply volume ratio of each gas supply path corresponding to the target gas supply node is determined according to the maximum set gas supply volume of each gas supply path corresponding to the target gas supply node; based on the total gas demand of the target gas supply node and the gas supply volume ratio, the expected gas supply flow of each gas supply path corresponding to the target gas supply node is determined.

[0017] In a possible implementation, the device further includes: The objective function construction module is used to construct an objective function for each target gas supply node based on maximizing the total gas demand of the target gas supply node based on the sum of the transport gas volumes allocated to each gas supply path corresponding to the target gas supply node.

[0018] In a possible implementation manner, the determining module is specifically configured to: For each of the source gas supply nodes, based on the Yen algorithm, a set number of gas supply paths from the source gas supply node to each target gas supply node are determined respectively.

[0019] In a third aspect, an embodiment of the present application further provides an electronic device, including: A memory for storing program instructions; The processor is used to call the program instructions stored in the memory, and execute the steps included in any one of the methods in the first aspect according to the obtained program instructions.

[0020] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, wherein the computer program includes program instructions, and when the program instructions are executed by a computer, the computer performs the steps of the method as described in any one of the first aspects.

[0021] In a fifth aspect, an embodiment of the present application provides a computer program product, which includes: a computer program code, which, when executed on a computer, enables the computer to execute the steps of the method described in any one of the first aspects.

[0022] Since the present application can identify the source gas supply nodes and target gas supply nodes carried in the transportation bottleneck determination instruction when receiving the transportation bottleneck determination instruction, and determine the gas supply paths from the source gas supply node to the target gas supply nodes for each source gas supply node; the transportation gas volume allocated to each gas supply path can be used as a decision variable, and based on the operations research linear programming algorithm, it is determined whether there is a solution that satisfies the set constraints when solving the objective function constructed based on the decision variable; if there is a solution, it can be considered that there is no natural gas transportation bottleneck; if there is no solution, it can be considered that there is a natural gas transportation bottleneck, based on which the purpose of quickly and accurately determining whether there is a natural gas transportation bottleneck can be achieved. BRIEF DESCRIPTION OF THE DRAWINGS

[0023] In order to more clearly illustrate the implementation methods in the embodiments of the present application or the related technologies, the following is a brief introduction to the drawings required for use in the embodiments or the related technology descriptions. Obviously, the drawings described below are some embodiments of the present application, and a person skilled in the art can also obtain other drawings based on these drawings.

[0024] Figure 1 A schematic diagram of a first natural gas transmission bottleneck determination process provided by some embodiments is shown; Figure 2 A schematic diagram of a second natural gas transmission bottleneck determination process provided by some embodiments is shown; Figure 3 A schematic diagram of a natural gas transmission bottleneck determination device provided by some embodiments is shown; Figure 4 A schematic diagram of the structure of an electronic device provided by some embodiments is shown. DETAILED DESCRIPTION

[0025] In order to make the purpose, technical scheme and advantages of the present application clearer, the technical scheme in the embodiment of the present application will be clearly and completely described below in conjunction with the drawings in the embodiment of the present application. Obviously, the described embodiment is only a part of the embodiment of the present application, rather than all the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in the field without making creative work are within the scope of protection of the present application. In the absence of conflict, the embodiments in the present application and the features in the embodiments can be arbitrarily combined with each other. In addition, although the logical order is shown in the flow chart, in some cases, the steps shown or described can be performed in an order different from that here.

[0026] The terms "first" and "second" in the specification and claims of the present application and the above-mentioned drawings are used to distinguish different objects, rather than to describe a specific order. In addition, the term "comprising" and any of their variations are intended to cover non-exclusive protection. For example, a process, method, system, product or device comprising a series of steps or units is not limited to the listed steps or units, but optionally also includes steps or units that are not listed, or optionally also includes other steps or units inherent to these processes, methods, products or devices. "Multiple" in the present application can mean at least two, for example, two, three or more, and the embodiments of the present application are not limited.

[0027] The following is a description of exemplary embodiments of the present application in conjunction with the accompanying drawings, including various details of the embodiments of the present application to facilitate understanding, which should be considered as merely exemplary. Therefore, those of ordinary skill in the art should recognize that various changes and modifications can be made to the embodiments described herein without departing from the scope of the present application. Similarly, for the sake of clarity and conciseness, the description of well-known functions and structures is omitted in the following description. It should be noted that in the embodiments of the present application, certain software, components, models and other existing solutions in the industry may be mentioned, which should be considered as exemplary, and their purpose is only to illustrate the feasibility of the implementation of the technical solution of the present application, but it does not mean that the applicant has or will necessarily use the solution.

[0028] In the technical solution of this application, the acquisition, transmission, storage, and use of data are in compliance with the requirements of relevant national laws and regulations.

[0029] In order to quickly and accurately determine whether there is a natural gas transmission bottleneck, the embodiments of the present application propose a natural gas transmission bottleneck determination method, device, equipment and medium. Some preferred embodiments of the present application are described below in conjunction with the drawings of the specification. Example

[0030] Figure 1 A schematic diagram of a first natural gas transmission bottleneck determination process provided by some embodiments is shown, such as Figure 1 As shown, the process includes the following steps: S101: Receive a transport bottleneck determination instruction, wherein the transport bottleneck determination instruction carries at least one source gas supply node and at least one target gas replenishment node.

[0031] The method for determining the natural gas transmission bottleneck provided in the embodiment of the present application is applied to an electronic device, which may be a PC, a mobile terminal or other device, or a server or other device, and the present application does not make any specific limitation on this.

[0032] In a possible implementation, when a natural gas user such as a city gas company or a business household has a new gas demand, such as an increase in gas demand, a manager or the like can trigger a transmission bottleneck determination instruction in an electronic device, and the transmission bottleneck determination instruction can carry at least one (one or more) source gas supply node and at least one target gas replenishment node. The present application does not specifically limit the source gas supply node and the target gas replenishment node.

[0033] Optionally, the target gas replenishment node may include nodes of natural gas gas users with new gas demand. The source gas supply node and the target gas replenishment node carried in the transmission bottleneck determination instruction may be nodes with an associated relationship in the natural gas pipeline network. For example, assuming that source node 1 can supply gas to gas replenishment node a, gas replenishment node b, and gas replenishment node c respectively, source node 2 can also supply gas to gas replenishment node a, gas replenishment node b, and gas replenishment node c respectively, and source node 3 can also supply gas to gas replenishment node a, gas replenishment node b, and gas replenishment node c respectively, then source node 1, source node 2, source node 3, gas replenishment node a, gas replenishment node b, and gas replenishment node c can all be used as nodes with an associated relationship in the natural gas pipeline network. When the customer to whom one or more of gas replenishment node a, gas replenishment node b, and gas replenishment node c belong increases gas demand, etc., the corresponding source gas supply nodes carried in the transmission bottleneck determination instruction may include source node 1, source node 2, and source node 3, and the target gas replenishment node may include gas replenishment node a, gas replenishment node b, and gas replenishment node c.

[0034] S102: For each of the source gas supply nodes, determine a gas supply path from the source gas supply node to each target gas supply node.

[0035] In a possible implementation, in order to accurately determine whether there is a bottleneck in natural gas transmission, for each source gas supply node, the gas supply path from the source gas supply node to each target gas supply node can be determined. Taking the source gas supply node as source node 1, and the target gas supply nodes as gas supply node a, gas supply node b, and gas supply node c as an example, the gas supply path from source node 1 to gas supply node a, the gas supply path from source node 1 to gas supply node b, and the gas supply path from source node 1 to gas supply node c can be determined respectively. Among them, the gas supply path from the source gas supply node to the target gas supply node can be determined by using existing technology, which will not be repeated here.

[0036] S103: The transport gas volume allocated to each gas replenishment path is determined as a decision variable, and based on the operations research linear programming algorithm, it is determined whether there is a solution that satisfies the set constraints when solving the objective function constructed based on the decision variable; if there is a solution, there is no natural gas transportation bottleneck; if there is no solution, there is a natural gas transportation bottleneck.

[0037] In a possible implementation, a system-wide linear programming algorithm can be used to quickly and accurately determine whether there is a bottleneck in natural gas transportation. The system-wide linear programming algorithm includes three elements: decision variables, objective functions, and constraints. These three elements are introduced below.

[0038] Element 1: Decision variables.

[0039] The transport gas volume allocated (matched) to each gas replenishment path can be used as a decision variable. For ease of understanding, the source gas supply node (transmission and distribution starting point) is represented by i, i can be 1, 2, 3, ... m, m is a positive integer. The target gas replenishment node (transmission and distribution end point) is represented by j, j can be 1, 2, 3, ... n, n is a positive integer, and the transport gas volume allocated to the gas replenishment path from any source gas supply node i to any target gas replenishment node j is represented by Indicates that the transport gas volume allocated to each gas replenishment path can be As a decision variable. Among them, the transport gas volume in the embodiment of the present application can be the transport gas volume per unit time, such as the transport gas volume within one hour, etc., and the present application does not make specific limitations on this.

[0040] Element 2: Objective function.

[0041] An objective function can be constructed based on the decision variables, and the objective function can also be called an optimization objective. When constructing the objective function, the objective function can be constructed for each target gas replenishment node based on the guiding idea that the sum of the transported gas volume allocated to each gas replenishment path corresponding to the target gas replenishment node can maximize the total gas volume required by the target gas replenishment node. That is, the objective function can be to maximize the matching amount, that is, the sum of the transported gas volume allocated to each gas replenishment path corresponding to the target gas replenishment node maximizes the total gas volume required by the target gas replenishment node: .

[0042] Element three: constraints.

[0043] In a possible implementation, the constraint condition may include at least one (or more) of the following a, b, c, d, and e: a. For each gas supply path, the transport gas volume allocated to the gas supply path is not greater than the maximum set gas supply and distribution volume of the gas supply path.

[0044] Considering that the amount of natural gas transported through any gas supply path in a unit time is usually limited by the maximum transmission and distribution capacity of the gas supply path (the maximum set transmission and distribution gas volume), for each gas supply path, the transport gas volume x allocated to the gas supply path is ij It can be no greater than (less than or equal to) the maximum set gas delivery volume C of the gas supply path ij , that is, xij ≤C ij As one of the constraints. Among them, the maximum set gas distribution volume C of the gas supply path ij It can be predetermined based on expert experience, etc., and this application does not make any specific limitation on this.

[0045] b. For each source gas supply node, the sum of the transport gas volumes allocated to each gas supply path corresponding to the source gas supply node is not greater than the total gas supply volume of the source gas supply node.

[0046] Generally, the sum of the gas volumes supplied by any gas supply node to the gas supply node is not greater than the total gas volume that the gas supply node can provide. i The sum of the transported gas volumes allocated to each gas supply path corresponding to the source gas supply node i is represented by Indicates that, then as one of the constraints.

[0047] c. For each target gas supply node, the sum of the transported gas volumes allocated to the gas supply paths corresponding to the target gas supply node is equal to the total gas volume required by the target gas supply node.

[0048] Generally, the sum of the gas volumes transported by each source gas supply node for the target gas supply node needs to be the same as the total gas volume required by the target gas supply node. Therefore, for each target gas supply node, the sum of the transported gas volumes allocated to each gas supply path corresponding to the target gas supply node can be equal to the total gas volume required by the target gas supply node. For the convenience of description, the total gas volume required by any target gas supply node j is denoted by D j Indicates that the sum of the transport gas volumes allocated to each gas replenishment path corresponding to the target gas replenishment node j is expressed as Indicates that, then as one of the constraints.

[0049] d. For each gas replenishment path, the transport gas volume allocated to the gas replenishment path is a non-negative number.

[0050] Generally, when the target gas replenishment node is replenished, the transport gas volume x allocated to the gas replenishment path is ij is a value greater than or equal to 0, so x ij ≥0 as one of the constraints.

[0051] e. For each intermediate node in each gas supply path, the sum of the transport gas volumes allocated to each gas supply path where the intermediate node is located shall not be greater than the maximum set gas transmission and distribution volume of the intermediate node.

[0052] In general, not only the volume of natural gas transported by the gas supply path is limited by the maximum transmission and distribution capacity (maximum set transmission and distribution volume) of the gas supply path, but also the sum of the gas volumes transported by each gas supply path passing through each gate station and other nodes (for convenience of description, called intermediate nodes) in the gas supply path is also limited by the maximum transmission and distribution capacity (maximum set transmission and distribution volume) of the intermediate node. Among them, for any intermediate node t in each gas supply path, the transport gas volume x allocated to each gas supply path passing through the intermediate node ij The sum of the values ​​can be used Indicates that, when a certain gas replenishment path x ij When passing through the intermediate node t (that is, the intermediate node t is located on the gas replenishment path x ij China Time), s t,ij =1, and when a certain gas replenishment path x ij When the intermediate node t is not passed (that is, the intermediate node t is not located in the gas replenishment path x ij China Time), s t,ij =0.

[0053] The maximum transmission and distribution capacity (maximum set transmission and distribution gas volume) of the intermediate node t is expressed as C t Indicates that, then As one of the constraints. Among them, the maximum set gas transmission and distribution volume C of the intermediate node t It can be predetermined based on expert experience, etc., and this application does not make any specific limitation on this.

[0054] In a possible implementation, the objective function can be solved based on the above constraints, objective function, decision variables, and the simplex method in the operations research linear programming algorithm to find the optimal matching amount (transported gas volume) allocated to each gas replenishment path. The process of solving the objective function can adopt the existing technology, which will not be repeated here.

[0055] In a possible implementation, if a solution that satisfies the above constraints is obtained when solving the objective function, it can be considered that natural gas can be transported according to the optimal matching amount (transportation gas volume) allocated to each gas replenishment path obtained by the solution, and there is no natural gas transportation bottleneck at this time.

[0056] However, if no solution is found that satisfies the above constraints when solving the objective function, that is, the objective function has no solution, it can be considered that at this time, the gas supply nodes and the gas supply paths cannot meet the gas demand of the target gas supply nodes, and there is a natural gas transportation bottleneck.

[0057] In a possible implementation, in order to prompt the staff, when the objective function has no solution, a prompt message indicating that there is a bottleneck in natural gas transmission may be output. The specific form of the prompt message is not specifically limited in this application and can be flexibly set according to needs.

[0058] In a possible implementation, when the objective function has no solution, in order to let the staff know the reasons for the natural gas transportation bottleneck, etc., for each target gas supply node j, the total gas volume D required by the target gas supply node can be calculated based on the total gas volume D required by the target gas supply node. j , and the maximum set gas delivery volume C of each gas supply path corresponding to the target gas supply node j ij , to determine the estimated distribution flow of each gas supply path corresponding to the target gas supply node j.

[0059] For example, for each target gas supply node j, the maximum set gas delivery volume C of each gas supply path corresponding to the target gas supply node can be set. ij , to determine the gas supply volume ratio of each gas supply path corresponding to the target gas supply node j. The gas supply volume ratio of a gas supply path corresponding to the target gas supply node can be: the ratio of the maximum set gas supply volume of the gas supply path to the sum of the maximum set gas supply volumes of each gas supply path corresponding to the target gas supply node. For example, assuming that there are 3 gas supply paths corresponding to the target gas supply node, where the maximum set gas supply volume of the first gas supply path per unit time is 1 cubic meter (m3), the maximum set gas supply volume of the second gas supply path is 2 m3, and the maximum set gas supply volume of the third gas supply path is 3 m3, then the gas supply volume ratio of the first gas supply path is 1 / 6, the gas supply volume ratio of the second gas supply path is 2 / 6 (1 / 3), and the gas supply volume ratio of the third gas supply path is 3 / 6 (1 / 2).

[0060] After determining the proportion of gas transmission and distribution volume of each gas supply path, the estimated transmission and distribution flow of each gas supply path corresponding to the target gas supply node can be determined based on the total gas volume demanded by the target gas supply node and the proportion of gas transmission and distribution volume of each gas supply path. For example, for any gas supply path corresponding to the target gas supply node, the estimated transmission and distribution flow of the gas supply path can be the product of the total gas volume demanded by the target gas supply node and the proportion of gas transmission and distribution volume of the gas supply path. For example, assuming that the total gas demand of the target gas supply node per unit time is 10 cubic meters, the gas transmission and distribution volume of the first gas supply path accounts for 1 / 6, the gas transmission and distribution volume of the second gas supply path accounts for 2 / 6, and the gas transmission and distribution volume of the third gas supply path accounts for 3 / 6. Then, the estimated transmission and distribution flow of the first gas supply path is 10×1 / 6 cubic meters, that is, 1.67 cubic meters; the estimated transmission and distribution flow of the second gas supply path is 10×2 / 6 cubic meters, that is, 3.33 cubic meters; and the estimated transmission and distribution flow of the third gas supply path is 10×3 / 6 cubic meters, that is, 5 cubic meters.

[0061] In a possible implementation, a prompt message indicating the existence of a natural gas transmission bottleneck may be output, and the prompt message may carry the estimated transmission and distribution flow and the maximum set transmission and distribution gas volume of each gas supply path corresponding to each target gas supply node. Optionally, when the estimated transmission and distribution flow of any gas supply path corresponding to the target gas supply node is greater than the maximum set transmission and distribution gas volume of the gas supply path, the prompt message may carry information that the estimated transmission and distribution flow of the gas supply path is greater than the maximum set transmission and distribution gas volume, so that the staff can learn the reasons for the existence of the natural gas transmission bottleneck based on the prompt message.

[0062] For example, assuming that the target gas supply node j corresponds to 3 gas supply paths, among which the maximum set gas transmission and distribution volume of the first gas supply path per unit time is 1 cubic meter, the maximum set gas transmission and distribution volume of the second gas supply path is 2 cubic meters, and the maximum set gas transmission and distribution volume of the third gas supply path is 3 cubic meters, and the calculated estimated transmission and distribution flow of the first gas supply path is 1.67 cubic meters, the estimated transmission and distribution flow of the second gas supply path is 3.33 cubic meters, and the estimated transmission and distribution flow of the third gas supply path is 5 cubic meters, then the prompt information may carry the information that the estimated transmission and distribution flow of the first gas supply path corresponding to the target gas supply node j is 1.67 cubic meters > the maximum set gas transmission and distribution volume of the first gas supply path is 1 cubic meter, the estimated transmission and distribution flow of the second gas supply path is 3.33 cubic meters > the maximum set gas transmission and distribution volume of the second gas supply path is 2 cubic meters, and the estimated transmission and distribution flow of the third gas supply path is 5 cubic meters > the maximum set gas transmission and distribution volume of the third gas supply path is 3 cubic meters.

[0063] Since the present application can identify the source gas supply nodes and target gas supply nodes carried in the transportation bottleneck determination instruction when receiving the transportation bottleneck determination instruction, and determine the gas supply paths from the source gas supply node to the target gas supply nodes for each source gas supply node; the transportation gas volume allocated to each gas supply path can be used as a decision variable, and based on the operations research linear programming algorithm, it is determined whether there is a solution that satisfies the set constraints when solving the objective function constructed based on the decision variable; if there is a solution, it can be considered that there is no natural gas transportation bottleneck; if there is no solution, it can be considered that there is a natural gas transportation bottleneck, based on which the purpose of quickly and accurately determining whether there is a natural gas transportation bottleneck can be achieved. Example

[0064] In order to accurately determine whether there is a natural gas transmission bottleneck, based on the above embodiment, in the embodiment of the present application, for each of the source gas supply nodes, determining the gas supply path from the source gas supply node to each target gas supply node includes: For each of the source gas supply nodes, based on the Yen algorithm, a set number of gas supply paths from the source gas supply node to each target gas supply node are determined respectively.

[0065] In a possible implementation, when determining a gas supply path from a source gas supply node to a target gas supply node, only one gas supply path from a source gas supply node to a target gas supply node may be determined, and based on the gas supply path, it is determined whether there is a natural gas transmission bottleneck.

[0066] In a possible implementation, considering that compared to only determining one gas supply path from a source gas supply node to a target gas supply node, and determining whether there is a natural gas transmission bottleneck based on only this one gas supply path, determining multiple gas supply paths from a source gas supply node to a target gas supply node, and determining whether there is a natural gas transmission bottleneck based on multiple gas supply paths can improve the accuracy of determining whether there is a natural gas transmission bottleneck and reduce the misjudgment rate.

[0067] Optionally, for each source gas supply node, a set number of gas supply paths from the source gas supply node to each target gas supply node can be determined based on the Yen algorithm. The present application does not specifically limit the number (set number) of gas supply paths determined from a source gas supply node to a target gas supply node. Exemplarily, the set number can be 3. When the set number is 3, for each source gas supply node, three gas supply paths from the source gas supply node to each target gas supply node can be determined based on the Yen algorithm.

[0068] For example, taking the source gas supply node as 1, and the target gas supply nodes as gas supply node a, gas supply node b, and gas supply node c, three gas supply paths from the source gas supply node 1 to the gas supply node a can be determined based on the Yen algorithm. These three gas supply paths can pass through different intermediate nodes. For example, these three gas supply paths can be a gas supply path from the source gas supply node 1 to the intermediate node g1 and then to the gas supply node a, a gas supply path from the source gas supply node 1 to the intermediate node g2 and then to the gas supply node a, and a gas supply path from the source gas supply node 1 to the intermediate node g3 and then to the gas supply node a. Similarly, the three gas supply paths from the source gas supply node 1 to the gas supply node b and the three gas supply paths from the source gas supply node 1 to the gas supply node c can be determined based on the Yen algorithm, which will not be repeated here.

[0069] The following is a brief introduction to the Yen algorithm and the specific process of determining a set number of gas replenishment paths from the source gas supply node i to the target gas replenishment node j based on the Yen algorithm.

[0070] Among them, the Yen algorithm can also be called Yen's algorithm. The Yen algorithm can find a preset number of shortest paths between two fixed points (such as from the source gas supply node i to the target gas supply node j) in a directed acyclic graph (computational graph). The core concept of the Yen algorithm is to set the length of a certain section of the path (shortest path) to infinity (that is, not considering this section of the path) on the basis of the shortest path that has been found, and then re-run the shortest path algorithm to find the shortest path that can replace this section of the path. This process is carried out section by section, and only one section of the path or one node is changed each time until a set number of shortest paths (such as K) are found. That is, the Yen algorithm can find the second shortest, the third shortest, and other shorter paths by changing a section of the shortest path section by section and recalculating the shortest path, thereby obtaining a set of the preset number of shortest paths.

[0071] The specific process of determining a set number of gas supply paths from the source gas supply node i to the target gas supply node j based on the Yen algorithm can be as follows: Step 1: You can use the Dijkstra algorithm (also known as the Dijkstra algorithm) and other shortest path algorithms to find the shortest path from the source gas supply node i to the target gas supply node j. , the shortest path As the first shortest path from the source gas supply node i to the target gas supply node j. Add to the gas replenishment path set A.

[0072] The basic idea of ​​the Dijkstra algorithm is to set a vertex set S and continuously make greedy choices to expand this set until S contains all vertices, that is, starting from the source point S (source gas supply node i), gradually expanding outward until all other vertices are covered. This algorithm requires that there are no negative weight edges in the graph to ensure the correctness of the algorithm.

[0073] The process of determining the first shortest path based on the Dijkstra algorithm can be as follows: 1) Assume that the topological structure of the natural gas pipeline network can be constructed based on the transmission and distribution nodes and pipeline information such as gate stations, pressure regulating stations, and pressure regulating cabinets in the natural gas pipeline network. The topological structure of the natural gas pipeline network is represented by an undirected graph G = (V, E), where V is the set of nodes in the natural gas pipeline network and E is the set of pipelines (edges) in the natural gas pipeline network. Each node in the topological structure of the natural gas pipeline network can represent a pipeline intersection, and each edge can represent a section of pipeline.

[0074] 2) Initialization: First, the direct distance from the source point S (source supply node i) to each point in the graph is recorded as the initial value. For points that cannot be reached directly, the distance is recorded as infinity (∞), and the distance from the source point S (source supply node i) to itself is set to 0.

[0075] 3) Select unvisited points (nodes): Put all nodes except the source point S (source supply node i) into set B. Traverse a node u with the shortest path distance to the source point S (source supply node i) in set B and take it out of set B.

[0076] Update distance: Update the distance from the source point S (source gas supply node i) to each point v in the set B by the newly determined point u (node ​​u). If the distance from the source point S to point u plus the distance from point u to point v is less than the current distance from the source point S to point v, it indicates that the length of the newly generated shortest path is shorter than the length of the previously calculated path. This distance can be updated to ensure that this distance is the shortest, and the shortest path is updated at the same time.

[0077] 4) Repeat steps: Repeat the two steps in step 3) above until all points have been visited or updated. At this point, the first shortest path can be found. .

[0078] Step 2: On the first shortest path Based on , the deviation path is calculated. The process of calculating the deviation path can be as follows: A. For the shortest path Each node in , save the shortest path Located at this node The information of the next node is recorded as .

[0079] B. For each slave node Departure side , temporarily delete it, and then use a shortest path algorithm such as Dijkstra's algorithm to calculate the path from node To the target gas replenishment node The shortest path ,if exists, then the path Located at the node The previous part of the path and Stitch together to form a new path , and add it to the candidate path set.

[0080] C. Restore edge .

[0081] Step 3: Select a shortest path from the candidate path set, add it to the gas replenishment path set A, and delete the path from the candidate path set.

[0082] Step 4: Repeat steps 2 and 3 above until a set number (e.g., 3) of shortest paths are found.

[0083] Subsequently, the set number of gas supply paths from a certain source gas supply node i to a certain target gas supply node j determined based on the Yen algorithm can be used as candidate (alternative) gas supply paths from a certain source gas supply node i to a certain target gas supply node j, and the preferred (optimal) gas supply path from the source gas supply node i to the target gas supply node j and the reasonable transport gas volume allocated to the preferred gas supply path can be calculated based on these gas supply paths and the operations research linear programming algorithm. Among them, the preferred gas supply path (the calculated preferred gas supply path from the source gas supply node i to the target gas supply node j) can be one or more of the set number of gas supply paths (the set number of gas supply paths from the source gas supply node i to the target gas supply node j). When the preferred gas supply path (the preferred gas supply path from the source gas supply node i to the target gas supply node j) is a plurality of gas supply paths among the set number of gas supply paths, the sum of the transport gas volumes allocated to the plurality of preferred gas supply paths can be used as the transport gas volume x allocated to the gas supply path from the source gas supply node i to the target gas supply node j. ij , I will not go into details here.

[0084] Among them, if the objective function is solved based on the operations research linear programming algorithm, for each source gas supply node and each target gas replenishment node carried in the transmission bottleneck determination instruction, it is calculated that there are preferred (optimal) gas replenishment paths from each source gas supply node i to the corresponding target gas replenishment node and a reasonable transportation gas volume allocated to the preferred gas replenishment path, that is, when the objective function is solved, there is a solution that satisfies the set constraints, then it can be considered that there is no natural gas transmission bottleneck. Optionally, when there is no natural gas transmission bottleneck, the calculated preferred gas replenishment paths from each source gas supply node to the corresponding target gas replenishment node and the calculated (allocated) reasonable transportation gas volume for each gas replenishment path can be output for reference by the staff. If the corresponding preferred gas replenishment path and the reasonable transportation gas volume (optimal matching volume) are not calculated for any source gas supply node to any target gas replenishment node, it can be considered that when the objective function is solved, there is no solution that satisfies the set constraints, and it can be considered that there is a natural gas transmission bottleneck at this time, which will not be repeated here.

[0085] For ease of understanding, the natural gas transmission bottleneck determination process provided by the present application is explained below through a specific embodiment. Figure 2 , Figure 2 A schematic diagram of a second natural gas transmission bottleneck determination process provided by some embodiments is shown, the process comprising the following steps: S201: Receive a transport bottleneck determination instruction, where the transport bottleneck determination instruction carries at least one source gas supply node and at least one target gas replenishment node.

[0086] S202: For each source gas supply node, based on the Yen algorithm, a set number of gas supply paths from the source gas supply node to each target gas supply node are determined respectively.

[0087] S203: The transport gas volume allocated to each gas replenishment path is determined as a decision variable. Based on the operations research linear programming algorithm, it is determined whether there is a solution that meets the set constraints when solving the objective function constructed based on the decision variables; if there is a solution, it is considered that there is no natural gas transportation bottleneck; if there is no solution, proceed to S204.

[0088] S204: For each target gas supply node, based on the total gas volume demanded by the target gas supply node and the maximum set gas supply and distribution volume of each gas supply path corresponding to the target gas supply node, determine the estimated distribution flow of each gas supply path corresponding to the target gas supply node; output prompt information carrying the estimated distribution flow and the maximum set gas supply and distribution volume of each gas supply path corresponding to each target gas supply node, where the prompt information is used to indicate the existence of a natural gas transmission bottleneck.

[0089] Embodiment 3: Based on the same technical concept, the present application provides a natural gas pipeline network gas replenishment path determination device, see Figure 3 , Figure 3 A schematic diagram of a natural gas transmission bottleneck determination device provided in some embodiments is shown, the device comprising: A receiving module 31, configured to receive a transport bottleneck determination instruction, wherein the transport bottleneck determination instruction carries at least one source gas supply node and at least one target gas supply node; A determination module 32 is used to determine, for each of the source gas supply nodes, gas supply paths from the source gas supply node to each target gas supply node; The judgment module 33 is used to determine the transport gas volume allocated to each gas replenishment path as a decision variable, and based on the operations research linear programming algorithm, judge whether there is a solution that meets the set constraints when solving the objective function constructed based on the decision variable; if there is a solution, there is no natural gas transportation bottleneck; if there is no solution, there is a natural gas transportation bottleneck.

[0090] In a possible implementation, the constraint condition includes at least one of the following: For each gas supply path, the transport gas volume allocated to the gas supply path is not greater than the maximum set gas supply and distribution volume of the gas supply path; For each gas supply source node, the sum of the transported gas volumes allocated to each gas supply path corresponding to the gas supply source node is not greater than the total gas supply volume of the gas supply source node; For each target gas supply node, the sum of the transported gas volumes allocated to each gas supply path corresponding to the target gas supply node is equal to the total gas volume required by the target gas supply node; For each gas replenishment path, the transport gas volume allocated to the gas replenishment path is a non-negative number; For each intermediate node in each gas supply path, the sum of the transport gas volumes allocated to each gas supply path where the intermediate node is located is not greater than the maximum set gas transmission and distribution volume of the intermediate node.

[0091] In a possible implementation, the device further includes: The output module is used to output a prompt message indicating that there is a bottleneck in natural gas transportation if there is no solution.

[0092] In a possible implementation manner, the output module is further used to: For each target gas supply node, based on the total gas volume demanded by the target gas supply node and the maximum set gas supply and distribution volume of each gas supply path corresponding to the target gas supply node, determine the estimated gas supply and distribution flow of each gas supply path corresponding to the target gas supply node; The output carries the estimated transmission and distribution flow rate of each gas supply path corresponding to each target gas supply node and the prompt information of the maximum set gas transmission and distribution volume, and the prompt information is used to indicate the existence of a natural gas transmission bottleneck.

[0093] In a possible implementation manner, the output module is specifically used to: For each target gas supply node, the gas supply volume ratio of each gas supply path corresponding to the target gas supply node is determined according to the maximum set gas supply volume of each gas supply path corresponding to the target gas supply node; based on the total gas demand of the target gas supply node and the gas supply volume ratio, the expected gas supply flow of each gas supply path corresponding to the target gas supply node is determined.

[0094] In a possible implementation, the device further includes: The objective function construction module is used to construct an objective function for each target gas supply node based on maximizing the total gas demand of the target gas supply node based on the sum of the transport gas volumes allocated to each gas supply path corresponding to the target gas supply node.

[0095] In a possible implementation manner, the determining module 32 is specifically configured to: For each of the source gas supply nodes, based on the Yen algorithm, a set number of gas supply paths from the source gas supply node to each target gas supply node are determined respectively.

[0096] Embodiment 4: Based on the same technical concept, the present application also provides an electronic device, Figure 4A schematic diagram of the structure of an electronic device provided by some embodiments is shown. Figure 4 As shown, the electronic device includes: a processor 41, a communication interface 42, a memory 43 and a communication bus 44, wherein the processor 41, the communication interface 42, and the memory 43 communicate with each other through the communication bus 44; The memory 43 stores a computer program. When the program is executed by the processor 41, the processor 41 performs the following steps: receiving a transport bottleneck determination instruction, wherein the transport bottleneck determination instruction carries at least one source gas supply node and at least one target gas supply node; For each of the source gas supply nodes, determine a gas supply path from the source gas supply node to each target gas supply node; The transport gas volume allocated to each gas replenishment path is determined as a decision variable. Based on the operations research linear programming algorithm, it is determined whether there is a solution that meets the set constraints when solving the objective function constructed based on the decision variables; if there is a solution, there is no natural gas transportation bottleneck; if there is no solution, there is a natural gas transportation bottleneck.

[0097] In a possible implementation, the constraint condition includes at least one of the following: For each gas supply path, the transport gas volume allocated to the gas supply path is not greater than the maximum set gas supply and distribution volume of the gas supply path; For each gas supply source node, the sum of the transported gas volumes allocated to each gas supply path corresponding to the gas supply source node is not greater than the total gas supply volume of the gas supply source node; For each target gas supply node, the sum of the transported gas volumes allocated to each gas supply path corresponding to the target gas supply node is equal to the total gas volume required by the target gas supply node; For each gas replenishment path, the transport gas volume allocated to the gas replenishment path is a non-negative number; For each intermediate node in each gas supply path, the sum of the transport gas volumes allocated to each gas supply path where the intermediate node is located is not greater than the maximum set gas transmission and distribution volume of the intermediate node.

[0098] In a possible implementation manner, the processor 41 is further configured to: If there is no solution, a prompt message indicating that there is a bottleneck in natural gas transportation will be output.

[0099] In a possible implementation manner, the processor 41 is further configured to: For each target gas supply node, based on the total gas volume demanded by the target gas supply node and the maximum set gas supply and distribution volume of each gas supply path corresponding to the target gas supply node, determine the estimated gas supply and distribution flow of each gas supply path corresponding to the target gas supply node; The output carries the estimated transmission and distribution flow rate of each gas supply path corresponding to each target gas supply node and the prompt information of the maximum set gas transmission and distribution volume, and the prompt information is used to indicate the existence of a natural gas transmission bottleneck.

[0100] In a possible implementation manner, the processor 41 is specifically configured to: For each target gas supply node, the gas supply volume ratio of each gas supply path corresponding to the target gas supply node is determined according to the maximum set gas supply volume of each gas supply path corresponding to the target gas supply node; based on the total gas demand of the target gas supply node and the gas supply volume ratio, the expected gas supply flow of each gas supply path corresponding to the target gas supply node is determined.

[0101] In a possible implementation manner, the processor 41 is further configured to: For each target gas supply node, an objective function is constructed based on maximizing the total gas demand of the target gas supply node by matching the sum of the transported gas volumes allocated to each gas supply path corresponding to the target gas supply node.

[0102] In a possible implementation manner, the processor 41 is specifically configured to: For each of the source gas supply nodes, based on the Yen algorithm, a set number of gas supply paths from the source gas supply node to each target gas supply node are determined respectively.

[0103] The communication bus mentioned in the above electronic device can be a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus, etc. The communication bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, only one thick line is used in the figure, but it does not mean that there is only one bus or one type of bus.

[0104] The communication interface 42 is used for communication between the above electronic device and other devices.

[0105] The memory may include a random access memory (RAM) or a non-volatile memory (NVM), such as at least one disk memory. Optionally, the memory may also be at least one storage device located away from the aforementioned processor.

[0106] The above-mentioned processor can be a general-purpose processor, including a central processing unit, a network processor (NP), etc.; it can also be a digital signal processing processor (DSP), an application-specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, etc.

[0107] Based on the same technical concept, an embodiment of the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program executable by an electronic device. When the program runs on the electronic device, the electronic device implements the following steps when executing: receiving a transport bottleneck determination instruction, wherein the transport bottleneck determination instruction carries at least one source gas supply node and at least one target gas supply node; For each of the source gas supply nodes, determine a gas supply path from the source gas supply node to each target gas supply node; The transport gas volume allocated to each gas replenishment path is determined as a decision variable, and based on an operations research linear programming algorithm, it is determined whether there is a solution that satisfies the set constraint conditions when solving an objective function constructed based on the decision variable; If there is a solution, there will be no bottleneck in natural gas transportation; if there is no solution, there will be a bottleneck in natural gas transportation.

[0108] In a possible implementation, the constraint condition includes at least one of the following: For each gas supply path, the transport gas volume allocated to the gas supply path is not greater than the maximum set gas supply and distribution volume of the gas supply path; For each gas supply source node, the sum of the transported gas volumes allocated to each gas supply path corresponding to the gas supply source node is not greater than the total gas supply volume of the gas supply source node; For each target gas supply node, the sum of the transported gas volumes allocated to each gas supply path corresponding to the target gas supply node is equal to the total gas volume required by the target gas supply node; For each gas replenishment path, the transport gas volume allocated to the gas replenishment path is a non-negative number; For each intermediate node in each gas supply path, the sum of the transport gas volumes allocated to each gas supply path where the intermediate node is located is not greater than the maximum set gas transmission and distribution volume of the intermediate node.

[0109] In a possible implementation, the method further includes: If there is no solution, a prompt message indicating that there is a bottleneck in natural gas transportation will be output.

[0110] In a possible implementation manner, if there is no solution, before outputting the prompt information that there is a natural gas transmission bottleneck, the method further includes: For each target gas supply node, based on the total gas volume demanded by the target gas supply node and the maximum set gas supply and distribution volume of each gas supply path corresponding to the target gas supply node, determine the estimated gas supply and distribution flow of each gas supply path corresponding to the target gas supply node; The output indicates that there is a bottleneck in natural gas transmission, including: The output carries the estimated transmission and distribution flow rate of each gas supply path corresponding to each target gas supply node and the prompt information of the maximum set gas transmission and distribution volume, and the prompt information is used to indicate the existence of a natural gas transmission bottleneck.

[0111] In a possible implementation, for each target gas supply node, based on the total gas volume required by the target gas supply node and the maximum set gas supply and distribution volume of each gas supply path corresponding to the target gas supply node, determining the estimated gas supply and distribution flow of each gas supply path corresponding to the target gas supply node includes: For each target gas supply node, the gas supply volume ratio of each gas supply path corresponding to the target gas supply node is determined according to the maximum set gas supply volume of each gas supply path corresponding to the target gas supply node; based on the total gas demand of the target gas supply node and the gas supply volume ratio, the expected gas supply flow of each gas supply path corresponding to the target gas supply node is determined.

[0112] In a possible implementation, constructing an objective function based on the decision variables includes: For each target gas supply node, an objective function is constructed based on maximizing the total gas demand of the target gas supply node by matching the sum of the transported gas volumes allocated to each gas supply path corresponding to the target gas supply node.

[0113] In a possible implementation manner, for each of the source gas supply nodes, determining the gas supply paths from the source gas supply node to each target gas supply node respectively includes: For each of the source gas supply nodes, based on the Yen algorithm, a set number of gas supply paths from the source gas supply node to each target gas supply node are determined respectively.

[0114] The above-mentioned computer-readable storage medium can be any available medium or data storage device that can be accessed by the processor in the electronic device, including but not limited to magnetic storage such as floppy disks, hard disks, magnetic tapes, magneto-optical disks (MO), etc., optical storage such as CDs, DVDs, BDs, HVDs, etc., and semiconductor storage such as ROM, EPROM, EEPROM, non-volatile memory (NANDFLASH), solid-state drives (SSD), etc.

[0115] Based on the same technical concept, the present application provides a computer program product, which includes: computer program code, when the computer program code runs on a computer, the computer implements the method described in any method embodiment applied to an electronic device.

[0116] In the above embodiments, all or part of the embodiments may be implemented by software, hardware, firmware or any combination thereof, and all or part of the embodiments may be implemented in the form of a computer program product. The computer program product includes one or more computer instructions, and when the computer instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of the present application are generated.

[0117] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present application may adopt 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 codes.

[0118] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the present application. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0119] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0120] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0121] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

Claims

1. A method for determining a natural gas transmission bottleneck, characterized in that: The method comprises: receiving a transport bottleneck determination instruction, wherein the transport bottleneck determination instruction carries at least one source gas supply node and at least one target gas supply node; For each of the source gas supply nodes, determine a gas supply path from the source gas supply node to each target gas supply node; The transport gas volume allocated to each gas replenishment path is determined as a decision variable, and based on an operations research linear programming algorithm, it is determined whether there is a solution that satisfies the set constraint conditions when solving an objective function constructed based on the decision variable; If there is a solution, there will be no bottleneck in natural gas transportation; if there is no solution, there will be a bottleneck in natural gas transportation.

2. The method according to claim 1, characterized in that The constraint condition includes at least one of the following: For each gas supply path, the transport gas volume allocated to the gas supply path is not greater than the maximum set gas supply and distribution volume of the gas supply path; For each gas supply source node, the sum of the transported gas volumes allocated to each gas supply path corresponding to the gas supply source node is not greater than the total gas supply volume of the gas supply source node; For each target gas supply node, the sum of the transported gas volumes allocated to each gas supply path corresponding to the target gas supply node is equal to the total gas volume required by the target gas supply node; For each gas replenishment path, the transport gas volume allocated to the gas replenishment path is a non-negative number; For each intermediate node in each gas supply path, the sum of the transport gas volumes allocated to each gas supply path where the intermediate node is located is not greater than the maximum set gas transmission and distribution volume of the intermediate node.

3. The method according to claim 1 or 2, characterized in that: The method further comprises: If there is no solution, a prompt message indicating that there is a bottleneck in natural gas transportation will be output.

4. The method according to claim 3, characterized in that If there is no solution, before outputting the prompt information that there is a natural gas transmission bottleneck, the method further includes: For each target gas supply node, based on the total gas volume demanded by the target gas supply node and the maximum set gas supply and distribution volume of each gas supply path corresponding to the target gas supply node, determine the estimated gas supply and distribution flow of each gas supply path corresponding to the target gas supply node; The output indicates that there is a bottleneck in natural gas transmission, including: The output carries the estimated transmission and distribution flow rate of each gas supply path corresponding to each target gas supply node and the prompt information of the maximum set gas transmission and distribution volume, and the prompt information is used to indicate the existence of a natural gas transmission bottleneck.

5. The method according to claim 4, characterized in that The method of determining, for each target gas supply node, the estimated gas supply flow rate of each gas supply path corresponding to the target gas supply node based on the total gas demand of the target gas supply node and the maximum set gas supply and distribution volume of each gas supply path corresponding to the target gas supply node, includes: For each target gas supply node, the gas supply volume ratio of each gas supply path corresponding to the target gas supply node is determined according to the maximum set gas supply volume of each gas supply path corresponding to the target gas supply node; based on the total gas demand of the target gas supply node and the gas supply volume ratio, the expected gas supply flow of each gas supply path corresponding to the target gas supply node is determined.

6. The method according to any one of claims 1-2, 4-5, characterized in that: Constructing an objective function based on the decision variables includes: For each target gas supply node, an objective function is constructed based on maximizing the total gas demand of the target gas supply node by matching the sum of the transported gas volumes allocated to each gas supply path corresponding to the target gas supply node.

7. The method according to any one of claims 1-2, 4-5, characterized in that: The step of determining, for each of the source gas supply nodes, gas supply paths from the source gas supply node to each of the target gas supply nodes includes: For each of the source gas supply nodes, based on the Yen algorithm, a set number of gas supply paths from the source gas supply node to each target gas supply node are determined respectively.

8. A natural gas transmission bottleneck determination device, characterized in that: The device comprises: A receiving module, configured to receive a transport bottleneck determination instruction, wherein the transport bottleneck determination instruction carries at least one source gas supply node and at least one target gas supply node; A determination module, for determining, for each of the source gas supply nodes, gas supply paths from the source gas supply node to each target gas supply node; The judgment module is used to determine the transport gas volume allocated to each gas replenishment path as a decision variable, and based on the operations research linear programming algorithm, judge whether there is a solution that meets the set constraint conditions when solving the objective function constructed based on the decision variable; if there is a solution, there is no natural gas transportation bottleneck; if there is no solution, there is a natural gas transportation bottleneck.

9. An electronic device, characterized in that: The electronic device comprises at least a processor and a memory, and the processor is used to implement the steps of any one of the methods according to claims 1-7 when executing a computer program stored in the memory.

10. A computer-readable storage medium, characterized in that: It stores a computer program, which, when executed by a processor, implements the steps of the method according to any one of claims 1 to 7.

Images