Evaluation device, evaluation method, and program
The evaluation device uses a ZDD to efficiently calculate sufficiency rates in supply networks by enumerating link combinations and incorporating failure probabilities, addressing the challenge of exponential patterns and constraints in existing methods.
Patent Information
- Application Number
- JP2021156459
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Filing Date
- 2021-09-27
- Publication Date
- 2024-11-12
- Estimated Expiration
- 2041-09-27
AI Technical Summary
Existing methods struggle to calculate the demand sufficiency rate in supply networks like electric power distribution and water pipe networks within a practical time frame due to the exponential increase in failure patterns and the number of supply methods that satisfy constraints, making it impossible to explicitly compute each pattern individually.
An evaluation device utilizing a zero-suppressed binary decision graph (ZDD) to efficiently calculate the sufficiency rate by enumerating and evaluating combinations of links and nodes, incorporating failure probabilities to determine the availability of supply networks.
Enables the calculation of sufficiency rates in large networks within a realistic time frame using existing computers, allowing for multi-valued reliability evaluations and identifying which nodes can be supplied.
Smart Images

Figure 0007580725000001 
Figure 0007580725000002 
Figure 0007580725000003
Abstract
Description
[Technical field]
[0001] The present disclosure relates to an evaluation device, an evaluation method, and a program. [Background technology]
[0002] In a supply network such as an electric power distribution network or a water pipe network, under normal circumstances, the supply source (substation or water purification plant) is connected to all the demand destinations (households and businesses) without interruption along the way. In the event of a fault such as a broken electric wire or a broken water pipe, if the fault cannot be repaired immediately, the operator is required to change the supply route to bypass the fault and meet as much demand as possible. How much demand can be met depends on the fault location and the nature of the detour. For example, if many demanders have only one route to the supply destination with the constructed facilities, it is expected that the demand will not be met very much no matter how the facility configuration is changed. Therefore, it is necessary to evaluate the fulfillment rate, which indicates how much demand the currently constructed facilities are expected to meet in the event of a fault. If such expected fulfillment rate of demand (how much demand can be met) is used in urban planning, etc., it is possible to meet as much demand as possible when a fault occurs by expanding or renovating facilities to increase the fulfillment rate from normal times.
[0003] Generally, supply networks such as an electric power distribution network or a water pipe network can be expressed as an abstract network (graph) consisting of lines (links) connecting a plurality of points (nodes). For example, when the supply network in the real world is an electric power distribution network, the nodes can correspond to switches (and consumers) in the electric power distribution network, and the links can correspond to electric wires. When the supply network in the real world is a water pipe network, the nodes can correspond to branching points of water pipes, and the links can correspond to water pipes. In this case, consumers can be regarded as the weight (importance) of the nodes or the weight (importance) of the links.
[0004] In addition, the supply method is generally restricted for each facility such as an electric power distribution network or a water pipe network, and any connection method from the supply source is not permitted. For example, in the case of an electric power distribution network, a supply method that does not include a loop in which the power supplied from a substation returns to the original substation is usually implemented (in other words, it is a forest with the supply source as its root).
[0005] Therefore, using an abstract network in which each node or link has a demander, and assuming that link failures occur with a certain probability, it is necessary to calculate the fulfillment rate when an effort is made to satisfy as much demand as possible while observing the constraints that must be satisfied.
[0006] Specifically, the fulfillment rate can be calculated by considering the following four factors: (1) The computational abstract network corresponds to the supply network, which is the entire real-world facility. (2) The method of selecting a partial network within an abstract network that satisfies the constraints corresponds to a supply method that satisfies the constraints. (3) The calculated failure probability of each link corresponds to the probability of an electric wire being cut or a water pipe being broken in the real world. Note that the failure probability is independent for each electric wire and each water pipe. (4) The node weight or link weight corresponds to the magnitude of demand.
[0007] As a method for evaluating the fulfillment rate, it is possible to use a data structure called a binary decision diagram (BDD) or a zero-suppressed binary decision diagram (ZDD) (described later) (Non-Patent Documents 1 and 2). [Prior art documents] [Non-patent literature]
[0008] [Non-Patent Document 1] Hiroshi Imai: "Quantitative evaluation method of network system reliability: Calculation method of reliability of connectivity maintenance against branch failure", Operations Research: Science of Management, Jul, 48-7, pp 467 - 471, Operations Research Society of Japan, 2003 [Non-Patent Document 2] Masaaki Nishino, Takeshi Inoue, Yoshihito Yasuda, Shinichi Minato, Masaaki Nagata, "Network Reliability Optimization Using Binary Decision Diagrams", NTT Technical Journal, Sep., 2018. Summary of the Invention [Problem to be solved by the invention]
[0009] However, failures can occur simultaneously at multiple locations, and the number of failure patterns grows exponentially with the number of links in the abstract network. Furthermore, there are an exponential number of all supply methods that satisfy the constraints, so explicitly calculating them individually is not possible within a practical time frame using existing computers.
[0010] The present invention has been made in consideration of the above-mentioned points, and has an object to calculate the fulfillment rate of demand in a realistic time even if an existing computer is used. [Means for solving the problem]
[0011] The invention according to claim 1 is an evaluation device for evaluating availability of a supply network for supplying resources from a supply source to a supply destination via a predetermined route, the evaluation device including: a zero-suppressed binary decision diagram in which the supply source is a root node, the supply destination is a predetermined node, and the predetermined route is a predetermined link; a specified covering number enumeration means for calculating second information representing a zero-suppressed binary decision diagram expressing a selection of all links such that a predetermined number of nodes are connected to the root node, based on first information representing a zero-suppressed binary decision diagram expressing all combinations that satisfy a constraint condition in the zero-suppressed binary decision diagram and supply network information representing the contents of the supply network that satisfy the constraint condition, and for calculating third information representing a zero-suppressed binary decision diagram expressing a joint set of the first information and the second information; and a specified covering number enumeration means for calculating third information representing a zero-suppressed binary decision diagram expressing a joint set of the first information and the second information, based on the third information. a specified covering inclusion enumeration means for calculating, for each combination, fourth information indicating a zero-suppressed binary decision diagram expressing a combination in which all links not included in the combination are set to be arbitrary; a probability calculation means for calculating, based on the fourth information and the failure probability of the predetermined link, the probability that there is at least one path from the root node in the zero-suppressed binary decision diagram related to the fourth information to the predetermined node related to the supply destination; and a fulfillment rate calculation means for calculating a fulfillment rate of demand in the supply network using the third information, the fourth information, and information indicating the probability for a fulfillment number ranging from 1 to the total number of nodes. The evaluation device is characterized by: Effect of the Invention
[0012] As described above, according to the present invention, a data structure that compactly represents an enormous number of failure patterns is used to calculate a fulfillment rate without performing explicit calculations for each failure pattern. Therefore, even if an existing computer is used, it becomes possible to calculate a fulfillment rate for a large network in a realistic amount of time. [Brief description of the drawings]
[0013] [Figure 1] FIG. 2 is a diagram illustrating an electrical hardware configuration of the evaluation device according to the present embodiment. [Diagram 2] FIG. 2 is a functional block diagram of the evaluation device. [Diagram 3] FIG. 13 is a conceptual diagram showing data on link failure probabilities. [Figure 4] FIG. 1 illustrates a process for calculating demand fulfillment rate in a real-world supply network. [Diagram 5] FIG. 1 shows pseudo code. [Figure 6] FIG. 1 illustrates an abstract network that represents a real-world supply network with nodes and links. [Figure 7] FIG. 1 shows an abstract network represented by nodes and links as they would be used in actual operations in a real-world supply network. [Figure 8] FIG. 13 is a diagram showing practical combinations indicating whether or not a link can be used. [Figure 9] FIG. 8 is a diagram illustrating the operation state shown in FIG. 7 using a zero-suppressed binary decision diagram. [Figure 10] FIG. 10 is a diagram showing a specific path in the zero-suppressed binary decision diagram of FIG. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0014] Hereinafter, an embodiment of the present invention will be described with reference to the drawings.
[0015] [Overview of the embodiment] First, an overview of the evaluation device of this embodiment will be described.
[0016] The evaluation device 5 of this embodiment evaluates the availability of real-world supply networks such as an electric power distribution network and a water pipe network. An electric power distribution network is a supply network for supplying electric power from a supply source such as a substation to each supply destination such as a home via electric wires. A water pipe network is a supply network for supplying water from a supply source such as a water purification plant to each supply destination such as a home via a water pipe network.
[0017] In particular, the evaluation device 5 of this embodiment uses a zero-suppressed binary decision diagram (hereinafter referred to as "ZDD") to evaluate the availability of a supply network that is capable of supplying power within the range connected to the supply source even in the event of a fault such as a cut electric wire or a broken water pipe.
[0018] [Hardware configuration of evaluation device] Next, the electrical hardware configuration of the evaluation device 5 will be described with reference to Fig. 1. Fig. 1 is a diagram showing the electrical hardware configuration of the evaluation device of this embodiment.
[0019] The evaluation device 5 is a PC (personal computer) and, as shown in FIG. 1, is equipped with a CPU (Central Processing Unit) 501, a ROM (Read Only Memory) 502, a RAM (Random Access Memory) 503, an SSD (Solid State Drive) 504, a display 505, a keyboard 506, an external device I / F 507, a network I / F 508, a media I / F 509, and a bus line 510.
[0020] Of these, the CPU 501 controls the overall operation of the evaluation device 5. The ROM 502 stores programs, such as an IPL (Initial Program Loader), used to drive the CPU 501. The RAM 503 is used as a work area for the CPU 501.
[0021] The SSD 504 is a storage device that reads and writes various data such as programs of the evaluation device 5 under the control of the CPU 501. Note that instead of an SSD, a storage device such as an HDD (Hard Disk Drive) may also be used.
[0022] The display 505 is a type of display means such as a liquid crystal or an organic EL (Electro Luminescence) display that displays characters, images, and the like.
[0023] The keyboard 506 is a type of input means equipped with a plurality of keys for inputting characters, numbers, various instructions, and the like.
[0024] The external device I / F 507 is an interface for connecting various external devices. In this case, the external devices are an external display as an example of a display means, a mouse as an example of an input means, an external keyboard or microphone, a printer or a speaker as an example of an output means, a USB (Universal Serial Bus) memory as an example of a storage means, etc.
[0025] The network I / F 508 is a circuit for transmitting and receiving data to and from other evaluation devices via the Internet.
[0026] The media I / F 509 controls reading and writing (storing) of data from and to a recording medium 509m such as a flash memory. The recording medium 509m includes a DVD (Digital Versatile Disc) and a Blu-ray Disc (registered trademark).
[0027] The bus line 510 is an address bus, a data bus, or the like for electrically connecting the various components such as the CPU 501 shown in FIG.
[0028] [Functional configuration of evaluation device] Next, the functional configuration of the evaluation device 5 will be described with reference to Figures 2 and 3. Figure 2 is a functional block diagram of the evaluation device. As shown in Figure 2, the evaluation device 5 has a fulfillment rate calculation unit 50, a designated covering number enumeration unit 51, a designated covering inclusion enumeration unit 52, and a probability calculation unit 53. Each of these units is a function realized by an instruction from the CPU 501 in Figure 1 based on a program.
[0029] Among these, the fulfillment rate calculation unit 50 plays a role of a large loop process as a whole, sending the number of nodes n (n: integer) from the supply source to the supply destination to the specified coverage number enumeration unit 51, the specified coverage inclusion enumeration unit 52, and the probability calculation unit 53, and receiving each processing result from the specified coverage number enumeration unit 51, the specified coverage inclusion enumeration unit 52, and the probability calculation unit 53. That is, the fulfillment rate calculation unit 50 performs processing of a main routine, and the specified coverage number enumeration unit 51, the specified coverage inclusion enumeration unit 52, and the probability calculation unit 53 perform processing of a subroutine. For example, the fulfillment rate calculation unit 50 calculates the fulfillment rate of demand in the supply network using the probability calculated by the probability calculation unit 53 for the fulfillment number from 1 to the total number of nodes indicated by ZDD0.
[0030] The specified covering number enumeration unit 51 acquires, as input data from the outside, information indicating a specific supply network (hereinafter referred to as "NW") to be evaluated, and ZDD0, which is the first zero-suppressed binary decision diagram, and further acquires the number of nodes n from the fulfillment rate calculation unit 50. The information indicating the specific supply network (hereinafter referred to as "NW") includes information specifying each node in the NW and information specifying links connecting each node. This information specifying each node also includes supply source node identification information specifying a supply source node. For example, the information indicating the NW is represented by a square matrix of the number of nodes by an adjacency matrix, and connected nodes are represented by "1" and unconnected nodes are represented by "0". Furthermore, the information indicating the NW also includes supply source node identification information for identifying a supply source node.
[0031] Furthermore, the specified coverage number enumeration unit 51 constructs and outputs ZDD_F(n) which enumerates all "combinations that satisfy the constraints and include exactly n nodes in the network" based on the acquired data. Here, the integer n corresponds to the number of nodes that can be satisfied. For example, if the supply network is a power distribution network, it includes partial routes that are not used as a power distribution network under normal circumstances but are used as detours when power lines are cut, and the constraints indicate information for excluding such partial routes from the enumeration targets.
[0032] The specified coverage inclusion enumeration unit 52 constructs ZDD_G(n) as a ZDD that expresses all combinations of items (network links) not included in each combination in ZDD_F(n) as arbitrary combinations, that is, all combinations that may or may not be present, based on the number of nodes n obtained from the fulfillment rate calculation unit 50 and ZDD_F(n) obtained from the specified coverage number enumeration unit 51. When viewed from the original network, this corresponds to enumerating all configurations that can be supplied to at least n supply destinations.
[0033] The probability calculation unit 53 calculates the probability p(n) that there is at least one path from the root node in ZDD_G(n) to a terminal node that is true (existent) based on the number of nodes n obtained from the fulfillment rate calculation unit 50, ZDD_G(n) obtained from the specified cover inclusion enumeration unit 52, and information indicating the link failure probability for each item (network link) obtained as input data from the outside. This means whether at least one combination in ZDD_G(n) is established, and corresponds to calculating the probability that there is a method that satisfies n or more demand points under the constraint conditions input to the entire evaluation device 5. FIG. 3 is a conceptual diagram of data indicating link failure probability. Here, the failure probability (%) is shown for each link.
[0034] ZDD_G(n) itself can use a conventionally known method. Specifically, the probability calculation unit 53 can calculate the value corresponding to the terminal node of existence (true) by initializing it to 1, and updating the value of the node itself from the values corresponding to two child nodes in order from the bottom toward the root node by dynamic programming. A specific example is the method disclosed in Reference 1.
[0035] Reference 1: https: / / github.com / takemaru / graphillion / wiki / Example-codes Section on network reliability (retrieved March 28, 2021) [Processing or Operation of the Embodiment] Next, the processing or operation of this embodiment will be described with reference to FIGS.
[0036] <Evaluation method> First, the evaluation method executed by the evaluation device 5 will be described with reference to Figures 4 and 5. Figure 4 is a diagram showing a process for calculating the fulfillment rate of demand in a supply network in the real world.
[0037] As shown in FIG. 4, first, the specified coverage number enumeration unit 51 acquires, as external data, information on the NW (including source node identification information for identifying a source node) and first information indicating ZDD0 expressing all combinations that satisfy the constraint conditions, and also acquires the number of nodes n from the fulfillment rate calculation unit 50, and based on these, constructs ZDD_K expressing the selection of all links such that a predetermined number of nodes n are connected to the root node (S11). The information indicating ZDD_K is the second information. More specifically, the specified coverage number enumeration unit 51 constructs ZDD_K(n) as a ZDD that includes one or more source nodes (if there is only one source node, the node is always included) and expresses the selection of all links such that n nodes are connected to any of the source nodes. This can be done using an existing method. For example, it can be constructed using a method called the "frontier method" that is widely known to those skilled in the art.
[0038] Furthermore, the specified covering number enumeration unit 51 calculates ZDD_F(n) as a ZDD that represents the intersection of the first information indicating ZDD0 and the second information indicating ZDD_K(n) (S12). The information indicating ZDD_F(n) is the third information. The specified covering number enumeration unit 51 then outputs the third information indicating ZDD_F(n) to the fulfillment rate calculation unit 50 and the specified covering inclusion enumeration unit 52. The calculation of the intersection is a function that ZDD has as a standard operation.
[0039] In this embodiment, for simplicity, all nodes are described as having a weight of 1 (each with a demand of 1), but the node weights can be integer values, or the weights of links instead of nodes can be handled with similar modifications (which can be handled by those skilled in the art). However, if the weights are floating-point numbers, some kind of discretization (for example, multiplying the whole by 10,000 and ignoring the decimal points) is necessary. In that case, the value output from the evaluation device 5 ignores the decimal points, so a strict expected fulfillment rate cannot be calculated.
[0040] Next, the specified coverage inclusion enumeration unit 52 constructs a ZDD (representing a power set) in which all links in the NW are arbitrary based on the number of nodes n obtained from the fulfillment rate calculation unit 50 (S13). This is called ZDD_P.
[0041] Furthermore, the specified cover inclusion enumeration unit 52 calculates ZDD_P.Restrict(ZDD_F(n)) using the "Restrict operation" provided as a standard operation of ZDD for the third information indicating ZDD_F(n) (S14). The specified cover inclusion enumeration unit 52 then sets the result of this step S14 as ZDD_G(n) and outputs fourth information indicating this ZDD_G(n) to the fulfillment rate calculation unit 50 and the probability calculation unit 53. Note that F.Restrict(G) is an operation that finds all combinations that are composed only of terms that include at least one combination in G, among the combinations included in F.
[0042] Next, the probability calculation unit 53 calculates the probability that there is at least one path from the root node in ZDD_G(n) to a terminal node that is present (true) based on the number of nodes n obtained from the fulfillment rate calculation unit 50, the fourth information indicating ZDD_G(n) obtained from the specified cover inclusion enumeration unit 52, and information indicating the failure probability for each item (network link) obtained as input data from outside (S15).
[0043] Next, the fulfillment rate calculation unit 50 uses the processing results of the specified coverage number enumeration unit 51, the specified coverage inclusion enumeration unit 52, and the probability calculation unit 53 to determine the "probability of being able to supply more than each value" p(n) for the fulfillment number 1 to the total node number N (total number of nodes in the NW), and uses these to calculate the fulfillment rate (S16).
[0044] Here, the process of step S16 will be described in more detail with reference to Fig. 5. Fig. 5 is a diagram showing pseudo code. In Fig. 5, the dashed arrows indicate inputs.
[0045] Here, as indicated by the dashed arrow, the fulfillment rate calculation unit 50 inputs 0 to C, 1 to N to for n, the processing result of the specified covering number enumeration unit 51 to ZDD_F(n), the processing result of the specified covering inclusion enumeration unit 52 to ZDD_G(n), and the processing result of the probability calculation unit 53 to p(n). The fulfillment rate calculation unit 50 thus calculates the fulfillment rate (S16).
[0046] <Example> Next, a specific example of the evaluation method will be described with reference to FIGS.
[0047] Fig. 6 is a diagram showing an abstract network of a real-world supply network using nodes and links. Fig. 7 is a diagram showing an abstract network of a real-world supply network using nodes and links in the case of actual operation.
[0048] In Figure 6, there are 16 potential combinations of link availability (2 4That is, there are two possible cases for the four links: the link is connected or disconnected.
[0049] However, in reality, for example, electricity does not return to the substation via each power line, so no loop occurs as shown in Figure 7. Therefore, there are 11 realistic combinations that indicate whether or not a link can be used, as shown in Figure 8.
[0050] FIG. 8 is a diagram showing realistic combinations indicating whether or not links can be used. In FIG. 8, for example, the first pattern 1 shows a case where all links A, B, C, and D are used. The last pattern 11 shows a case where none of the links are used. If the case of this pattern 11 is explained in terms of actual power supply, it corresponds to a case where power is not supplied from a substation in a certain area of Tokyo (node 1) to (households in) Kasumigaseki (node 2), (households in) Akasaka (node 4), or (households in) Roppongi (node 3), but is supplied only within the area where the substation is installed. Note that Kasumigaseki, Akasaka, and Roppongi are all names of areas in Tokyo.
[0051] In contrast to this, in this embodiment, by using ZDD, it is possible to narrow down the computational combinations indicating whether or not a link can be used to eight combinations, as shown in Fig. 9. Note that Fig. 9 is a diagram showing the operation state shown in Fig. 7 using a zero-suppressed binary decision diagram.
[0052] ZDD will now be described in further detail.
[0053] The data structure representing all configurations that satisfy the constraints received as input in this embodiment is a data structure called ZDD (References 2, 3).
[0054] Reference 2: https: / / en.wikipedia.org / wiki / Zero-suppressed_decision_diagram (retrieved March 28, 2021) Reference 3: "Superfast Graph Enumeration Algorithm" ERATO Minato Discrete Structure Processing System Project (author), Shinichi Minato (editor), Morikita Publishing, ISBN4627852614 A ZDD is a data structure known to be able to compactly represent a set of combinations (a family of sets; a set of sets), and is represented in the form of a Directed Acyclic Graph (DAG). All nodes except the two terminal nodes (called "internal nodes") have two branches, a 0-branch and a 1-branch. The two terminal nodes are Yes (true) and No (false) nodes. The internal nodes have a variable number that corresponds to one of the items included in the combination set. A ZDD has a single node that has no input, which is called the parent node. The path from the parent node to the Yes (true) terminal node represents the existence of a set.
[0055] If a route passes through a 1-edge, it indicates that the item (network link) corresponding to the source node is included in the set, and if it passes through a 0-edge, it indicates that it is not included. As an example, Figure 9 shows a ZDD that uses items A, B, C, and D to represent the 11 combinations shown in Figure 8. In Figure 9, circles represent internal nodes, squares represent terminal nodes, values in circles represent corresponding items, and values in squares represent the type of terminal. Dashed lines represent 0-edges and solid lines represent 1-edges. Each of the two routes from the root node to the terminal represents a set.
[0056] The condition for the ZDD used here is that there must be a ZDD item that corresponds to the link in the input abstract network. The number of types of ZDD items can be large.
[0057] In FIG. 9, for example, a solid arrow extending from link A indicates that link A is available (e.g., the power line is connected), and a dashed arrow extending from link A indicates that link A is unavailable (e.g., the power line is cut).
[0058] FIG. 10 is a diagram showing a specific path in the zero-suppressed BDD of FIG. 9. The specific paths in this case are shown in bold in FIG. 10, and are the fifth path {A, C, D} and the sixth path {A, C} in FIG. 8. In the case of the fifth path {A, C, D} in FIG. 8, in FIG. 10, proceed from link A to link B in the lower right as link A is connected, proceed to link C in the lower right as link B is disconnected, proceed to link D as link C is connected, and proceed to "Yes (True)" as link D is connected. In the case of the sixth path {A, C} in FIG. 8, in FIG. 10, proceed from link A to link B in the lower right as link A is connected, proceed to link C in the lower right as link B is disconnected, proceed to link D as link C is connected, and proceed to "Yes (True)" as link D is disconnected.
[0059] As described above, there are 11 possible combinations of potential combinations that indicate whether or not a link can be used, taking into account the constraint that no loops occur. However, by using ZDD as in this embodiment, the number of combinations can be narrowed down to 8 (8 nodes). In this example, the number of combinations is reduced from 11 to 8 for the sake of simple explanation, but in reality, there are many more nodes than the four nodes 1, 2, 3, and 4 shown in FIG. 7. Furthermore, failures may occur simultaneously at multiple locations, and the occurrence pattern of failures increases exponentially with respect to the number of links in the supply network. Furthermore, there are an exponential number of all supply methods that satisfy the constraints. Therefore, it is not possible to explicitly calculate these individually within a practical time using an existing computer. However, by using ZDD as in this embodiment, it is possible to calculate the fulfillment rate of demand in a practical time even if an existing computer is used.
[0060] 7, for example, when power is supplied from node 1 as a substation to node 3 in Roppongi, only a binary evaluation of whether power could be supplied to node 3 or not could be performed. In contrast, in this embodiment, even if power cannot be supplied to node 3 in Roppongi, a multi-valued reliability evaluation can be performed that indicates to which nodes power can be supplied (connected) from node 1, such as if power could be supplied from node 1 to node 2 in Kasumigaseki or if power could be supplied from node 1 to node 4 in Akasaka.
[0061] [Main Effects of the Embodiments] According to this embodiment, a data structure that compactly represents a huge number of failure patterns is used to calculate the fulfillment rate without performing explicit calculations for each failure pattern. Therefore, even if an existing computer is used, it is possible to calculate the fulfillment rate for a large network in a realistic amount of time.
[0062] Furthermore, according to this embodiment, it is possible to perform a multi-value reliability evaluation indicating to which nodes a node can supply (is connected) from the supply source node 1.
[0063] 〔supplement〕 The present invention is not limited to the above-described embodiment, and may have the following configurations or processes (operations). (1) The evaluation device 5 of the present invention can be realized by a computer and a program. This program can be recorded on a recording medium or provided via a communication network. (2) In the above embodiment, a PC is shown as the evaluation device 5, but the PC may be a desktop computer or a notebook computer. The evaluation device may also be a tablet terminal, a smart watch, or the like. (3) Each CPU 501 may be multiple, not just single. [Explanation of symbols]
[0064] 5. Evaluation equipment 50 Fulfillment rate calculation unit (an example of a fulfillment rate calculation means) 51 Designated coverage number enumeration unit (an example of a designated coverage number enumeration means) 52 Specified cover inclusion enumeration part (an example of specified cover inclusion enumeration means) 53 Probability calculation unit (an example of a probability calculation means)
Claims
1. An evaluation device for evaluating availability of a supply network for supplying resources from a supply source to a supply destination via a predetermined route, comprising: In a zero-suppressed binary decision diagram, the supply source is a root node, the supply destination is a predetermined node, and the predetermined path is a predetermined link; a specified covering number enumeration means for calculating, based on first information representing a zero-suppressed binary decision diagram expressing all combinations satisfying a constraint condition in the zero-suppressed binary decision diagram and supply network information indicating the contents of the supply network satisfying the constraint condition, second information representing a zero-suppressed binary decision diagram expressing all selection methods of links such that a predetermined number of nodes are connected to the root node, and third information representing a zero-suppressed binary decision diagram expressing a joint set of the first information and the second information; a specified covering / inclusion enumeration means for calculating fourth information indicating a zero-suppressed binary decision diagram expressing a combination in which all links not included in each combination in a zero-suppressed binary decision diagram related to the third information are set to be arbitrary, for each combination in the zero-suppressed binary decision diagram related to the third information; a probability calculation means for calculating a probability that at least one path exists from the root node to the predetermined node related to the destination in a zero-suppressed binary decision diagram related to the fourth information, based on the fourth information and a failure probability of the predetermined link; a fulfillment rate calculation means for calculating a fulfillment rate of a demand in the supply network by using the third information, the fourth information, and the information indicating the probability for a fulfillment number ranging from 1 to a total number of nodes; An evaluation device comprising:
2. 2. The evaluation device according to claim 1, wherein the designated covering number enumeration means calculates the second information using a frontier method.
3. 2. The evaluation device according to claim 1, wherein the specified cover inclusion enumeration means calculates the fourth information by using a Restrict operation provided as a standard operation of the zero-suppressed binary decision diagram.
4. The evaluation device according to claim 1, characterized in that the probability calculation means calculates the probability using dynamic programming, which initializes a value corresponding to the specified node to 1, and updates the value of the node itself from values corresponding to two child nodes in order from the bottom up toward the root node.
5. 2. The evaluation device according to claim 1, wherein the constraint condition indicates the existence of a path in the supply network along which the resource is not supplied.
6. 1. An evaluation method executed by an evaluation device for evaluating availability of a supply network for supplying resources from a supply source to a supply destination via a predetermined route, comprising: In a zero-suppressed binary decision diagram, the supply source is a root node, the supply destination is a predetermined node, and the predetermined path is a predetermined link; a specified covering number enumeration process for calculating second information representing a zero-suppressed binary decision diagram expressing a selection of all links such that a predetermined number of nodes are connected to the root node, based on first information representing a zero-suppressed binary decision diagram expressing all combinations that satisfy a constraint condition in the zero-suppressed binary decision diagram and supply network information representing the contents of the supply network that satisfy the constraint condition, and calculating third information representing a zero-suppressed binary decision diagram expressing a joint set of the first information and the second information; a specified covering / inclusion enumeration process for calculating fourth information indicating a zero-suppressed binary decision diagram expressing a combination in which all links not included in each combination in the zero-suppressed binary decision diagram related to the third information are set to be arbitrary, for each combination in the zero-suppressed binary decision diagram related to the third information; a probability calculation process for calculating a probability that at least one path exists from the root node to the predetermined node related to the destination in the zero-suppressed binary decision diagram related to the fourth information, based on the fourth information and the failure probability of the predetermined link; a fulfillment rate calculation process for calculating a fulfillment rate of the demand in the supply network by using the third information, the fourth information, and the information indicating the probability for a fulfillment number from 1 to a total number of nodes; Evaluation methods including:
7. A program causing a computer to execute the method according to claim 6.
Citation Information
Patent Citations
Facility maintenance support system, facility maintenance support method, and program
JP2018206031A
Distribution network configuration output apparatus, method, and program
JP2019033619A
