A Memetic algorithm for a redundancy allocation problem

This paper proposes a genetic algorithm (GA) and a memetic algorithm (MA) for a redundancy allocation problem (RAP) with a mix of components for the series- parallel system when the redandancy strategy can be chosen for individual subsystems. Most mathematical models of general RAp assume that the type of redundancy strategy for each subsystem is predetermined and known as priori. in general, active redundancy has traditionally received greater attention; however, in practice both active and cold-standby redundancies may be used within a particular system design. the choice of redundancy strategy then becomes an additional decision variable. Thus, the problem is to select the best redundancy strategy, combination of components, and levels of redundancy for each subsystem that miximizes the system reliability two meta-heuristic methods based on GA and MA to find the best solution for the given problem. to validate the performance of these proposed algorithm in terms of solution quality, various test problems are examined. finally, computational results of these tow proposed algorithms are compared. these results show that the proposed MA outperforms the proposed GA for solving the foregoing problem.

Keywords:

Relaibility optimization , Redundancy allocation problem. Redundancy strategies , Memetic algorithms