2014
DOI: 10.1109/tr.2014.2299191
|View full text |Cite
|
Sign up to set email alerts
|

The Robust Redundancy Allocation Problem in Series-Parallel Systems With Budgeted Uncertainty

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
18
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 38 publications
(18 citation statements)
references
References 32 publications
0
18
0
Order By: Relevance
“…It should be mentioned that two redundancy strategies including active (A) and cold standby (C) are to be selected in this paper and the variables for the redundant strategy are restricted in the interval [1,2]. The round function is utilized to choose values from either 1 which means the subsystem follows the active strategy or 2 which means the cold standby strategy is employed.…”
Section: Solution Representationmentioning
confidence: 99%
See 1 more Smart Citation
“…It should be mentioned that two redundancy strategies including active (A) and cold standby (C) are to be selected in this paper and the variables for the redundant strategy are restricted in the interval [1,2]. The round function is utilized to choose values from either 1 which means the subsystem follows the active strategy or 2 which means the cold standby strategy is employed.…”
Section: Solution Representationmentioning
confidence: 99%
“…The system reliability is maximized through adding appropriate redundant components to each subsystem while satisfying certain system-level constraints such as cost and weight. Since various real-world applications can be modeled as the well-known RAP, many researchers have studied such an arduous NP-hard problem [1][2][3][4].…”
Section: Introductionmentioning
confidence: 99%
“…In practice, for an uncertain mixed integer programming (MIP) problem with interval data, solving robust counterparts for budgeted uncertainty sets is much easier than finding the minmax regret solution. For example, in redundancy allocation problems, this difference is obvious by comparing the results in [48][49][50][51], respectively. In addition, former method can find solutions with different levels of conservativeness, while the latter approach outputs only one conservative solution.…”
Section: Introductionmentioning
confidence: 99%
“…They implemented robust deviation called minimax regret to address uncertainty of component reliability. Feizollahi et al [31] extended the constrained redundancy optimization problem such that component reliabilities belong to a uncertainty set. In our new model, RAP is extended by relating uncertain stress variables to component reliability with different system perspectives, including regret or opportunity loss analysis.…”
Section: Introductionmentioning
confidence: 99%