JP2014054151A - Graph structure building device of transport network, graph structure building system, graph structure building method and graph structure building program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a graph structure building device of a transport network which allows even a person such as the unskilled to change or evaluate a graph structure.SOLUTION: A graph structure building device includes a GUI information processing section, an equation creating section, and a simulating section. The GUI information processing section displays a flow image of a transport network as GUI(Graphical User Interface), and creates a flow image based on the information inputted for the GUI. The GUI information processing section reads a graph structure consisting of a plurality of nodes and a plurality of edges from the flow image, and creates the structure information about the graph structure thus read. The equation creating section creates a simultaneous equation capable of calculating a pressure in at least one of a plurality of nodes, and a flow rate in at least one of a plurality of edges, based on the structure information. The simulating section calculates the pressure and flow rate by solving the simultaneous equation.

Description

  Embodiments of the present invention include a graph structure construction device that monitors a state of a transportation network based on a graph structure in a transportation network that transports electric power or fluid, a graph structure construction system that uses this graph structure construction device, and a graph The present invention relates to a graph structure construction method and a graph structure construction program used in a structure construction apparatus.

  With the recent liberalization of electric power, renewable energy has begun to spread. In addition, with the merger of municipalities, it is necessary to collectively manage waterworks that have been managed for each municipality. Against this background, the graph structure of transport networks that transport power or fluid has become complex. For this reason, it has become difficult for an administrator who manages the transportation network to accurately grasp the current state of the transportation network.

  By the way, in the monitoring system for monitoring the state of the transportation network, the graph structure of the transportation network is modeled at the time of introduction of the system. However, in order to change the graph structure to a desired graph structure after modeling, judgment by an expert or an expert is required. Therefore, it is difficult for non-experts and skilled workers, for example, O & M (Operation and Maintenance) workers to change the graph structure. However, since the graph structure of the transportation network changes from day to day, there is a need for an apparatus that can change and evaluate the graph structure as required.

Japanese Patent Laid-Open No. 6-303677 JP 2004-221904 A

  As described above, in the conventional management system, it is difficult for a person who is not an expert or the like to change the graph structure in order to change the set graph structure. Further, it is difficult for a person who is not an expert or the like to evaluate the graph structure after the change.

  Therefore, the purpose is to provide a graph structure construction device that can change / evaluate the graph structure even if it is not a skilled person, a graph structure construction system using the graph structure construction device, and a graph structure construction device. To provide a graph structure construction method and a graph structure construction program to be used.

  According to the embodiment, the graph structure construction device includes a GUI information processing unit, an equation creation unit, and a simulation unit. The GUI information processing unit displays a flow image of the transport network as a GUI (Graphical User Interface), creates a flow image based on information input to the GUI, and generates a plurality of nodes and a plurality of nodes from the flow image. A graph structure including the edges of the graph is read, and structure information about the read graph structure is created. The equation creating unit creates simultaneous equations that can calculate a pressure at at least one of the plurality of nodes and a flow rate at at least one of the plurality of edges based on the structure information. The simulation unit solves the simultaneous equations and calculates the pressure and the flow rate.

It is a block diagram which shows the function structure of the graph structure construction apparatus concerning 1st Embodiment. It is a block diagram which shows the function structure of the GUI information processing part shown in FIG. It is a figure which shows the flow image of a transport network. It is a flowchart which shows operation | movement of the graph structure construction apparatus at the time of calculating a simulation result based on the produced flow image. It is a figure which shows the flow creation screen displayed on the display part shown in FIG. It is a figure which shows the CSV file about the graph structure read from the flow image shown in FIG. It is a block diagram which shows the function structure of the graph structure construction apparatus concerning 2nd Embodiment. It is a flowchart which shows the operation | movement in the mode 1 of the state determination part shown in FIG. It is a figure which shows the flow image of the transport network when an edge fractures | ruptures. It is a flowchart which shows the operation | movement in the mode 2 of the state determination part shown in FIG. It is a flowchart which shows the operation | movement in the mode 3 of the state determination part shown in FIG. It is a figure which shows the transport network selected by the state determination part shown in FIG. It is a flowchart which shows the operation | movement in the mode 4 of the state determination part shown in FIG. It is a figure which shows the transport network containing the newly added node. It is a flowchart which shows the operation | movement in the mode 5 of the state determination part shown in FIG. It is a block diagram which shows the function structure of the graph structure construction apparatus concerning 3rd Embodiment. It is a flowchart which shows operation | movement of the graph structure construction apparatus shown in FIG. It is a block diagram which shows the other structure of the graph structure construction apparatus shown to FIG.

  Hereinafter, embodiments will be described with reference to the drawings.

(First embodiment)
FIG. 1 is a block diagram illustrating a functional configuration of the graph structure construction device 10 according to the first embodiment. A graph structure construction apparatus 10 shown in FIG. 1 constructs a graph structure of a transport network. The graph structure of the transport network is, for example, a model of a road network in which a vehicle moves, a pipe through which a liquid flows, an electric circuit through which an electric current flows, or a network that transports something else. In the present embodiment, a transport network that transports fluid will be described as an example.

  The graph structure is composed of nodes (nodes) and branches (edges). The node corresponds to a demand point such as a house, a building, a condominium, or a town, and a supply point such as a pond. The amount of demand belongs to each node, and represents the amount of water demand in units of houses, buildings, condominiums, and towns. The edge corresponds to a pipe line or the like, and is a directed graph having a direction from upstream to downstream. The flow rate flowing into one node is equal to the sum of the demand amount at that node and the flow rate flowing out from that node. However, this does not apply to the node that is the start point (source) and the node that is the end point (sink).

  The graph structure construction apparatus 10 shown in FIG. 1 includes, for example, a CPU (Central Processing Unit), a ROM (Read Only Memory) and a RAM (Random Access Memory) that store application programs and data for the CPU to execute processing. Etc. The graph structure construction device 10 has the following functions by causing the CPU to execute an application program. That is, the graph structure construction device 10 includes a GUI (Graphical User Interface) information processing unit 11, simultaneous equation generation unit 12, and simulation unit 13.

  The graph structure construction device 10 is connected to the display unit 20 and the operation input unit 30. The display unit 20 is, for example, an LCD (Liquid Crystal Display) or the like, and displays an image output from the graph structure construction device 10. The operation input unit 30 is, for example, a mouse and a touch panel, and a user of the graph structure construction device 10 inputs a desired instruction to the graph structure construction device 10. Note that the graph structure construction device 10 may include the display unit 20 and the operation input unit 30.

  FIG. 2 is a block diagram showing a functional configuration of the GUI information processing unit 11 shown in FIG. The GUI information processing unit 11 includes a flow image creation unit 111, a first file creation unit 112, a connection determination unit 113, a second file creation unit 114, a flow image reading unit 115, and a storage unit 116.

  The flow image creation unit 111 displays the flow image of the transport network on the display unit 20 as a GUI. A user of the graph structure construction device 10 inputs an input instruction for the GUI from the operation input unit 30. The flow image creation unit 111 creates a flow image according to an instruction input from the operation input unit 30. Note that the flow image creation unit 111 can create a new flow image, and if there is an existing flow image, can open the existing flow image and edit the existing flow image. FIG. 3 is a diagram illustrating an example of a flow image of the transport network when the transport network transports fluid.

  The first file creation unit 112 reads the graph structure from the flow image created by the flow image creation unit 111. The first file creation unit 112 creates a file in a format such as CSV (Comma-Separated Value) in which the read graph structure is described. At this time, the first file creation unit 112 holds, for example, the following rules. (1) Number the nodes starting with 1. (2) One edge and one end node are held for each edge. (3) Type 1 is set for the node that is the source of the network. The first file creation unit 112 reads the graph structure from the flow image according to the above rules, and creates a CSV file from the read graph structure. The first file creation unit 112 outputs the created CSV file to the simultaneous equation generation unit 12.

  The connection determination unit 113 determines whether there is a node that is not connected to any edge in the flow image drawn according to the user's instruction. When there is a node that is not connected to any edge, the connection determination unit 113 displays this on the display unit 20 as a warning.

  The second file creation unit 114 stores the flow image created by the flow image creation unit 111 in the storage unit 116 as a file to which a preset domain such as plt is added, for example.

  The flow image reading unit 115 reads the PLT file stored in the storage unit 116 and demodulates the read PLT file. The flow image reading unit 115 outputs the demodulated flow image to the flow image creation unit 111.

  The simultaneous equation generation unit 12 refers to the CSV file supplied from the GUI information processing unit 11 and creates simultaneous equations for the transport network. In a transport network, fluid cannot move freely, but moves according to three natural rules:

(1) For each one edge, the following equation must be satisfied between the flow rate of the fluid and the water pressure.

(P _i + h _i ) − (P _j + h _j ) = r _ij Q _ij ⁿ (1)
Here, P _i represents the pressure at node i, P _j represents the pressure at node j, Q _ij represents the flow rate flowing from node i to node j, and r _ij represents the edge resistance in the direction from node i to node j. H represents ground height, and n represents a flow multiplier. Note that the flow rate multiplier is caused by the friction of the pipe, and varies with the flow rate. For example, the flow rate multiplier is set to 1.85.

(2) A material balance is established for each node. That is, the flow rate flowing into the node is equal to the sum of the demand amount at the node and the flow rate flowing out from the node. For example, for the node 2 shown in FIG.

Q ₁₂ -Q ₂₃ -Q ₂₆ = q ₂ (2)
Here, q indicates a demand amount.

(3) The total demand amount of the entire network matches the supply amount from the start point of the network. For example, in the transport network shown in FIG.

The simultaneous equation generation unit 12 formulates the graph structure supplied from the GUI information processing unit 11 using the above three kinds of natural rules. For example, in the transport network shown in FIG.

The number of variables of the simultaneous equations obtained here is N + M, where N is the number of nodes and M is the number of edges.

The simulation unit 13 solves the simultaneous equations created by the simultaneous equation generation unit 12 and acquires P _i and Q _ij . There are several methods for solving simultaneous equations. For example, when solving by the first-order Newton-Raphson method, the equations can be solved by the following equation.

Here, J is a Jacobian matrix, f is a matrix in which the created simultaneous equations are arranged from the top, and x is a vector in which unknowns P _i and Q _ij are arranged. Note that f is a matrix of (N + M) × (N + M).

Next, a graph structure construction operation and a calculation operation of P _i and Q _ij by the graph structure construction device 10 configured as described above will be described in accordance with the processing procedure of the graph structure construction device 10. FIG. 4 is a flowchart illustrating an example of a processing procedure of the graph structure construction device 10 when simulating P _i and Q _ij based on the created flow image.

  First, the GUI information processing unit 11 creates a flow image in accordance with an instruction input from the operation input unit 30 (step S41). FIG. 5 is a diagram illustrating an example of a flow creation screen displayed on the display unit 20. The GUI information processing unit 11 draws a flow image on the display unit 20 according to the operation of the mouse 30. In addition, the GUI information processing unit 11 enables the user to set the specifications of the nodes and edges on the dialog.

  Subsequently, the GUI information processing unit 11 determines whether or not a simulation for the displayed flow image is requested (step S42). When the simulation for the displayed flow image is requested (Yes in step S42), the GUI information processing unit 11 reads the graph structure from the displayed flow image, and obtains the CSV file for the read graph structure. Create (step S43). FIG. 6 is a diagram showing an example of a CSV file for the graph structure read from the flow image shown in FIG. In the CSV file shown in FIG. 6, the starting point of the network is set to node No: 1, and the type “1” and the ground height “10.00” are set to node No: 1. Nodes Nos. 2 to 13 are set for the nodes other than the start point, and the type “0”, the demand amount “10.00”, and the ground height “0.00” are set to the node Nos. 2 to 13. In addition, edge numbers: 1 to 16 are set for the edges, and a node serving as a start point, a node serving as an end point, and an edge resistance “110” are set to the edge numbers: 1 to 16. The demand amount, ground height and edge resistance are not limited to the values shown in FIG.

  The simultaneous equation generation unit 12 substitutes each parameter set by the CSV file into the equation (4) to create a simultaneous equation (step S44).

The simulation unit 13 solves the simultaneous equations created by the simultaneous equation generation unit 12 and acquires P _i and Q _ij (step S45).

  As described above, in the first embodiment, the GUI information processing unit 11 uses the flow image creation unit 111 to create a flow image according to an instruction from the operation input unit 30. The GUI information processing unit 11 reads the graph structure of the created flow image by the first file creation unit 112 and creates a file for the read graph structure. Thereby, the graph structure construction device 10 can change the graph structure according to the flow image desired by the user.

The simultaneous equation generation unit 12 creates simultaneous equations with reference to a file created based on the graph structure. Then, the simulation unit 13 calculates the pressure P _{i at} each node and the flow rate Q _{ij at} each edge by solving the created simultaneous equations. Thereby, the graph structure construction device 10 can calculate physical quantities at each node and each edge based on the graph structure after the change.

  Therefore, according to the graph structure construction device 10 according to the first embodiment, even a person who is not an expert or the like can change the graph structure of the transport network. Moreover, according to the graph structure construction device 10, the state of the transport network is quantitatively evaluated.

(Second Embodiment)
FIG. 7 is a block diagram illustrating a functional configuration of the graph structure construction device 40 according to the second embodiment. The graph structure construction device 40 illustrated in FIG. 7 includes an acquisition unit 14, a storage, in addition to the GUI information processing unit 11, the simultaneous equation generation unit 12, and the simulation unit 13 that are functional configurations of the graph structure construction device 10 of the first embodiment. Unit 15 and state determination unit 16. Assuming the transportation network shown in FIG. 3, a sensor for detecting pressure is installed in at least one of the nodes shown in FIG. 3, and a sensor for detecting flow rate is provided in at least one of the edges shown in FIG. is set up. The pressure or flow rate detected by the sensor is stored in the storage unit 15.

  The simultaneous equation generation unit 12 generates simultaneous equations in accordance with instructions from the state determination unit 16.

  The simulation unit 13 solves the simultaneous equations generated by the simultaneous equation generation unit 12 and outputs the simulation result to the state determination unit 16.

  When the position of the sensor is specified by the GUI information processing unit 11 or the state determination unit 16, the acquisition unit 14 acquires the pressure and the flow rate stored in the storage unit 15 together with the sensor identification number according to the specified sensor position. To do. The acquisition unit 14 outputs the acquired information to the state determination unit 16.

  The state determination unit 16 determines the state of the transport network based on the simulation result by the simulation unit 13 and the information from the acquisition unit 14. The state determination unit 16 can determine five types of states. Below, five modes of the state determination part 16 which determines five types of states are demonstrated.

(Mode 1)
The state determination unit 16 compares the first simulation result obtained when all the edges are normal and the second simulation result obtained when the desired edge is broken. It is assumed that the state determination unit 16 can measure the influence of the broken edge at a node in which the pressure is more than a threshold value among the pressure in the first simulation result and the pressure in the second simulation result. On the other hand, it is assumed that the state determination unit 16 cannot measure the influence of the broken edge at a node where the pressure deviation is less than the threshold value. The state determination unit 16 specifies a node in which a pressure is more than a threshold value.

  The state determination unit 16 determines whether or not a sensor is installed at the identified node. When the sensor is not installed in the identified node, the state determination unit 16 notifies the user that the breakage of the edge cannot be specified in the current sensor installation state.

  FIG. 8 is a flowchart showing the operation of the state determination unit 16 in mode 1. In FIG. 8, a case where the user is assumed to break at edge No. 3 as shown in FIG. 9 will be described as an example. When there is a node that is not connected to any edge, for example, when edge No. 1 breaks, the connection determination unit 113 determines that the node is abnormal.

  First, the state determination part 16 acquires the 1st simulation result in case all the edges are normal from the simulation part 13 (step S81).

The state determination unit 16 acquires a second simulation result when the edge No: 3 is broken from the simulation unit 13 (step S82). In addition, when edge No: 3 breaks, the simultaneous equation generating unit 12 in the simultaneous equations of Equation (4),
(P ₃ + h ₃ ) − (P ₄ + h ₄ ) −r ₃₄ Q ₃₄ ⁿ = 0
Remove _the, the _{Q 23 -Q 34 -Q 35 = q} 3 and _Q 23 _-Q 35 = _{q 3,} the _{Q 34 -Q} 48 = _{q 4} and _-Q 48 = _{q 4.} The simulation unit 13 solves the simultaneous equations and calculates P _i and Q _ij as the second simulation result.

State determination unit 16, and P _i in the first simulation result, compared with the P _i in the second simulation result, identifies the nodes in excess of the threshold value deviations occur in P _i (step S83). A black circle shown in FIG. 9 indicates a node specified by the state determination unit 16 when a break occurs at the edge No: 3.

  The state determination unit 16 specifies the position of the sensor installed at the identified node to the acquisition unit 14. The acquisition unit 14 acquires the detection result from the sensor installed at the designated position from the storage unit 15. The state determination unit 16 determines whether or not a sensor is installed at the identified node by confirming whether or not the detection result is acquired by the acquisition unit 14 (step S84). When the sensor is not installed in the identified node (No in step S84), the state determination unit 16 notifies the user that the edge break cannot be identified in the current sensor installation state (step S85). When the sensor is installed in the identified node (Yes in step S84), the state determination unit 16 ends the process.

  As described above, the state determination unit 16 can determine whether or not the breakage occurring at the edge designated by the user can be detected in the current sensor arrangement state. In addition, the state determination unit 16 can designate which node the sensor should be installed in case a predetermined edge breaks.

(Mode 2)
The state determination unit 16 compares a first simulation result obtained when all the edges are normal and a plurality of second simulation results obtained when the edges constituting the transportation network are each broken. The state determination unit 16 identifies a node in which a pressure is more than a threshold value among the pressure in the first simulation result and the pressure in the second simulation result.

  The state determination unit 16 refers to the identified node, and identifies the installation positions of sensors necessary for detecting breakage at all edges constituting the network. The state determination unit 16 notifies the user of the specified installation position.

  FIG. 10 is a flowchart showing the operation of the state determination unit 16 in mode 2.

  First, the state determination part 16 acquires the 1st simulation result in case all the edges are normal from the simulation part 13 (step S101).

  The state determination unit 16 acquires a second simulation result when the edge No. 1 is broken from the simulation unit 13 (step S102).

State determination unit 16, and _{P i} in the first simulation result, compared with the _{P i} in the second simulation result, identifies the nodes in excess of the threshold value deviations occur in _{P i} (step S103). The state determination unit 16 records the node number of the identified node (step S104).

  The state determination unit 16 determines whether or not a node in which a deviation in the pressure is greater than or equal to a threshold is specified when all edges constituting the transport network are broken (step S105). In the case where all the edges are broken, if the node in which the pressure exceeds the threshold value is not specified (No in step S105), the state determination unit 16 increments to the next edge (step S106), and the process is performed. The process proceeds to step S102. Here, since only the simulation is performed when the edge No: 1 is broken (No in step S105), the state determination unit 16 increments the edge No to 2 (step S106), and the edge No: 2 is broken. A second simulation result is obtained in the case of having been performed (step S102). The state determination unit 16 repeats the processing from step S102 to step S104 until edge number 16 is reached.

  When the node in which the pressure is more than the threshold value is identified until the edge No. 16 breaks (Yes in Step S105), the state determination unit 16 refers to the stored node and the edge No: The installation position of the sensor necessary for detecting breakage in 2 to 16 is specified, the specified installation position is notified to the user (step S107), and the process is terminated. In the transportation network shown in FIG. 9, if a pressure gauge is installed at node No: 13, it can be detected that a break has occurred at any of edges No: 2-16. Is possible.

  In this way, the state determination unit 16 can determine where to place a sensor for detecting a break that occurs at an edge in the transport network.

(Mode 3)
The state determination unit 16 acquires a simulation result when a predetermined edge is invalidated, and determines whether or not the pressure in the simulation result is zero or more. The state determination unit 16 performs this process for all single edges and a plurality of edges that constitute the transport network. The state determination unit 16 selects a network that minimizes the number of edges from the networks in which the pressure in the simulation result is zero or more, and notifies the user. In addition, the state determination unit 16 notifies the user of edges that are unnecessary in the network including the minimum necessary edges among the edges used in the current network.

  FIG. 11 is a flowchart showing the operation of the state determination unit 16 in mode 3.

  First, the state determination part 16 acquires the simulation result when edge No: 1 is invalidated from the simulation part 13 (step S111).

Subsequently, the state determination unit 16 determines whether or not Pi in the simulation result is greater than or _equal to zero (step S112). _{If P i} in the simulation result is zero or more (Yes in step S112), the state determination unit 16 records the graph structure at this time (step S113). If P _i in the simulation result is less than zero (No in step S112), the state determination unit 16, and the "impossible" as not meet demand as desired by each node in the network (step S114), processing The process proceeds to step S115. Here, the edge No: because you are disabled 1, the state determination unit 16 determines that P _i is less than zero, the edge No: 1 the setting of invalidating the "impossible".

  The state determination unit 16 determines whether or not it is assumed in step S115 that all edges constituting the transport network are invalidated singly and plurally (step S115). When it is not assumed that all the edges are invalidated alone or plurally (No in step S115), the state determination unit 16 invalidates different edges (step S116), and the process proceeds to step S111. . Here, since only the simulation when edge No: 1 is invalidated (No in step S115), edge No: 2 is invalidated instead of edge No: 1 (step S116), and edge No: 2 The simulation result is acquired when the is invalidated (step S111). The state determination unit 16 invalidates a plurality of edge Nos. 1 to 16 as in the case where the edge Nos. 1 to 16 are invalidated alone and the edge Nos. 2 and 3 and the edge Nos. In such a case, the processes in steps S111 to S114 are repeated.

  When it is assumed that all edges are invalidated alone or in plural (Yes in step S115), the state determination unit 16 determines that the number of edges constituting the transport network is the number of edges constituting the transport network in the graph structure recorded in step S112. A minimum required graph structure is selected, and the network about the selected graph structure is notified to the user (step S117). The state determination unit 16 notifies the user of the edge numbers that are unnecessary in the selected graph structure among the edge numbers: 1 to 16 (step S118).

  FIG. 12 is a diagram illustrating an example of a network selected by the state determination unit 16. At this time, the state determination unit 16 notifies the user of edge Nos. 6, 11 and 13 as unnecessary edges.

  As described above, the state determination unit 16 can configure a transport network for transporting fluid to these nodes with the minimum necessary edge while satisfying the demand amount of each assumed node.

  In the description of mode 3, a simulation is performed for a case where all edges are disabled individually and plurally, but the present invention is not limited to this. For example, when any of the edges is invalidated and there is a node that is not connected to any of the edges, the state determination unit 16 may not execute the simulation that invalidates the edge. This is because, when there is a node that is not connected to any edge, the connection determination unit 113 issues a warning.

(Mode 4)
The state determination unit 16 acquires a simulation result when a new node added at a desired position and an existing node are connected by a new edge, and determines whether or not the pressure in the simulation result is zero or more. to decide. The state determination unit 16 performs the above process as many times as the number of nodes and edges that can be connected to the newly added node. The state determination unit 16 selects a network that minimizes the number of edges from the networks in which the pressure in the simulation result is zero or more.

  FIG. 13 is a flowchart showing the operation of the state determination unit 16 in mode 4. FIG. 13 illustrates an example in which node No: 14 is newly added as illustrated in FIG.

  First, the state determination unit 16 acquires a simulation result when the node No: 10 and the node No: 14 are connected by the edge No: 17 from the simulation unit 13 (step S131).

Subsequently, the state determination unit 16 determines whether or not Pi in the simulation result is greater than or _equal to zero (step S132). _{If P i} in the simulation result is zero or more (Yes in step S132), the state determination unit 16 records the graph structure at that time (step S133). If P _i in the simulation result is less than zero (No in step S132), the state determination unit 16, and the "impossible" as not meet demand as desired by each node in the network (step S134), processing The process proceeds to step S135.

  In step S135, the state determination unit 16 determines whether all states that can be connected to the node No: 14 are assumed (step S135). When not all states that can be connected to the node No: 14 are assumed (No in Step S135), the state determination unit 16 assumes different connections (Step S136), and the process proceeds to Step S131. Here, since only the simulation in the case of connecting the node No: 14 and the node No: 10 by the edge No: 17 is performed (No in Step S135), the node No: 14 and the node No: 11 are set. Connection is performed using edge No. 18 (step S136), and a simulation result in this case is acquired (step S131). The state determination part 16 repeats the process of step S131-134, when node No: 14 and other nodes are connected individually and in multiple.

  When all the states that can be connected to the node No. 14 are assumed (Yes in Step S135), the state determination unit 16 has the smallest number of edges constituting the transportation network in the graph structure recorded in Step S132. Is selected, and the network about the selected graph structure is notified to the user (step S137).

  FIG. 14 is a diagram illustrating an example of a network in a case where the node No: 14 and the node No: 10, 11, 12 are connected by the edge No: 17, 18, 19, respectively.

  As described above, when a new node is added, the state determination unit 16 can determine an optimum configuration for connecting the added node and the existing node.

(Mode 5)
Assume that a new node is added at a desired position in the transportation network.

  The acquisition unit 14 designates a new node from the GUI information processing unit 11. The acquisition unit 14 acquires a detection result of a pressure detected by a sensor installed in a new node in response to designation from the GUI information processing unit 11.

  The state determination unit 16 acquires a simulation result when a new node is connected to any of the existing nodes. The state determination unit 16 determines whether or not the pressure at the new node included in the simulation result is substantially the same as the pressure acquired by the acquisition unit 14. The state determination unit 16 performs the above-described processing until the pressure at the new node included in the simulation result is substantially the same as the pressure acquired by the acquisition unit 14. The state determination unit 16 notifies the user of the connection when the pressure is substantially the same as the connection to the newly arranged node.

  FIG. 15 is a flowchart showing the operation of the state determination unit 16 in mode 5. FIG. 15 illustrates an example in which node No: 14 is newly added as illustrated in FIG. 14.

The acquisition unit 14 acquires, from the storage unit 15, the detection result _{PD 14} detected by the sensor installed at the node No: 14 in accordance with the designation from the GUI information processing unit 11. The state determination unit 16 receives the detection result _PD14 acquired by the acquisition unit 14 (step S151).

  The state determination unit 16 acquires a simulation result when the node No: 10 and the node No: 14 are connected by the edge No: 17 from the simulation unit 13 (step S152).

Subsequently, the state determination unit 16, _{P 14} in the simulation result to determine whether or not to match the detection result _{P D14} (step S153). If the P ₁₄ coincides with _{P D14} (step S153 of Yes), the state determination unit 16 is newly installed node No: 14 is determined to be connected with the simulation set node at step S152 Then, the determined transport network is notified to the user (step S154).

If the P ₁₄ does not match the _{P D14} (No in step S153), the state determination unit 16, the node No: Connection to 14 if not connected are set in the simulation, assuming different connection (step S155), The process proceeds to step S152. Here, since the simulation is performed when the node No: 14 and the node No: 10 are connected by the edge No: 17, the node No: 14 and the node No: 11 are connected by the edge No: 18. (Step S155), the simulation result in this case is acquired (step S152). State determining section _16, until _{P 14} matches the _{P D14,} repeats the processing of step S152.

  In this way, the state determination unit 16 compares the measurement result at the newly installed node with the simulation result including the new node, so that the new node is incorporated into the transport network. It is possible to determine whether or not

  As described above, in the graph structure construction device 40 according to the second embodiment, the state determination unit 16 can determine the five types of states of the transport network in modes 1 to 5.

  Therefore, according to the graph structure construction device 40 according to the second embodiment, even a person who is not an expert or the like can change the graph structure of the transport network. Further, according to the graph structure construction device 40, the state of the transport network is quantitatively evaluated.

(Third embodiment)
FIG. 16 is a block diagram illustrating a functional configuration of the graph structure construction device 50 according to the third embodiment. The graph structure construction device 50 illustrated in FIG. 16 includes an accuracy comparison unit 17, in addition to the GUI information processing unit 11, the simultaneous equation generation unit 12, and the simulation unit 13, which are functional configurations of the graph structure construction device 10 according to the first embodiment. A storage unit 18 and a water leakage detection unit 19 are provided. Assuming the transportation network shown in FIG. 3, a sensor for detecting pressure is installed in at least one of the nodes shown in FIG. 3, and a sensor for detecting flow rate is provided in at least one of the edges shown in FIG. is set up. The pressure or flow rate detected by the sensor is stored in the storage unit 18.

  The accuracy comparison unit 17 reads from the storage unit 18 a detection result by a sensor installed at a position specified by the GUI information processing unit 11. The accuracy comparison unit 17 compares the simulation result acquired by the simulation unit 13 and the detection result read from the storage unit 18 in real time with a preset period. The accuracy comparison unit 17 outputs the comparison result to the water leakage detection unit 19.

  The water leakage detection unit 19 is a loss detection unit that detects a loss of water generated at the edge based on the comparison result supplied from the accuracy comparison unit 17. In the present embodiment, water leakage at each edge is detected.

  FIG. 17 is a flowchart showing the operation of the graph structure construction device 50 according to the third embodiment.

  First, the accuracy comparison unit 17 reads detection information detected by a sensor installed at a position specified by the GUI information processing unit 11 from the storage unit 18 (step S171).

  The accuracy comparison unit 17 acquires a simulation result from the simulation unit 13 (step S172). The accuracy comparison unit 17 compares the simulation result with the detection information read from the storage unit 18 (step S173), and outputs the comparison result to the water leakage detection unit 19.

  The water leakage detection unit 19 detects the presence or absence of water leakage at the edge based on the comparison result (step S174).

  As described above, the graph structure construction device 50 according to the third embodiment creates a flow image in accordance with an instruction from the operation input unit 30, and performs a simulation on the created flow image. The graph structure construction device 50 detects water leakage at the edge by comparing the simulation result with the actual detection result by the sensor. Thereby, the graph structure construction device 50 can change the graph structure according to the flow image desired by the user, and can quickly detect the occurrence of an abnormality such as water leakage in the changed graph structure. Become.

  Therefore, according to the graph structure construction device 50 according to the third embodiment, even a person who is not an expert can change the graph structure of the transport network. Further, according to the graph structure construction device 50, the state of the transport network is quantitatively evaluated.

(Other embodiments)
In the first to third embodiments, the demand amount at each node has been described as being constant even after the time has elapsed, but the present invention is not limited to this. For example, the demand amount at each node may change over time. At this time, the graph structure construction device 10, 40, 50 according to the first to third embodiments further includes a receiving unit 110 as shown in FIG. Each node adds a time stamp to the demand amount, and transmits the demand amount to which the time stamp is added as a radio signal at a predetermined timing. Here, the predetermined timing can be set, for example, once a day at noon or every hour. If the demand amount is transmitted once a day at noon, the node collectively transmits the demand amount for one day.

  The receiving unit 110 receives a radio signal and acquires information about the demand amount. The receiving unit 110 refers to the time stamp and synchronizes the demand amount of each node. The receiving unit 110 stores information on the acquired demand amount in the GUI information processing unit 11.

  The user of the graph structure construction device 10, 40, 50 inputs the time at which the transport network is to be evaluated to the GUI.

  The flow image creation unit 111 reads the demand amount to which the time stamp corresponding to the input time is added from the storage unit 116, and creates a flow image including the read demand amount. The first file creation unit 112 creates a CSV file based on the flow image created by the flow image creation unit 111.

  Thereby, the graph structure construction apparatuses 10, 40, and 50 can evaluate the graph structure of the transport network at an arbitrary time.

  In addition, the graph structure construction device 40 according to the second exemplary embodiment determines the five types of states of the transport network in modes 1 to 5 when the demand amount at each node is constant regardless of the time. However, the present invention is not limited to this.

  For example, the graph structure construction device 40 may determine the five types of states of the transport network in the mode 1 to the mode 5 with respect to an arbitrary time section designated by the user. In addition, the graph structure construction device 40 may determine the five types of states of the transport network in modes 1 to 5 in consideration of all assumed time zones.

  Although several embodiments of the present invention have been described, these embodiments are presented by way of example and are not intended to limit the scope of the invention. These embodiments can be implemented in various other forms, and various omissions, replacements, and changes can be made without departing from the spirit of the invention. These embodiments and their modifications are included in the scope and gist of the invention, and are also included in the invention described in the claims and the equivalents thereof.

DESCRIPTION OF SYMBOLS 10, 40, 50 ... Graph structure construction apparatus, 11 ... GUI information processing part, 111 ... Flow image creation part, 112 ... 1st file creation part, 113 ... Simultaneous determination part, 114 ... Flow image reading part, 115 ... 1st 2. File creation unit, 116 ... storage unit, 12 ... simultaneous equation generation unit, 13 ... simulation unit, 14 ... acquisition unit, 15, 18 ... storage unit, 16 ... state determination unit, 17 ... accuracy comparison unit, 19 ... water leakage Detection unit, 110 ... reception unit, 20 ... display unit, 30 ... operation input unit

Claims (22)

A flow image of a transport network is displayed as a GUI (Graphical User Interface), a flow image is created based on information input to the GUI, and a graph structure including a plurality of nodes and a plurality of edges from the flow image A GUI information processing unit that creates structure information about the read graph structure;
Based on the structure information, an equation creating unit that creates a simultaneous equation capable of calculating a pressure at at least one of the plurality of nodes and a flow rate at at least one of the plurality of edges;
An apparatus for constructing a graph structure of a transport network, comprising: a simulation unit that solves the simultaneous equations and calculates the pressure and the flow rate.   The graph structure construction device according to claim 1, further comprising a state determination unit that refers to the simulation result and determines a state of the transport network. The equation creating unit is configured to calculate a first simultaneous equation capable of calculating pressures at the plurality of nodes and flow rates at the plurality of edges, and the plurality of the plurality of edges when one of the plurality of edges breaks. A second simultaneous equation capable of calculating the pressure at the node and the flow rate at the edge other than the broken edge,
The simulation unit solves the first simultaneous equation to create a first simulation result, solves the second simultaneous equation to create a second simulation result,
The said state determination part compares the said 1st simulation result and the said 2nd simulation result, and specifies the node which shows the predominance in the change of a pressure between the said 1st and 2nd simulation result. 2. The graph structure construction apparatus according to 2. The equation creating unit includes a first simultaneous equation capable of calculating pressures at the plurality of nodes and flow rates at the plurality of edges, and pressures at the plurality of nodes when the plurality of edges break one by one. And a plurality of second simultaneous equations capable of calculating a flow rate at an edge other than the broken edge,
The simulation unit calculates a first simulation result obtained by solving the first simultaneous equations and a plurality of second simulation results obtained by solving the plurality of second simultaneous equations;
The state determination unit compares the first simulation result and the plurality of second simulation results, respectively, and identifies a node that exhibits superiority in pressure change between the first and second simulation results. The graph structure construction device according to claim 2. The equation creating unit creates simultaneous equations in which at least one of the plurality of edges is invalidated,
The graph structure according to claim 2, wherein the state determination unit determines whether or not the pressure calculated by the simulation unit is equal to or greater than zero, and when the pressure is equal to or greater than zero, the invalid edge is not required. Construction device. The equation generator includes pressures at the plurality of nodes and at least one newly added node, flow rates at the plurality of edges and at least one new edge connecting the new node and the existing node, and Create simultaneous equations that can calculate
The state determination unit determines whether or not the pressure calculated by the simulation unit is equal to or greater than zero. When the pressure is equal to or greater than zero, the simulated configuration is a configuration including the new node. The graph structure construction device according to claim 2. The equation generator includes pressures at the plurality of nodes and at least one newly added node, flow rates at the plurality of edges and at least one new edge connecting the new node and the existing node, and Create simultaneous equations that can calculate
The state determination unit determines whether or not the pressure at the new node calculated by the simulation unit and the pressure detected at the new node are substantially the same. The graph structure construction device according to claim 2, wherein the simulated configuration includes the new node. An accuracy comparison unit that compares the flow rate calculated by the simulation unit with the flow rate detected at the edge;
The graph structure construction device according to claim 1, further comprising a loss detection unit that detects a loss at the edge with reference to the comparison result.   In the flow image created based on the input information, it is determined whether there is a node that is not connected to any edge. The graph structure construction device according to claim 1, further comprising a connection determination unit that determines that the occurrence has occurred. The amount of demand in the plurality of nodes changes with the passage of time,
A receiver that receives information about the demand from the plurality of nodes;
The GUI information processing unit receives time as the input information, creates the flow image including a demand amount at the input time, and calculates the demand amount from the created flow image in the graph structure. The graph structure construction device according to claim 1, which is read as: A graph structure construction device for constructing a graph structure composed of a plurality of nodes and a plurality of edges constituting a transportation network;
A sensor installed on at least one of the plurality of nodes and the plurality of edges,
The graph structure construction device includes:
A flow image of the transport network is displayed as a GUI (Graphical User Interface), a flow image is created based on information input to the GUI, the graph structure is read from the flow image, and the read graph A GUI information processing unit that creates structure information about the structure;
Based on the structure information, an equation creating unit that creates a simultaneous equation capable of calculating a pressure at at least one of the plurality of nodes and a flow rate at at least one of the plurality of edges;
A transport network graph structure construction system comprising a simulation unit that solves the simultaneous equations and calculates the pressure and the flow rate. Display the transport network flow image as GUI (Graphical User Interface),
Create a flow image based on information input to the GUI,
From the flow image, read the graph structure consisting of the plurality of nodes and the plurality of edges, create structure information about the read graph structure,
Based on the structure information, create a simultaneous equation capable of calculating the pressure at at least one of the plurality of nodes and the flow rate at at least one of the plurality of edges,
A transportation network graph structure construction method for solving the simultaneous equations and calculating the pressure and the flow rate. A graph structure construction program used in a graph structure construction device for constructing a graph structure composed of a plurality of nodes and a plurality of edges constituting a transport network,
Processing for displaying a flow image of the transport network as a GUI (Graphical User Interface);
A process of creating a flow image based on information input to the GUI;
A process of reading the graph structure from the flow image and creating structure information about the read graph structure;
Based on the structure information, a process for creating simultaneous equations capable of calculating a pressure at at least one of the plurality of nodes and a flow rate at at least one of the plurality of edges;
A transport network graph structure construction program for causing a computer of the graph structure construction device to execute processing for solving the simultaneous equations and calculating the pressure and the flow rate.   14. The program for building a graph structure according to claim 13, further causing the computer to execute a process of determining the state of the transport network with reference to the simulation result. The simultaneous equations include a first simultaneous equation capable of calculating pressures at the plurality of nodes and flow rates at the plurality of edges, and a plurality of the plurality of edges when one of the plurality of edges breaks. A second simultaneous equation capable of calculating a pressure at a node and a flow rate at an edge other than the broken edge;
The first simulation result obtained by solving the first simultaneous equations is compared with the second simulation result obtained by solving the second simultaneous equations, and the pressure change between the first and second simulation results is obtained. The graph structure construction program according to claim 13, further causing the computer to execute a process of specifying a node indicating superiority. The simultaneous equations include a first simultaneous equation capable of calculating pressures at the plurality of nodes and flow rates at the plurality of edges, and pressures at the plurality of nodes when the plurality of edges break one by one. A plurality of second simultaneous equations capable of calculating a flow rate at an edge other than the broken edge,
A first simulation result obtained by solving the first simultaneous equations and a plurality of second simulation results obtained by solving the plurality of second simultaneous equations are respectively compared, and the first and second simulation results are compared. 14. The program for constructing a graph structure according to claim 13, further causing the computer to execute a process of identifying a node that exhibits superiority in a change in pressure. The simultaneous equations are simultaneous equations in which at least one of the plurality of edges is invalid,
14. The graph structure construction according to claim 13, wherein it is determined whether or not the pressure in the simulation result is equal to or greater than zero, and when the pressure is equal to or greater than zero, the computer further executes a process that the invalid edge is unnecessary. program. The simultaneous equations include the pressures at the plurality of nodes and the newly added at least one node, and the flow rates at the plurality of edges and at least one new edge connecting the new node and the existing node. It is a simultaneous equation that can be calculated,
A determination is made as to whether or not the pressure in the simulation result is greater than or equal to zero, and if the pressure is greater than or equal to zero, the computer is further caused to execute a process in which the simulated configuration is a configuration including the new node. Item 14. The graph structure construction program according to Item 13. The simultaneous equations include the pressures at the plurality of nodes and the newly added at least one node, and the flow rates at the plurality of edges and at least one new edge connecting the new node and the existing node. It is a simultaneous equation that can be calculated,
It is determined whether or not the pressure at the new node in the simulation result is substantially the same as the pressure detected at the new node. If the pressure is approximately the same, the simulated configuration is 14. The program for constructing a graph structure according to claim 13, further causing the computer to execute a process that includes a simple node. A process of comparing the flow rate calculated by the simulation unit with the flow rate detected at the edge;
14. The program for building a graph structure according to claim 13, wherein the computer is further caused to execute processing for detecting a loss at the edge with reference to the comparison result.   In the flow image created based on the input information, it is determined whether there is a node that is not connected to any edge. The graph structure construction program according to any one of claims 13 to 20, further causing the computer to execute a process of determining that it has occurred. The amount of demand in the plurality of nodes changes with the passage of time,
Receiving information about the demand from the plurality of nodes;
A process of creating the flow image including a demand amount at a time input to the GUI;
The graph structure construction program according to any one of claims 13 and 20, further causing the computer to execute a process of reading the demand amount as the graph structure from the flow image.

Images