 A simple minimal path method for estimating the weighted multi-commodity multistate unreliable networks reliabilityWei-Chang Yeh Reliability Engineering and System Safety, 2008, vol. 93, issue 1, 125-136 Abstract: The weighted multicommodity multistate unreliable network (WMMUN) is a novel network composed of multistate unreliable components (arcs and nodes) capable of transmitting different types of commodities in which capacity weight varies with components. It is an extension of the multistate network. The current method for evaluating the directed WMMUN reliability has been derived from minimal cut (MC) based algorithm. The existing best-known method needed extensive comparison and verification, and failed to find the real directed WMMUN reliability. A very simple algorithm based on minimal paths (MPs) is developed for the WMMUN reliability problem. The correctness and computational complexity of the proposed algorithm will be analyzed and proven. An example is given to illustrate how the WMMUN reliability is evaluated using the proposed algorithm. The relationships among all different versions of MPs are also clarified. Keywords: Network reliability; Multistate; Multicommodity; Minimal path; Minimal cut (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:reensy:v:93:y:2008:i:1:p:125-136 DOI: 10.1016/j.ress.2006.11.004 Access Statistics for this article Reliability Engineering and System Safety is currently edited by Carlos Guedes Soares More articles in Reliability Engineering and System Safety from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.