Acyclic Network Reliability Evaluation via Node-Based Path Search
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional network reliability evaluation methods for acyclic networks are complex and time-consuming, particularly when searching for all minimal paths, as they often rely on arcs rather than nodes, leading to inefficient calculation processes.
Innovation Solution
A method and system that utilize the characteristics of acyclic networks to find all minimal paths by setting node sets and count values, using upper and lower limit values to exclude improbable paths, and leveraging adjacent nodes to accelerate the identification of minimal paths, thereby reducing computational complexity and enhancing calculation speed.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional methods using arcs to search for minimal paths are applied, then completeness of path finding is ensured, but computational complexity increases and calculation speed decreases
Solution Approach 1:
The patent inverts the conventional approach by switching from arc-based path searching to node-based path searching. Instead of traversing arcs to find minimal paths, the method uses node sets and adjacent node relationships to identify paths, fundamentally reversing the search paradigm to achieve lower computational complexity
Solution Approach 2:
The patent changes the search parameters from arc-level operations to node-level operations. By using node sets (Vp), count values (k), and adjacent node identifiers, the method transforms the search space and operation granularity, reducing the computational burden while maintaining path finding completeness
2Measurement precision
If all minimal paths are exhaustively searched to ensure accurate reliability evaluation, then measurement precision is improved, but loss of time increases
Solution Approach 1:
The patent performs preliminary actions by pre-establishing node sets, setting upper and lower limit values for path length, and pre-identifying adjacent node relationships before the actual path searching begins. This preliminary structuring enables faster and more efficient minimal path identification
Solution Approach 2:
The patent segments the path searching process into discrete node sets (Vp) with specific count values (k). By dividing the network into manageable node segments and using adjacent node identifiers, the method systematically identifies minimal paths without exhaustive searching, reducing time loss while maintaining accuracy
Data Source
AI summary
A network reliability evaluation method for an acyclic network and a system thereof are provided. The network reliability evaluation method searches all minimal paths from a source node to a sink source based on nodes according to the properties of the acyclic network. In conventional network reliability evaluation methods, searching all minimal paths is based on arcs. Therefore, the network reliability evaluation method and the system thereof can effectively reduce the complexity of calculation.