Optimal Arrangement of Linear Connected-(1,2)-or-(2,1)-out-of-(2,n):F System

抄録

Stable operation of the systems existing in modern society is crucial. The component assignment problem (CAP) is important for improving the reliability of a system through efficient use of the components. The CAP involves the seeking of an arrangement that maximizes the system reliability given the components included in the system. To solve this problem, we use a model that represents a real system as a system model, such as the connected-X-out-of-(m, n):F system. The optimal arrangement for a connected-(r, s)-out-of-(m, n):F system, which is a type of connected-X-out-of-(m, n):F system, has been previously investigated. However, linear connected-(1,2)-or-(2,1)-out-of-(m, n):F systems have not been studied because the necessary conditions cannot be proved using conventional methods. Therefore, in this study, we focus on a linear connected-(1,2)-or-(2,1)-out-of-(2, n):F system and propose an efficient search method for the optimal arrangement. To efficiently seek the optimal arrangement of this system, we propose alternating arrangements as the necessary condition for optimal arrangement along with an algorithm that applies this condition. We propose and prove lemmas necessary for proving the theorem. In addition, we compare the proposed algorithm with an enumeration algorithm and an algorithm that does not exclude nonalternating arrangements and confirm its effectiveness.