A bound heuristic algorithm for solving reliability redundancy optimization

This paper presents the concept of the bound region and proposes a solution method for the nonlinear integer programming refined from the optimal allocation of redundant components, which optimal solution has been proved in the bound region of the problem. In this method, any heuristic technique could be used to obtain a new and better bound point from any given bound point in the bound region. With some examples, the effect of the new algorithm and existing methods are compared. The results show that our method is better than any existing heuristic methods and can obtain optimal solutions in most cases.