.png){kind=icon}
返回
An exact algorithm for the reliability redundancy allocation problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2015.01.008.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The redundancy allocation problem is the problem of finding an optimal allocation of redundant components subject to a set of resource constraints. The problem studied in this paper refers to a series-parallel system configuration and allows for component mixing. We propose a new modeling/solution approach, in which the problem is transformed into a multiple choice knapsack problem and solved to optimality via a branch and cut algorithm. The algorithm is tested on well-known sets of benchmark instances. All instances have been solved to optimality in milliseconds or very few seconds on a normal workstation. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Redundancy allocation problem
Multiple choice knapsack problem
Branch and cut
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏A hybrid cuckoo search and genetic algorithm for reliability-redundancy allocation problems求解可靠性-冗余分配问题的混合布谷鸟搜索和遗传算法
PREAI
分享收藏Tabu search-based metaheuristic algorithm for software system reliability problems基于禁忌搜索的软件系统可靠性元启发式算法
PREAI
分享收藏
查看更多内容