{"title":"Simulation-based system reliability estimation of a multi-state flow network for all possible demand levels","authors":"Ping-Chen Chang, Ding-Hsiang Huang, Cheng-Fu Huang","doi":"10.1007/s10479-024-06141-y","DOIUrl":null,"url":null,"abstract":"<div><p>The multi-state flow network (MSFN) serves as a fundamental framework for real-life network-structured systems and various applications. The system reliability of the MSFN, denoted as <i>R</i><sub><i>d</i></sub>, is defined as the probability of successfully transmitting at least <i>d</i> units of demand from a source to a terminal. Current analytical algorithms are characterized by their computational complexity, specifically falling into the NP-hard problem to evaluate exact system reliability. Moreover, existing analytical algorithms for calculating <i>R</i><sub><i>d</i></sub> are basically designed for predetermined values of <i>d</i>. This limitation hinders the ability of decision-makers to flexibly choose the most appropriate based on the specific characteristics of the given scenarios or applications. This means that these methods are incapable of simultaneously calculating system reliability for various demand levels. Therefore, this paper develops a simulation-based algorithm to estimate system reliability for all possible demand levels simultaneously such that we can eliminate the need to rely on repeat procedures for each specified <i>d</i>. An experimental investigation was carried out on a benchmark network and a practical network to validate the effectiveness and performance of the proposed algorithm.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"340 1","pages":"117 - 132"},"PeriodicalIF":4.4000,"publicationDate":"2024-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Operations Research","FirstCategoryId":"91","ListUrlMain":"https://link.springer.com/article/10.1007/s10479-024-06141-y","RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0
Abstract
The multi-state flow network (MSFN) serves as a fundamental framework for real-life network-structured systems and various applications. The system reliability of the MSFN, denoted as Rd, is defined as the probability of successfully transmitting at least d units of demand from a source to a terminal. Current analytical algorithms are characterized by their computational complexity, specifically falling into the NP-hard problem to evaluate exact system reliability. Moreover, existing analytical algorithms for calculating Rd are basically designed for predetermined values of d. This limitation hinders the ability of decision-makers to flexibly choose the most appropriate based on the specific characteristics of the given scenarios or applications. This means that these methods are incapable of simultaneously calculating system reliability for various demand levels. Therefore, this paper develops a simulation-based algorithm to estimate system reliability for all possible demand levels simultaneously such that we can eliminate the need to rely on repeat procedures for each specified d. An experimental investigation was carried out on a benchmark network and a practical network to validate the effectiveness and performance of the proposed algorithm.
多状态流量网络(MSFN)是现实生活中网络结构系统和各种应用的基本框架。MSFN 的系统可靠性(记为 Rd)被定义为从源头到终端成功传输至少 d 个单位需求的概率。目前的分析算法具有计算复杂的特点,特别是在评估精确系统可靠性时,属于 NP 难问题。此外,计算 Rd 的现有分析算法基本上都是针对 d 的预定值设计的。这种局限性妨碍了决策者根据特定场景或应用的具体特点灵活选择最合适算法的能力。这意味着这些方法无法同时计算各种需求水平下的系统可靠性。因此,本文开发了一种基于仿真的算法,可同时估算所有可能需求水平下的系统可靠性,从而使我们无需依赖于对每个指定 d 重复计算的程序。
期刊介绍:
The Annals of Operations Research publishes peer-reviewed original articles dealing with key aspects of operations research, including theory, practice, and computation. The journal publishes full-length research articles, short notes, expositions and surveys, reports on computational studies, and case studies that present new and innovative practical applications.
In addition to regular issues, the journal publishes periodic special volumes that focus on defined fields of operations research, ranging from the highly theoretical to the algorithmic and the applied. These volumes have one or more Guest Editors who are responsible for collecting the papers and overseeing the refereeing process.