Open AccessAn approach for solving constrained reliability-redundancy allocation problems using cuckoo search algorithm
Author(s) -
Harish Garg
Publication year - 2015
Publication title -
beni-seuf university journal of basic and applied sciences /beni-suef university journal of basic and applied sciences
Language(s) - English
Resource type - Journals
eISSN - 2314-8543
pISSN - 2314-8535
DOI - 10.1016/j.bjbas.2015.02.003
Subject(s) - cuckoo search , redundancy (engineering) , mathematical optimization , benchmark (surveying) , cuckoo , reliability (semiconductor) , computer science , optimal allocation , algorithm , mathematics , reliability engineering , engineering , zoology , power (physics) , physics , quantum mechanics , particle swarm optimization , biology , operating system , geodesy , geography
The main goal of the present paper is to present a penalty based cuckoo search (CS) algorithm to get the optimal solution of reliability – redundancy allocation problems (RRAP) with nonlinear resource constraints. The reliability – redundancy allocation problem involves the selection of components' reliability in each subsystem and the corresponding redundancy levels that produce maximum benefits subject to the system's cost, weight, volume and reliability constraints. Numerical results of five benchmark problems are reported and compared. It has been shown that the solutions by the proposed approach are all superior to the best solutions obtained by the typical approaches in the literature are shown to be statistically significant by means of unpaired pooled t-test