A Mimetic genetic algorithm for a redundancy allocation problem

In general redundancy allocation problems the redundancy strategy for each subsystem is predetermined. Moghaddam(2008) presented a series-parallel redundancy allocation problem with mixing components (RAPMC) in which the redundancy strategy can be chosen for individual subsystems. In this paper we present a bi-objective redundancy allocation when the redundancy strategies for subsystems are considered as a variable of the problem. As the problem belongs to the NP-hard class problems, we will present a new approach for the non-dominated sorting genetic algorithm (NSGAII) to solve the multi-objective model.

Redundancy allocation problems; Series-parallel problems; Redundancy Strategies, Non dominated sorting genetic algorithms (NSGAII); Memtic algorithms.