Preprocessing minpaths for sum of disjoint products
Network reliability algorithms which produce sums of disjoint products (SDP) are sensitive to the order in which the minimal pathsets are analyzed. The minpaths are preprocessed by choosing this order in the hope that an SDP algorithm will then provide a relatively efficient analysis. The most commonly used preprocessing strategy is to list the minpaths in order of increasing size. This paper gives examples for which this strategy is not optimal. A new preprocessing strategy which works well for SDP algorithms with single-variable inversion (SVI) is introduced. It is also observed that optimal preprocessing for SVI-SDP can be different from optimal preprocessing for SDP algorithms which use multiple-variable inversion; one reason for this is that MVI-SDP algorithms handle disjoint minpaths much more effectively than SVI-SDP algorithms do. Both kinds of SDP algorithms profit from prior reduction of elements and of subsystems which are in parallel or in series.
preprocessing sum of disjoint products (sdp) system reliability