A Memtic genetic algorithm for a redundancy allocation problem

In general redundancy allocation problems the redundancy strategy for each subsystem ispredetermined. tavakkoli- moghaddam presented a series-parallel redundancy allocation problem withmixing components (rapmc) in which the redundancy strategy can be chosen for individualsubsystems. in this paper, we present a bi-objective redundancy allocation when the redundancystrategies for subsystems are considered as a variable of the problem. as the problem belongs to thenp-hard class problems, we will present a new approach for the non-dominated sorting geneticalgorithm (nsgaii) and memtic algorithm (ma) with each one to solve the multi-objective model.