.png){kind=icon}
返回
Solution of minimum spanning forest problems with reliability constraints
.png){kind=icon}
OA
AI
DOI：10.1016/j.cie.2020.106365.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose the reliability constrained k-rooted minimum spanning forest, a relevant optimization problem whose aim is to find a k-rooted minimum cost forest that connects given customers to a number of supply vertices, in such a way that a minimum required reliability on each path between a customer and a supply vertex is satisfied and the cost is a minimum. The reliability of an edge is the probability that no failure occurs on that edge, whereas the reliability of a path is the product of the reliabilities of the edges in such path. The problem has relevant applications in the design of networks, in fields such as telecommunications, electricity and transports. For its solution, we propose a mixed integer linear programming model, and an adaptive large neighborhood search metaheuristic which invokes several shaking and local search operators. Extensive computational tests prove that the metaheuristic can provide good quality solutions in very short computing times.
Keyword:
Networks
Minimum spanning forest
Reliability
Adaptive large neighborhood search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
A two-level solution approach for solving the generalized minimum spanning tree problem求解广义最小生成树问题的两级解法
PREAI
分享收藏分享收藏
查看更多内容