论文标题
混合组件的基于BAT基于BAT的精确算法，用于串联并行冗余分配问题
A BAT-based Exact-Solution Algorithm for the Series-Parallel Redundancy Allocation Problem with Mixed Components
论文作者
论文摘要
混合组件（RAP）的串联（主动）冗余分配问题涉及为组件或子系统设定可靠的目标，以满足资源消耗约束，例如总成本。在过去的四十年中，RAP一直是一个活跃的研究领域。 RAP面临的NP困难在两个限制方面保持可行性：成本和体重。提出了一种基于二进制 - 附加树算法（BAT）的新型算法，称为BOND-RULE-BAT（BRB），提出了统治规则和动态界限，以解决最著名的RAP基准问题的确切解决方案，称为（33个偏差）Fyffe Rap。从实验中，提出的BRB可以在每个子系统的最大组件数量为8的假设下正确求解Fyffe Rap，这是可以在8秒内和60秒内解决fyffe Rap的第一个精确解决算法，如果使用可靠性较低，则可以在8秒内和60秒内解决。
The series-parallel (active) redundancy allocation problem with mixed components (RAP) involves setting reliable objectives for components or subsystems 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-hard difficulties confronted by RAP are maintaining feasibility with respect to two constraints: cost and weight. A novel algorithm called the bound-rule-BAT (BRB) based on the binary-addition-tree algorithm (BAT), the dominance rule, and dynamic bounds are proposed to solve the exact solutions of the most famous RAP benchmark problems called the (33-variation) Fyffe RAP. From the experiments, the proposed BRB can solve the Fyffe RAP correctly under the assumption that the maximal number of components of each subsystem is eight, and this is the first exact-solution algorithm that can solve the Fyffe RAP within 8 seconds and 60 seconds if no reliability lower bound is used.
