JPH07225788A - Network expressing method of piping system and searching method of piping carrier route - Google Patents

Abstract

PURPOSE:To facilitate the processing on a computer for searching an optimum route and to calculate the optimum route at a high speed. CONSTITUTION:These methods are a searching method of a piping carrier route for searching an optimum carrier route from plural piping systems between a carrier origin and a carrier destination by a computer when fluid is carried from the carrier origin to the carrier destination and a network expressing method for the search. The facilities (tank T1 and T2, a pump P1 and a flow meter F1) except valves and pipings of the system facilities composing a piping system is regarded as the node on a graph theory, valves V1, V2 and V3 and the pipings are regarded as the line connecting between nodes and a network expression is performed for an actual piping system for searching the carrier route.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a fluid transfer plant such as an oil refinery between a berth or tank from which a fluid such as oil is transferred and a tank or berth to which a fluid is transferred via a pipe. The present invention relates to an expression method for expressing an actual piping system in a network inside a computer when searching for a transfer path when performing delivery and acceptance work, and a search method for searching an optimum transfer path based on this network expression. .

[0002]

2. Description of the Related Art Conventionally, the problems to be solved by the invention
For example, when pumping the oil type A from a designated berth to a designated tank, there are generally various transport routes. At this time,
Which route is selected depends on conditions such as which oil type is present in the piping system at that time, and which piping system is used for another oil type B (constraint for not mixing different oils). (Conditions), the optimum transport route candidate is determined. However, when the transportation plant becomes large, it becomes difficult to check such constraints. It is generally said that a search time that is proportional to the power of the size of a plant is required to search all candidates for the transfer route.

Further, the input items of the computer necessary for determining the transfer route are different from those of the actual piping system which facilitates network expansion and search inside the computer. Therefore, it is necessary for a full-time operator who has knowledge about the correspondence relationship such as how to deploy the actual piping system to the network to input information such as the system equipment that constitutes the piping system into the computer. The input items in this case will be changed each time the actual piping system is changed (system equipment such as tanks and valves are added or deleted).

As an example, nodes a to
In the piping system having j and a valve, node fc
Consider a case where the oil type A flows between −g. When another oil type B is flown between the nodes a-b-d-h in this state, there is no valve between the nodes c-d.
It mixes with the oil type A between and causes so-called contamination.

Therefore, in the above case, it is possible to prevent mixing of the oil types A and B by adding a valve between the nodes cd, but in order to prevent mixing of the different oil types A and B in this way. Requires the operator to understand how the actual piping system is deployed inside the computer, and to understand under what conditions the mixing is performed by the node definition management. Also, this management is required every time the system equipment is changed.

Here, the change of the computer input item relating to the management information will be concretely described. Now, in the piping system shown on the left side of FIG. 9, nodes a, b, c, m,
It is assumed that x, y, z are grouped together and have a single management number N. In this state, the valve V is connected between the nodes b and m.
Considering the case where the piping system is changed by adding the above, in the conventional case, as shown on the right side of FIG. 9, for example, the nodes a, b, and c are grouped together and the conventional management number N is assigned. , A method of newly assigning another management number N'to the group consisting of nodes m, x, y, z.

As a result, a plurality of nodes which were managed by a single management number N and input to the computer before the valve V was added are newly managed by two management numbers N and N'and input. I have to do it.

Incidentally, as the prior art related to the present invention,
There is a piping route search device described in JP-A-2-287679. This piping route searching device stores an information about a piping route system diagram and an input means for instructing a starting point and an ending point of the piping route, and a first storing information about the piping route system diagram from the input means. A storage means, a second storage means for storing constraint information such as constraint conditions for searching a piping route, and a first storage when the starting point and the end point of the piping route are instructed from the input means. A piping route searching means for searching a piping route based on each information of the means and the second storing means, and a display means for displaying a search result by the piping route searching means.

However, in this conventional technique, the actual piping system of the plant is not developed in the computer from the beginning in a network form that makes it easy to search the transfer route, but the know-how for searching the piping route is revealed. In addition, various constraint conditions must be input to the computer, which is inefficient in carrying out the process of searching the transport route.

The present invention has been made in order to solve the above-mentioned various problems, and an object thereof is to provide an operator who does not have knowledge about the correspondence between the actual piping system and the network expansion in the computer. However, it is an object of the present invention to provide a network representation method of a piping system that enables easy input for a transportation route search and does not require management information change even when the actual piping system is changed. Another object of the present invention is to provide a method for searching a pipe transfer route that enables an optimum transfer route to be searched in a short calculation time based on a network representation of an actual pipe system.

[0011]

In order to achieve the above object, the first aspect of the present invention is to convey a plurality of fluids from a transfer source to a transfer destination, when a fluid is transferred from the transfer source to the transfer destination. In the method of searching for the optimal transport route from the pipe system by computer, in the pipeline transport route, all the facilities except the valve and the pipe that make up the pipe system are regarded as nodes in the graph theory, and the valve and the pipe are searched. The actual piping system is represented as a network for the purpose of searching the transportation route by regarding it as a line connecting the nodes.

A second invention is the same as the first invention,
When a plurality of pipes having no valves are connected via a node, a group of these pipes and nodes is regarded as one special node and is expressed as a network.

According to the first and second aspects of the present invention, the number of nodes can be reduced as compared with the conventional case, and the calculation time for searching the transport route can be shortened. In the second invention,
Since a plurality of nodes and lines are represented as special nodes, it facilitates a quick search of a transport path that does not mix different fluids.

A third aspect of the present invention is based on a source, a destination and a transport time when a computer searches for an optimal transport route for an actual piping system represented by a network according to the first or second aspect. If a candidate for a transport route is generated as a search tree, the route obtained as a solution by the search in this search tree is retained, and if a node of interest when searching for another transport route exists in the route, The search after the node is stopped, and the route after the node in the route is added to make a solution of a new transport route. As a result, a known solution can be used when searching for a new transport route, and an optimal transport route can be searched for at high speed without causing the inconvenience that the operator is confused about the selection of the transport route.

[0015]

Embodiments of the present invention will be described below with reference to the drawings. First, the embodiment of the first invention will be described. In this embodiment, in representing a network of an actual piping system, a berth, a tank, a flow meter, a pump, and a pipe intersection, which are system facilities, are connected to a node (network) on a graph theory. It is considered as a type of line (a line connecting nodes) attached to the pipe to which the valve is connected, without considering the valve as a node. The branch is considered as a pipe with or without a valve and considered as a line, and the actual piping system of the plant is represented by a network inside the computer.

In the graph theory known as a network representation method, the calculation efficiency at the time of searching a transport route greatly differs depending on how nodes and lines are assigned to the constituent equipment of the actual piping system. Conventionally, piping is a line, and other berths, tanks, valves, flow meters, pumps, pipe intersections, etc. are nodes, but in the present invention, all system equipment except pipes and valves are nodes, and piping and A network is created by using valves as lines connecting nodes.

For example, as shown in FIG. 2, the tank T1,
In the case of an actual piping system in which the valve V1, the pump P1, the valve V2, the flow meter F1 and the valve V3 are sequentially connected by piping between T2, the tanks T1 and T
2. The pump P1 and the flow meter F1 are regarded as nodes, and the valves V1, V2, V3 are regarded as lines considering the auxiliary equipment of the piping, so that the network expansion as shown in FIG. 1 is performed. In addition, in FIG. 1, a circle indicates a node. That is, in the present embodiment, the pipe and the valve are regarded as a line, so that the number of nodes corresponding to the number of valves is reduced as compared with the conventional case. Therefore, it is possible to speed up the calculation process during the route search.

Next, an embodiment of the second invention will be described. This embodiment relates to a network expression for carrying management so that different kinds of fluids such as oil types A and B are not mixed. That is, when the system equipment is expressed as a node or a line according to the first invention, for example, when two nodes y and z are connected by a pipe without a valve (this is referred to as a connection line), this relationship is represented by y.
When described as ~ z, even if a plurality of nodes connected via a connecting line are replaced with a single node (this node is called a special node), they can be considered to have the same value in route search.

For example, in the case of the network representation shown on the left side of FIG. 3, since all the nodes b to l are connected via connecting lines, all of these nodes are shown on the right side of FIG. a single special node s containing b to l
Can be replaced with Therefore, the number of nodes can be significantly reduced, and the speed of calculation processing at the time of route search can be increased.

Also, as shown on the left side of FIG.
When the oil type A is oiled through the -hcd-i-n route, it is considered that another oil type B is oiled through the node a-b-e-j-o route. According to the network representation on the right side of FIG. 3 according to this embodiment, the oil type A is already passing through the special node s, and when the oil type B is passed through in this state, both are mixed at the special node s. Therefore, it can be determined that the oil type B cannot pass from the node a to the node o. That is, the nodes ab-e
Even if the -j-o route is not followed in order, the oil passage of the oil type A includes only the special node s. It is judged to be impossible.

Further, in the above example, the nodes ab-e
A valve may be added between the nodes d and e in order to pass the oil type B through the route of -j-o, but conventionally, by adding this valve, the valves are connected to the nodes c, d, h, and i. Different management numbers must be given on the nodes b, e, f, g, j, k, and 1 side. However, in this embodiment, by adding the valve V in the special node s as shown in FIG. 4, what is represented by one special node s until then, two special nodes s are separated by the valve V. _Although represented by ₁ and s ₂ , it is only necessary to automatically register the special nodes s ₁ and s ₂ that were previously registered as the special nodes s, respectively, and change the management number. No work is required.

Note that, in FIG. 5, when there are a plurality of pipes between the valves as shown in FIG. 8 and the pipes intersect with each other, the concept of the above-mentioned special node is introduced to make the network. 3 is a flowchart showing a process of abstracting the. In FIG. 5, first, all pipes without valves are targeted (S1). Here, the pipe without the valve means, for example, the pipe between the nodes c and h in FIG.
Piping between d, piping between d and e, and so on.

For all of these pipes, node determinations at both ends are performed. Specifically, if both nodes do not belong to any group, a new group (special node) is created using both nodes and piping as elements of the group (S11). If only one node belongs to a certain group, the one node and the pipe are added to the group as elements (S12). If both nodes belong to a certain group, only the pipe between both nodes is added to the group as an element (S1).
3). If both nodes belong to different groups, these two groups are connected and the pipe between both nodes is added as an element to the group after connection (S14).

In this way, connecting lines are generated between nodes for all groups and each attribute is calculated (S
2). After that, all groups are deleted (S3).

According to this embodiment, the nodes are classified so as to form a group consisting of nodes having different connecting lines, and special nodes are assigned to each group consisting of a plurality of nodes for management. Since it is possible to save the time and effort for the route search for the nodes included in, the overall route search that does not mix the oil species can be efficiently performed in a short time.

Next, an embodiment of the third invention will be described. This embodiment relates to a method for searching an actual transport route based on a piping system network-represented by the above embodiments. That is, in this embodiment, when all the routes capable of transporting a certain oil type are taken out, the number of searches is reduced by deriving the next transport route using the information of the transport route that is derived as a result of the successive searches. By doing so, the calculation time for route search can be shortened.

The outline of this search method will be described below. Step 1 First, a start point node and an end point node are determined. And
The number of elements in the set z of search route sequences and the set x of transport route sequences from the start point node to the end point node are each set to 0.
Here, the search route sequence is a set of search routes from a certain node to a certain node, and the transport route sequence is a set of transport routes from a start point node to an end node. Step 2 The lines (l1, l2, ...
,, ln) search path sequence (s, l1), (s, l)
2), ..., (s, ln) are generated, and these are set as elements of the set z of search path sequences.

Step 3 As j ← l1, the nodes (j1, j
2, ... ......, jmj), search path sequence (s, j, j
1), ..., (s, j, jmj) are generated and used as the elements of the set z of the search route sequence. Step 4 If any of the nodes (j1, j2, ..., Jmj) is the end point node, the sequence is set to a set x of transport route sequences.
And delete that sequence from the search route.

Step 5 Of the nodes (j1, j2, ..., Jmj), if there is a node that does not have the next connection, that sequence is deleted from the search path. Step 6 For the first route string remaining in the set z of search routes in the search route sequence generated in Step 3, the operations of Steps 3 to 5 are performed for the last node.

Step 7 By repeating the operation of step 6 for all the elements of the set z of search path strings, the number of elements of the set z of search path strings is increased. Furthermore, there may be an element in the set x of the transport path sequence. If the last node A is already in the series of elements of the set x of the transport route sequence, the operation of step 6 is not performed, and the series following A from the series already existing in the set x. Is added to create a new series, which is an element of the set x.

This embodiment will be described below with reference to specific examples. For example, in the network development diagram of FIG. 6, the start point node (transportation source) is T1, and the end point node (transportation destination) is B4.
7 and a certain transport time is set, FIG. 7 shows the result of deriving all the search trees based on FIG. First, since the line extending from T1 is only V1, T1-V1 is obtained as the search route. Next, since the destination of V1 is only C1, T1-V1-
C1 and search route increase. Since there are V2, V3, V4, and V10 on the line extending from C1, a search tree that summarizes the generated routes is created as shown in FIG.

Of the routes in this search tree diagram, T1-V1-C
By focusing on 1-V2 and searching for the connection of V2, routes 11 and 12 following route 1 are obtained as the transport route from T1 to B4 as shown in FIG. The transport route thus obtained is used to derive the next transport route.

For example, similar to the generation of the route 1 consisting of V2-P1-V5-C6, the route 2 is V3-P2-.
V6-C6 can be obtained. At this time, it is already known that the routes 11 and 12 extend from C6 as the transport route, so the search after C6 is stopped and the route 1
By adding routes after C6 based on the information about 1 and route 12, a new transport route (route 21, route 22) to B4 is generated and registered as an element of a set of transport route strings. In this way, instead of the process of performing the route search of the search tree and the process of deriving the search sequence, a new transport route is searched for by using the process of checking the nodes and the elements constituting the line of the transport route generated in the past. Derive.

In FIG. 6, route 3 is V4-P.
It is composed of 3-V7-C6, and new routes (route 31, route 32) can be generated by adding route 11 and route 12 without searching after C6. Also, V14-P extending from C2
Also for route 4 of 4-V16-C7, route 11,
Route 41, route 4 in the same procedure as for route 12
2 can be obtained, and V15-P5-that extends from C2
For Route 5 of V17-C7, Route 4 after C7
The route 51 and the route 52 can be obtained by adding the route 1 and the route 42.

According to this embodiment, since a new transport route is generated by using the route after a certain node in the transport route which has already been obtained, when the end point node is the same, another transport including the above-mentioned node is carried out. The amount of calculation when calculating the route is reduced, and the search efficiency can be improved.

[0036]

As described above, according to the first or second aspect of the present invention, it is possible to obtain a network representation in which the number of valves is smaller than in the actual piping system, and to speed up the transfer route search processing. You can Further, in the second invention, since the nodes connected by the connecting line are managed as if they were special nodes, it is more efficient under the constraint condition that different kinds of fluids are not mixed as compared with the case of searching individual nodes. The route can be searched, and the work of reassigning the management number is not necessary even when the system equipment is changed. According to the third aspect of the present invention, the process of searching all the transport routes is reduced, and the calculation time for searching can be shortened.

[Brief description of drawings]

FIG. 1 is a network representation diagram of an actual piping system according to an embodiment of the first invention.

FIG. 2 is an explanatory diagram of an actual piping system to which the embodiment of the first invention is applied.

FIG. 3 is an explanatory diagram of a network representation according to an embodiment of the second invention.

FIG. 4 is a network representation diagram before and after adding a valve according to an embodiment of the second invention.

FIG. 5 is a flowchart showing a network abstraction process according to an example of the second invention.

FIG. 6 is a network representation diagram to which an embodiment of the third invention is applied.

FIG. 7 is an explanatory diagram of a search tree according to an embodiment of the third invention.

FIG. 8 is a piping system diagram for explaining a conventional technique.

FIG. 9 is a piping system diagram for explaining a conventional technique.

[Explanation of symbols]

T1, T2 tank V, V1, V2, V3 valves P1 pump F1 flowmeter to Q, X to Z nodes s, s _1, s ₂ special node

Front page continuation (72) Inventor Mitsuo Kawashima 1 Fuji-cho, Hino-shi, Tokyo Inside Fujifacom Control Co., Ltd. (72) Inventor Kokubun Chengdo 1-Fujimachi, Hino-shi, Tokyo Inside Fujifacom System Co., Ltd.

Claims (3)

[Claims] 1. A method for searching a pipe transfer route for searching an optimum transfer route from a plurality of pipe systems between a transfer source and a transfer destination by a computer when transferring a fluid from the transfer source to the transfer destination, All equipment except valves and piping in the piping system is regarded as nodes on the graph theory, and valves and piping are regarded as lines connecting the nodes, and the actual piping system is networked to search the transfer route. A method for expressing a network of a piping system characterized by expressing. 2. The method for representing a network of a piping system according to claim 1, wherein when a plurality of pipes having no valve are connected through a node, a group consisting of these pipes and nodes is defined as one special node. A method for representing a network of a piping system, which is characterized by expressing it as a network. 3. When a computer searches for an optimal transfer route for an actual piping system represented by a network according to the method of claim 1 or 2, the transfer route is determined based on the transfer source, transfer destination, and transfer time. The candidate is generated as a search tree, the route obtained as a solution by the search in this search tree is retained, and if a node of interest when searching for another transport route is present in the route, the node and subsequent nodes are searched. The method for searching a pipe transport route is characterized by stopping the search of, and adding routes after the node in the route as a solution of a new transport route.