摘要
We explore the Redundancy Allocation Problem (RAP) under the objective of minimizing the cost of a production system of general topology in which system reliability is treated as a chance constraint. A novel simulation optimization-based solution method grounded in the concepts of the trust region and response surface methodology is proposed to efficiently solve the generalized RAP (GRAP) under random system survival times. The generalizability of the RAP model and efficiency of the solution method allows for our approach to be utilized in a wide variety of real-world applications. We demonstrate in a series of numerical experiments based on production systems of varying complexity that the finite convergence of the proposed method is much more efficient than the commonly-used genetic algorithm. It is shown that on a simple bridge network, only the proposed algorithm can find the true optimal solution to the GRAP under an allotted computational budget. On a complex network which includes series, parallel, and logical relationships, the proposed algorithm is also shown to find solutions to the GRAP which have substantially lower total system cost than those found by GA under a wide variety of scenarios.