Multi-objective Redundancy Allocation Problem with weighted-k-out-of-n subsystems

Mani Sharifi; Tahmine Ashoori Moghaddam; Mohammadreza Shahriari

doi:10.1016/j.heliyon.2019.e02346

Multi-objective Redundancy Allocation Problem with weighted-k-out-of-n subsystems

Heliyon. 2019 Dec 13;5(12):e02346. doi: 10.1016/j.heliyon.2019.e02346. eCollection 2019 Dec.

Authors

Mani Sharifi¹, Tahmine Ashoori Moghaddam², Mohammadreza Shahriari³

Affiliations

¹ Faculty of Industrial & Mechanical Engineering, Islamic Azad University, Qazvin Branch, Qazvin, Iran.
² Faculty of Industrial Engineering, Islamic Azad University, South Tehran Branch, Tehran, Iran.
³ Faculty of Management and Accounting, Islamic Azad University, South Tehran Branch, Tehran, Iran.

Abstract

Redundancy Allocation Problem (RAP) is one of the most practical problems in the reliability area. Many assumptions have been added to RAP in recent years. The aim was to better represent real-world problems with RAP. One of these assumptions is considering weighted-k-out-of-n sub-systems. This method has been used to model various systems like power and hydro transitions systems. In this paper, we present a new multi-objective RAP (MORAP) model for optimizing the reliability and cost of the weighted-k-out-of-n parallel systems. In our model, the sub-systems are considered as weighted-k-out-of-n. Also, we use the universal generating function and adapt this technique to obtain an exact formula to calculate each sub-system reliability. Since RAP belongs to NP-hard class of problems, we decided to employ the non-dominated sorting genetic algorithm and non-dominated ranked genetic algorithm. Several criteria were used to compare the result of these two algorithms.

Keywords: Non-dominated ranked genetic algorithm (NRGA); Non-dominated sorting genetic algorithms (NSGA-II); Reliability; Systems engineering; Weighted-k-out-of-n.