Robust counterpart optimization for the redundancy allocation problem in series-parallel systems with component mixing under uncertainty

作者:

Highlights:

摘要

In this paper, a robust optimization approach is used to solve the redundancy allocation problem (RAP) in series-parallel systems with component mixing where uncertainty exists in components’ reliabilities. In real world, the reliabilities of components are imprecisely estimated or the reliability of some components may vary due to some realistic factors. Therefore, we may deal with a system where there are many components with uncertain values of reliabilities. To deal with this problem, for the first time a robust optimization approach is applied to RAP with component mixing to produce a robust solution, which is relatively insensitive with respect to uncertainty in reliability of components. In addition, the advantages of the proposed robust technique are illustrated by considering a series-parallel system and finding the suitable redundancy levels and then Monte Carlo simulation is implemented to examine the quality of the robust solutions. The results indicate that applying the proposed robust RAP can be more reliable to determine system reliability in the designing phase of systems.

论文关键词:Reliability optimization,Redundancy allocation,Component mixing,Robust optimization,Interval-polyhedral uncertainty set,Monte Carlo simulation

论文评审过程:Received 1 June 2015, Revised 26 June 2015, Accepted 18 August 2015, Available online 19 September 2015, Version of Record 19 September 2015.

论文官网地址:https://doi.org/10.1016/j.amc.2015.08.069