Journal
JOURNAL OF COMPUTATIONAL SCIENCE
Volume 17, Issue -, Pages 139-147Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.jocs.2016.05.011
Keywords
d-MPs; Network reliability; Minimal path; Fast enumeration; Explicit enumeration
Funding
- Ministry of Science and Technology, Taiwan, Republic of China [MOST 104-2221-E-236-001]
Ask authors/readers for more resources
Network theories have been developed for decades. They are now widely applied to solve many real-life problems. An active research field is the reliability evaluation of multistate networks. The most popular methods for such evaluation often use minimal paths (MP) or minimal cuts (MC) of the network. In these approaches, three basic steps exist: (a) searching for all MPs/MCs; (b) searching for all d-MPsid-MCs from these MPs/MCs; (c) calculating union probability from these d-MPsid-MCs. When the network is live, there are several minimum path vectors with respect to system state for d, namely d-MP, can be found. Steps a and c have great advances recently. This paper focuses on the searching for d-MPs by given MPs in terms of fast enumeration (FE), which was a recent advance in the integer programming problems in the literature. This paper is a first attempt to apply FE to the reliability evaluation of multistate networks. This paper also makes comparison with the well known algorithm for benchmarking. More complicated examples are also examined for illustrative purposes. (C) 2016 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available