Experimental results on preprocessing of path/cut terms in sim of disjoint products technique

Abstract

Researchers have proposed cardinality-, lexicographic-, and Hamming-distance-order methods to preprocess the path terms in sum of disjoint products (SDP) techniques for network reliability analysis. For cutsets, an ordering based on the node partition associated with each cut is suggested. Experimental results showing the number of disjoint products and computer time involved in generating SDP terms are presented. Nineteen benchmark networks containing paths varying from 4 to 780, and cuts from 4 to 7376, are considered. Several SDP techniques are generalized into three propositions to find their inherent merits and drawbacks. An efficient SDP technique is then used to run input files of paths/cuts preprocesses using cardinality-, lexicographic-, and Hamming-distance-ordering, and their combinations. The results are analyzed, showing that preprocessing based on cardinality or its combinations with lexicographic-, and/or Hamming-distance-ordering performs better.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>