By Topic

System Reliability Optimization Considering Uncertainty: Minimization of the Coefficient of Variation for Series-Parallel Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tekiner-Mogulkoc, H. ; Coll. of Eng. & Natural Sci., Istanbul Sehir Univ., Istanbul, Turkey ; Coit, D.W.

System reliability optimization models considering uncertainty are described, and new algorithms are proposed to minimize the coefficient of variation of the system reliability estimate. This is a realistic, important formulation because the reliability of most components is not known with certainty, and decision-makers are often risk averse, preferring a system with a slightly lower estimated reliability if it is a more certain measure. The redundancy allocation problem can be defined as the selection of the system configuration and the type of the components to optimize some objective function(s) while satisfying some system related constraints. In this paper, we propose algorithms to minimize the coefficient of variation of the system reliability estimate with respect to a minimum system reliability constraint, and some other system related constraints. Two algorithms are presented. For problems where component mixing is not allowed, an optimal algorithm is presented based on linear integer programming. For problems where mixing is allowed, a heuristic approach is presented based on a combined neighborhood search, and a linear integer programming approach. The heuristic starts with the solution of those problems where mixing components is not allowed, and searches the neighborhood of this solution to find better prospective solutions for the problems where mixing components is allowed. Then, a linear integer programming problem is solved to identify the recommended solution to the problem.

Published in:

Reliability, IEEE Transactions on  (Volume:60 ,  Issue: 3 )