A New Solution Algorithm for the Multistate Minimal Cut Problem
| Autor: | Yi-Feng Niu, Xiu-Zhen Xu |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
021103 operations research
Computer science Reliability (computer networking) 0211 other engineering and technologies 02 engineering and technology Task (project management) Network planning and design Electric power transmission Simple (abstract algebra) Task analysis Network performance Electrical and Electronic Engineering Safety Risk Reliability and Quality Time complexity Algorithm |
| Zdroj: | IEEE Transactions on Reliability. 69:1064-1076 |
| ISSN: | 1558-1721 0018-9529 |
| DOI: | 10.1109/tr.2019.2935630 |
| Popis: | Reliability evaluation is a useful tool for network performance demonstration, and therefore has become an increasingly relevant task in network design and operation. The multistate minimal cut (called d -MC for short) method is a popular algorithm for reliability evaluation of multistate flow networks. This article focuses on d -MC problem, and presents some new results to improve its solution. Grounded on the newly obtained results, an algorithm is proposed to find d -MCs, together with discussions on its time complexity that compares favorably with the existing methods. An illustration of the presented algorithm is provided by solving a simple example. Furthermore, numerical experiments and a case study are conducted to demonstrate the advantage and the utility of the proposed algorithm, respectively. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|