A simple method for optimal redundancy allocation for complex networks

Abstract In this paper a simple method for optimum redundancy allocation for complex networks is presented. A new heuristic criterion is introduced for solving the problem by decomposing the same in two phases. After finding all minimal path sets of the system in phase I, we choose a minimal path set having the highest value of the ‘sensitivity factor’. In phase II we add one component to the stage having the largest value of the selection factor amongst the stages of the selected minimal path set. This procedure is continued until no more redundant component can be added within the available resources. The proposed method is simple, easily computerizable, fast and capable of handling problems subject to any number of constraints. The method has been illustrated by examples and results are compared with the existing methods.