.png){kind=icon}
返回
An efficient heuristic for series-parallel redundant reliability problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2004.02.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a novel algorithm for solving a series-parallel redundancy allocation problem with separable constraints. The idea of a heuristic approach design is inspired from the greedy method and the genetic algorithm. The structure of the algorithm includes: (1) randomly generating a specified population size number of minimum workable solutions; (2) assigning components either according to the greedy method or to the random selection method; and (3) improving solutions through an inner-system and inter-system solution revision process. Numerical results for the 33 test problems from previous research are reported and compared. As reported in this paper, the solutions found by our approach are all better than or are in par with the well-known best solutions from the approach taken by previous solutions. (C) 2004 Elsevier Ltd. All rights reserved.
Keyword:
reliability optimization
redundant allocation
heuristic
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏LXI The Factor of Heredity in Labyrinthine Deafness and Paroxysmal Vertigo (Ménière's Syndrome)
PREAI
分享收藏
查看更多内容