Miller L. Evaluation of network reliability calculation methods

White Paper, 200pp, December 2004
content
Background and Notation
Network Representation
The Equivalent-Links Algorithm
Connectivities in Terms of Event Probabilities
ELA2: A Cutset Appproach
Operation of ELA2
Cutset Search Method
Bound Convergence
Estimates Based on the Bounds
Quick Lower Bound
ALGORITHM DEVELOPMENT
Network Examples
Grid Network Example
15-Node Network Example
34-Node Network Example
Algorithm Implementation
Common Program Structure
programs Based on Partitioning
Program with Pathfinding (ELA)
Program with Cutsets (ELA2)
Program Combining Pathfinding and Cutsets
Program Selecting Pathfinding or Cutsets
Programs Based on Factoring
Program Implementing the Theologou-Carlier Algorithm
Program Implementing the TCA with Bounds
A Program with Combined Partitioning and Factoring
Algorithm Performances
Comparisons of Exact Calculations
Comparisons of Bound Calculations
The Programs That Are Compared
Tests for the 15-Node Example Network
Tests for the 34-Node Example Network
Conclusions and Recommendations