Algorithm for Solving the Component Assignment Problem in a Multistate Sliding Window System
Algorithm for Solving the Component Assignment Problem in a Multistate Sliding Window System
复制标题
解决多状态滑动窗口系统中组件分配问题的算法
DOI：
10.1142/s0218539321400015
复制
发表时间：
2021
期刊：
影响因子：
--
通讯作者：
Nakamura Taishin
中科院分区：
文献类型：
--
作者：
Nakamura Taishin;Yamamoto Hisashi;Shinzato Takashi;Akiba Tomoaki;Nakamura Taishin
多状态滑动窗口系统（SWS）由排成一行的多状态组件组成；每一组连续的多状态组件被认为是一个窗口。如果一个窗口的总性能率不满足预定的要求，那么该窗口被视为失败。当且仅当存在至少一个失败窗口时，SWS会失败。一些研究人员考虑了SWS的组件分配问题，目的是找到一个适当的组件安排，以最大限度地提高系统的可靠性。这样的安排被称为最优安排。虽然已经提出了几种元启发式和启发式算法，但目前还没有一个精确的算法来解决SWS的组件分配问题。因此，本研究提出了一种基于分支绑定的算法来有效地确定SWS的最优排列。在此基础上，提出了系统可靠性的递归计算方法。将基于分支边界的算法与递归法相结合，降低了确定最优布置的可靠性计算的复杂性。为了验证基于分支绑定算法的有效性，进行了数值实验；结果表明，参数和对计算时间的影响最大，而参数对计算时间的影响最小。该算法可用于提高可表示为SWS的实际系统的可靠性。此外，最优安排可以用来衡量启发式和元启发式的性能，因为它们保证了全局最优性。
The multistate sliding window system (SWS) comprisesmultistate components arranged in a line; each group ofconsecutive multistate components is considered as a window. If the total performance rate in a window does not meet the predetermined demand, then that window is regarded as a failure. The SWS fails if and only if there exists at least one failed window. Several researchers have considered the component assignment problem for the SWS with the aim of finding an appropriate component arrangement that maximizes system reliability. Such an arrangement is called the optimal arrangement. Although several metaheuristic and heuristic algorithms have been proposed, an exact algorithm for solving the component assignment problem of the SWS has not been developed thus far. Therefore, in this study, a branch-and-bound-based algorithm is developed to determine the optimal arrangement of the SWS efficiently. Furthermore, a recursive method is proposed to compute the system reliability. Combining the branch-and-bound-based algorithm with the recursive method enables reduction of the complexity of the reliability computations for determining the optimal arrangement. To investigate the efficiency of the branch-and-bound-based algorithm, numerical experiments were conducted; it was observed that the parametersandhave the maximum effect on computation time, whereas parameterhas minimal effect. The proposed algorithm is useful for improving the reliability of a practical system that can be expressed as an SWS. In addition, the optimal arrangements can be used to measure the heuristic and metaheuristic performances because they guarantee global optimality.