Path survival reliabilities as measures of reliability for lifeline utility networks

IF 1.1 4区 数学 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Journal of Combinatorial Optimization Pub Date : 2025-04-26 DOI:10.1007/s10878-025-01291-6
Brian Godwin Lim, Renzo Roel Tan, Richard de Jesus, Lessandro Estelito Garciano, Agnes Garciano, Kazushi Ikeda
{"title":"Path survival reliabilities as measures of reliability for lifeline utility networks","authors":"Brian Godwin Lim, Renzo Roel Tan, Richard de Jesus, Lessandro Estelito Garciano, Agnes Garciano, Kazushi Ikeda","doi":"10.1007/s10878-025-01291-6","DOIUrl":null,"url":null,"abstract":"<p>Lifeline utility networks have been studied extensively within the domain of network reliability due to the prevalence of natural hazards. The reliability of these networks is typically investigated through graphs that retain their structural characteristics. This paper introduces novel connectivity-based reliability measures tailored for stochastic graphs with designated source vertices and failure-probability-weighted edges. In particular, the per-vertex path survival reliability quantifies the average survival likelihood of single-source paths from a vertex to any source. A consolidated per-graph reliability measure is also presented, incorporating graph density and the shortest distance to a source as regulating elements for network comparison. To highlight the advantages of the proposed reliability measures, a theoretical discussion of their key properties is presented, along with a comparison against standard reliability measurements. The proposal is further accompanied by an efficient calculation procedure utilizing the zero-suppressed binary decision diagram, constructed through the frontier-based search, to compactly represent all single-source paths. Finally, the path survival reliabilities are calculated for a set of real-world networks and demonstrated to provide practical insights.\n</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"16 1","pages":""},"PeriodicalIF":1.1000,"publicationDate":"2025-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-025-01291-6","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Lifeline utility networks have been studied extensively within the domain of network reliability due to the prevalence of natural hazards. The reliability of these networks is typically investigated through graphs that retain their structural characteristics. This paper introduces novel connectivity-based reliability measures tailored for stochastic graphs with designated source vertices and failure-probability-weighted edges. In particular, the per-vertex path survival reliability quantifies the average survival likelihood of single-source paths from a vertex to any source. A consolidated per-graph reliability measure is also presented, incorporating graph density and the shortest distance to a source as regulating elements for network comparison. To highlight the advantages of the proposed reliability measures, a theoretical discussion of their key properties is presented, along with a comparison against standard reliability measurements. The proposal is further accompanied by an efficient calculation procedure utilizing the zero-suppressed binary decision diagram, constructed through the frontier-based search, to compactly represent all single-source paths. Finally, the path survival reliabilities are calculated for a set of real-world networks and demonstrated to provide practical insights.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
作为生命线公用事业网络可靠性度量的路径生存可靠性
由于自然灾害的普遍存在,生命线公用事业网络在网络可靠性领域得到了广泛的研究。这些网络的可靠性通常通过保留其结构特征的图来研究。针对具有指定源顶点和故障概率加权边的随机图,提出了一种新的基于连通性的可靠性度量方法。特别是,每顶点路径生存可靠性量化了从一个顶点到任何源的单源路径的平均生存可能性。本文还提出了一种统一的逐图可靠性度量方法,将图密度和到源的最短距离作为网络比较的调节元素。为了突出所提出的可靠性测量的优点,对其关键特性进行了理论讨论,并与标准可靠性测量进行了比较。该建议还伴随着一个有效的计算程序,利用零抑制二进制决策图,通过基于边界的搜索构建,以紧凑地表示所有单源路径。最后,为一组现实世界的网络计算路径生存可靠性,并演示以提供实际见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Combinatorial Optimization
Journal of Combinatorial Optimization 数学-计算机:跨学科应用
CiteScore
2.00
自引率
10.00%
发文量
83
审稿时长
6 months
期刊介绍: The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering. The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.
期刊最新文献
On the enumeration of resolute majority rules Binary jumbled indexing: suffix tree histogram Federated edge intelligence for secure and adaptive routing in IoT: a GRU–RL based framework Maximum alternating clean balanced cycle decomposition and applications in rearrangement distance problems Online dispatching and routing for automated guided vehicles in pickup and delivery systems on loop-based graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1