.png){kind=icon}
返回
All-terminal network reliability optimization via probabilistic solution discovery
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ress.2008.01.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a new algorithm that can be readily applied to solve the all-terminal network reliability allocation problems. The optimization problem solved considers the minimization of the network design cost subject to a known constraint on all-terminal reliability by assuming that the network contains a known number of functionally equivalent components (with different performance specifications) that can be used to provide redundancy. The algorithm is based on two major steps that use a probabilistic solution discovery approach and Monte Carlo simulation to generate the quasi-optimal network designs. Examples for different sizes of all terminal networks are used throughout the paper to illustrate the approach. The results obtained for the larger networks with unknown optima show that the quality of the solutions generated by the proposed algorithm is significantly higher with respect to other approaches and that these solutions are obtained from restricted solution search space. Although developed for all-terminal reliability optimization, the algorithm can be easily applied in other resource-constrained allocation problems. (c) 2008 Elsevier Ltd. All rights reserved.
Keyword:
all-terminal reliability
allocation problem
optimization
solution discovery
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
R
IF:
11
论文数:
9.0K
被引数:
4.2W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容