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


Tekiner-Mogulkoc H. , Coit D. W.

IEEE TRANSACTIONS ON RELIABILITY, vol.60, no.3, pp.667-674, 2011 (Journal Indexed in SCI) identifier identifier

  • Publication Type: Article / Article
  • Volume: 60 Issue: 3
  • Publication Date: 2011
  • Doi Number: 10.1109/tr.2011.2161029
  • Title of Journal : IEEE TRANSACTIONS ON RELIABILITY
  • Page Numbers: pp.667-674
  • Keywords: Estimation uncertainty, redundancy allocation problem, system reliability, COMPONENT-RELIABILITY, GENETIC ALGORITHM

Abstract

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.