Finding all the Lower Boundary Points in a Multistate Two-Terminal Network
Authors:
- 11 July 2017
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. 66 (3) , 677-688
Abstract
System reliability of a multistate flow network can be computed in terms of all the lower boundary points, called d-minimal paths (d-MPs). Although several algorithms have been proposed in the literature for the d-MP problem, there is still room for improvement upon its solution. Here, some new results are presented to improve the solution of the problem. A simple novel algorithm is improved to solve a Diophantine system that appeared in the d-MP problem. Then, an improved algorithm is proposed for the d-MP problem. It is also explained how the proposed algorithm can be used in order to assess the reliability of some smart grid communication networks. We provide the complexity results and show the main algorithm to be more efficient than the existing ones in terms of execution times through some benchmark networks and a general network example. Moreover, we compare the algorithms through one thousand randomly generated test problems using the Dolan and More's performance profile.Keywords
Funding Information
- PNPD/CAPES (23038.009634/2016-71)
- CNPq (305427/2016-4)
This publication has 39 references indexed in Scilit:
- The Extension of Universal Generating Function Method to Search for All One-to-Many $d$-Minimal Paths of Acyclic Multi-State-Arc Flow-Conservation NetworksIEEE Transactions on Reliability, 2008
- An efficient method for reliability evaluation of multistate networks given all minimal path vectorsIIE Transactions, 2007
- A generalized multistate-based path vector approach to multistate two-terminal reliabilityIIE Transactions, 2006
- A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advanceJournal of the Operational Research Society, 2005
- Preprocessing minpaths for sum of disjoint productsIEEE Transactions on Reliability, 2003
- Benchmarking optimization software with performance profilesMathematical Programming, 2002
- State extension for adequacy evaluation of composite power systems-applicationsIEEE Transactions on Power Systems, 2000
- A note on state-space decomposition methods for analyzing stochastic flow networksIEEE Transactions on Reliability, 1995
- On reliability evaluation of a capacitated‐flow network in terms of minimal pathsetsNetworks, 1995
- Reliability evaluation of a limited-flow network in terms of minimal cutsetsIEEE Transactions on Reliability, 1993