2013
DOI: 10.1016/j.scient.2012.12.022
|View full text |Cite
|
Sign up to set email alerts
|

Two metaheuristics for solving the reliability redundancy allocation problem to maximize mean time to failure of a series–parallel system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
6
1
1

Relationship

1
7

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 20 publications
0
5
0
Order By: Relevance
“…Many studies from the systems engineering literature examine the pros and cons of different configurations of redundancies for a variety of systems. For example, system elements may be placed in series or parallel to create redundancy (Najafi et al, 2013). In a series system, redundancy may be built at the component level to prevent the failure of each component, or at the system level to prevent the failure of any component in the primary system (Hazra & Nanda, 2014).…”
Section: Recommendations For Resource Managersmentioning
confidence: 99%
“…Many studies from the systems engineering literature examine the pros and cons of different configurations of redundancies for a variety of systems. For example, system elements may be placed in series or parallel to create redundancy (Najafi et al, 2013). In a series system, redundancy may be built at the component level to prevent the failure of each component, or at the system level to prevent the failure of any component in the primary system (Hazra & Nanda, 2014).…”
Section: Recommendations For Resource Managersmentioning
confidence: 99%
“…[14] has applied this method. However, experimentally we found that it does not perform as well as the method which we are going to describe.…”
Section: 4mentioning
confidence: 99%
“…Due to the complexity of the RRAP, most of the researches has focused on developing heuristic and metaheuristic approaches. In this regard, we can refer to Simulated Annealing (SA) [8], Genetic Algorithm (GA) [4,[9][10][11][12], Particle Swarm Optimization (PSO) [5,6,[13][14][15][16], Artificial bee colony algorithm [3,17], Artificial immune search [18], Biogeography-based optimization (BBO) [19], fruit fly optimization algorithm [20], Markov decision process [21], Stochastic Fractal Search (SFS) [22], and hybrid algorithms such as SFS-GA [23]. In addition to heuristic and metaheuristic algorithms, simulation-based solution approaches [24] and exact solution methods such as implicit enumeration, branch-and-bound, and dynamic programming have also been used to solve RRAP [23].…”
Section: Introductionmentioning
confidence: 99%