An efficient searching method for minimal path vectors in multi-state networks

Yi-Kuei Lin, Shin Guang Chen*

*Corresponding author for this work

Research output: Contribution to journalReview articlepeer-review

6 Scopus citations

Abstract

Searching for minimal path vectors (MPVs) is an important topic in solving network related problems, especially for the evaluation of network reliability. One of the popular approaches, namely the three-stage method (TSM), is influenced deeply on the efficiency of searching for minimal path vectors in multi-state networks (MSN). TSM consists of three stages, i.e., searching for all minimal path sets, searching for all MPVs, and calculating union probability on MPVs. After reviewing previous works in the literaure, this paper proposes a more efficient method based on cyclic check on the candidates of MPVs, which can do an efficient searching for MPVs in MSNs and even reduce the three-step approach to two-step approach. Benchmarking with the well-known algorithms are made in this paper, and more complicated networks are also examined for verification of the proposed method.

Original languageEnglish
JournalAnnals of Operations Research
DOIs
StatePublished - 1 Jan 2019

Keywords

  • Cyclic check
  • Fast enumeration
  • Minimal path sets
  • Minimal path vectors
  • Network reliability

Fingerprint Dive into the research topics of 'An efficient searching method for minimal path vectors in multi-state networks'. Together they form a unique fingerprint.

Cite this