BAT-based algorithm for finding all Pareto solutions of the series-parallel redundancy allocation problem with mixed components

•Propose the first algorithm to find all Pareto solutions for RAP.•Propose the first BAT-algorithm for RAP.•Propose the first BAT-based algorithm to find all Pareto solutions for RAP.•Propose the first algorithm to combine SSO and BAT for the RAP.•Find all Pareto solutions for Fyffe RAP and Coit RAP...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Reliability engineering & system safety Ročník 228; s. 108795
Hlavní autor: Yeh, Wei-Chang
Médium: Journal Article
Jazyk:angličtina
Vydáno: Barking Elsevier Ltd 01.12.2022
Elsevier BV
Témata:
Algorithms
Binary-addition-tree algorithm (BAT)
Bound-rule-BAT (BRB)
Pareto solutions
Redundancy
Redundancy allocation problem (RAP)
Reliability
Reliability engineering
Resource consumption
Series-parallel system
Subsystems
Binary-addition-tree algorithm (BAT)
Series-parallel system
Pareto solutions
Reliability
Redundancy allocation problem (RAP)
Bound-rule-BAT (BRB)
ISSN:0951-8320, 1879-0836
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•Propose the first algorithm to find all Pareto solutions for RAP.•Propose the first BAT-algorithm for RAP.•Propose the first BAT-based algorithm to find all Pareto solutions for RAP.•Propose the first algorithm to combine SSO and BAT for the RAP.•Find all Pareto solutions for Fyffe RAP and Coit RAP. 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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0951-8320
1879-0836
DOI:10.1016/j.ress.2022.108795