In a multi-state consecutive-
k-out-of-
n:F system, both the system and its components are allowed to be in two or more possible states. One of the most important problems for this system is to obtain the optimal arrangement that maximizes the expectation of the system state. Many researchers have studied the optimal arrangement problem in a multi-state consecutive-
k-out-of-
n:F system. However, the optimal solution for this problem is obtained by calculating the expectation of the system state as an enumeration method. As the number of
n increases, the number of calculations becomes too many to obtain the optimal solution within a reasonable time even if a high-performance computer is used. Therefore, to solve optimal arrangement problem quickly, simulated annealing (SA), which is a kind of metaheuristics, was applied to the optimal arrangement problem in a multi-state consecutive-
k-out-of-
n:F system. However, although it is possible obtain a solution for the optimal arrangement problem using a simulated annealing algorithm, there is no guarantee that the solution is optimal. Therefore, the simulated annealing algorithm applied to an optimal arrangement problem in a multi-state consecutive-
k-out-of-
n:F system must be improved in order to search more efficiently. In this paper, we propose three types of simulated annealing algorithms with the aim of obtaining an optimal arrangement efficiently. We execute numerical experiments to compare their performances and investigate the efficiencies of these algorithms.
View full abstract