Solving a Rap Using Metaheuristic Hybrid Algorithms

15 Pages Posted: 29 Apr 2020

Date Written: April 4, 2020

Abstract

A redundancy allocation problem (RAP) is a well-known NP-hard problem that involves the selection of elements and redundancy levels to maximize the system reliability under various system-level constraints. In many practical design situations, reliability apportionment is complicated because of the presence of several conflicting objectives that cannot be combined into a single-objective function. As telecommunications, manufacturing and power systems are becoming more and more complex, while requiring short developments schedules and very high reliability, it is becoming increasingly important to develop efficient solutions to the RAP. In this study, a reliability-redundancy allocation problem to improve the reliability of series, series-parallel and bridge systems is investigated. To solve the problem, a hybrid method based on Imperialism competitive algorithm and genetics algorithm is used. The results of simulations demonstrate the superior performance of the proposed method in comparison with the existing approaches.

Keywords: RAP, ICA, GA

JEL Classification: C02

Suggested Citation

Eghbali, Hossein, Solving a Rap Using Metaheuristic Hybrid Algorithms (April 4, 2020). Available at SSRN: https://ssrn.com/abstract=3568376 or http://dx.doi.org/10.2139/ssrn.3568376

Hossein Eghbali (Contact Author)

University of Eyvanekey ( email )

www.eyc.ac.ir
www.eyc.ac.ir
Eyvanekey, semnan
Iran
+982334521563 (Phone)
+982334521562 (Fax)

HOME PAGE: http://eyc.ac.ir/ShowHeyatElmi.aspx?mid=19331

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
56
Abstract Views
491
Rank
1,000,027
PlumX Metrics