 BAT-based algorithm for finding all Pareto solutions of the series-parallel redundancy allocation problem with mixed componentsWei-Chang Yeh Reliability Engineering and System Safety, 2022, vol. 228, issue C Abstract: The active strategy series-parallel redundancy allocation problem (RAP) with mixed components involves setting reliable objectives for components or subsystems to meet the resource consumption constraint, for example the total cost. RAP has been actively researched for the past four decades. NP-hard problems confronted by RAP include maintaining feasibility with respect to two constraints: cost and weight. To provide all Pareto solutions to RAPs, e.g., the Fyffe RAP and Coit RAP, a novel algorithm is proposed, which is called the bound-rule-BAT (BRB). The BRB is based on the binary-addition-tree algorithm (BAT), the dominance rule, and dynamic bounds. The BRB is tested on three experiments to demonstrate its efficiency in solving the Fyffe RAP and its ability in finding all Pareto solutions of the Coit RAP. Keywords: Reliability; Series-parallel system; Redundancy allocation problem (RAP); Binary-addition-tree algorithm (BAT); Bound-rule-BAT (BRB); Pareto solutions (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:reensy:v:228:y:2022:i:c:s0951832022004161 DOI: 10.1016/j.ress.2022.108795 Access Statistics for this article Reliability Engineering and System Safety is currently edited by Carlos Guedes Soares More articles in Reliability Engineering and System Safety from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.