.png){kind=icon}
返回
A differential evolution algorithm to solve redundancy allocation problems
.png){kind=icon}
PRE
AI
DOI：10.1111/j.1475-3995.2012.00856.x.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
To improve system reliability without changing its nature, three methods are proposed. The first method uses more reliable components and the second method provides redundant components within the system. The third method is a combination of these two methods. The redundancy allocation problem (RAP) finds the appropriate mix of components and redundancies within a system to maximize its reliability or minimize its cost due to several constraints, such as cost, weight, and volume. This paper presents a methodology to solve the RAP, which is an NP-hard problem, modeled with discrete variables. In this paper, we use a metaheuristic to solve the RAP of a seriesparallel system with a mix of components. Our metaheuristic offers a practical method with specific solution encoding, and combines a penalty function to solve large instances of the relaxed RAP, where different types of components can be used in parallel. The efficiency of the algorithm was tested through a set of well-known benchmark problems from the literature. Testing of the algorithm achieved satisfactory results in reasonable computing time.
Keyword:
system reliability allocation problem
evolutionary algorithms
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
LXI The Factor of Heredity in Labyrinthine Deafness and Paroxysmal Vertigo (Ménière's Syndrome)
PREAI
分享收藏
查看更多内容