2009
DOI: 10.1016/j.cor.2008.02.017
|View full text |Cite
|
Sign up to set email alerts
|

Multi-objective reliability optimization for dissimilar-unit cold-standby systems using a genetic algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
27
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 52 publications
(29 citation statements)
references
References 30 publications
(51 reference statements)
1
27
0
Order By: Relevance
“…It is gratifying therefore that Safari (2012) and Chambari et al (2012) depart from this. Redundancies involving standby components (especially cold standby as in both Safari (2012) and Chambari et al (2012)) have also not received much attention (Azarm et al, 2008). These are interesting drawbacks or gaps, on account of the many practical situations which are likely to depart from such fundamentals.…”
Section: Discussionmentioning
confidence: 99%
“…It is gratifying therefore that Safari (2012) and Chambari et al (2012) depart from this. Redundancies involving standby components (especially cold standby as in both Safari (2012) and Chambari et al (2012)) have also not received much attention (Azarm et al, 2008). These are interesting drawbacks or gaps, on account of the many practical situations which are likely to depart from such fundamentals.…”
Section: Discussionmentioning
confidence: 99%
“…The same objective functions as those defined in Kumar et al (2006) were used. Azaron et al (2009) found Pareto solutions in a cold-standby redundancy scheme using genetic algorithms and the goal attainment method in order to minimize the initial purchase cost of the system, to maximize its MTTF (mean time to failure), to minimize its VTTF (variance of time to failure) and also to maximize its reliability during the mission time. studied the optimal expansion of an existing electrical power transmission network using multiobjective genetic algorithms with two objectives: maximizing reliability and minimizing cost.…”
Section: Approaches In the 2000s And 2010smentioning
confidence: 99%
“…Performance (84) ADL(4) [145], [160], [161], [170], ANY(2) [133], [153], CUSTOMAM(5) [90], [152], [196]- [198], OPTIMPL(3) ALLOCATION(20) [61], [83], [88], [121]- [123], [133], [153], [155], [160], [161], [164], [175]- [178], [186], [187], [192], [214], CLUSTERING(3) [67], [122], [214], COMPONENT SELECTION(12) [7], [18], [96], [97], [147], [149], [160], [161], [177], [178], [182], [232], HARDWARE PARAMETERS(2) [160], [161], HARDWARE REPLICATION(29) [31], [51]- [57], …”
Section: Qa Architecture Representation Quality Evaluation Degrees Ofmentioning
confidence: 99%
“…Evolutionary Algorithms (EAs) [18], [33], [37], [38], [41], [57]- [60], [71], [73], [76], [88], [92], [102], [108], [118], [128], [148], [149], [157]- [159], [161], [175], [196], [216], [221], [223], [227]- [229], [231], [237] are some of the most commonly used approximate methods in architecture optimization. EAs are seen as robust algorithms that exhibit approximately similar performance over a wide range of problems [98], hence their popularity in the software engineering domain.…”
Section: Qa Optimization Strategy Type Constraint Handlingmentioning
confidence: 99%