A circular consecutive-k-out-of-n: F system consists of n components arranged along a circular path. This system fails if and only if k or more consecutive components fail. As the number of components n increases, the amount of calculation to solve optimal component arrangement problems in this kind of system exactly would be too much. In this paper, we propose two types of simulated annealing algorithms to obtain quasi optimal solutions for such problems. We compare their performances with a genetic algorithm proposed in the previous research work and demonstrate the advantage of our proposed algorithms through numerical experiments.
A system consisting of n components connected in a circular manner is called a circular consecutive-k-out-of-n: F system if it fails when k or more consecutive components fail. One of the most important problems for this kind of systems is to obtain the optimal component arrangement that maximizes the system reliability. As the number of components n increases, the amount of calculations would be too much to obtain an optimal solution for this problem. In this paper, we propose eight types of simulated annealing algorithms, aiming efficient search. We compare their performances and investigate efficiencies of three ideas applied to such algorithms, through numerical experiments.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.