English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The series-parallel (active) redundancy allocation problem with mixedcomponents (RAP) involves setting reliable objectives for components orsubsystems to meet the resource consumption constraint, e.g., the total cost.RAP has been an active research area for the past four decades. The NP-harddifficulties confronted by RAP are maintaining feasibility with respect to twoconstraints: cost and weight. A novel algorithm called the bound-rule-BAT (BRB)based on the binary-addition-tree algorithm (BAT), the dominance rule, anddynamic bounds are proposed to solve the exact solutions of the most famous RAPbenchmark problems called the (33-variation) Fyffe RAP. From the experiments,the proposed BRB can solve the Fyffe RAP correctly under the assumption thatthe maximal number of components of each subsystem is eight, and this is thefirst exact-solution algorithm that can solve the Fyffe RAP within 8 secondsand 60 seconds if no reliability lower bound is used.

A BAT-based Exact-Solution Algorithm for the Series-Parallel Redundancy Allocation Problem with Mixed Components