:: Volume 2, Issue 2 (6-2012) ::
2012, 2(2): 0-0 Back to browse issues page
A Memtic genetic algorithm for a redundancy allocation problem
M. EbrahimNezhad Moghadam Rashti , B. M. Vishkaei , R. Esmaeilpour
Abstract:   (11930 Views)
Abstract In general redundancy allocation problems the redundancy strategy for each subsystem is predetermined. Tavakkoli- Moghaddam 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) and Memtic algorithm (MA) with each one to solve the multi-objective model. Keywords: Redundancy Allocation Problems, Series-Parallel Problems, Redundancy Strategies, Non Dominated Sorting Genetic Algorithms (NSGAII), Memtic Algorithms.
Full-Text [PDF 485 kb]   (3842 Downloads)    
Type of Study: Research | Subject: Special
Received: 2012/06/11 | Published: 2012/06/15


XML     Print



Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Volume 2, Issue 2 (6-2012) Back to browse issues page