An Efficient Algorithm for Solving Optimal Component Arrangement Problem in Circular Consecutive-k-out-of-n: F System(<Special English Issue>Optimization and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• A circular consecutive-k-out-of-n: F system consists of n components arranged along a circular path. This system fails if k or more consecutive components fail. As the number of components n increases, the amount of calculations to obtain a solution within a reasonable computing time would be too much, except for the special cases of k=1,2,n-2,n-1,n. Therefore, most of the recent studies have focused on proposing algorithms to obtain quasi optimal arrangements. It would be meaningful for such studies, however, to obtain the exact optimal arrangement of a moderate-sized system and investigate its characteristics. In this paper, we propose an efficient algorithm for solving this problem. We developed this algorithm to reduce the search space by eliminating arrangements with equal system reliability produced by rotation and/or reversal of certain arrangements. In addition, this algorithm also prevents redundant calculations by memorizing the calculated values, when depth first search is conducted, based on Hwang's formula calculating the reliability of a circular consecutive-k-out-of-n: F system. We conducted some numerical experiments in order to evaluate this algorithm. The results of the experiments show that our proposed algorithm can reduce computing time to approximately 1/4n as compared to an exhaustive search.

• 社団法人日本経営工学会の論文
• 2008-02-15

著者

• Yamamoto Hisashi

  Faculty of System Design, Tokyo Metropolitan University

• Yamamoto Hisashi

  Tokyo Metropolitan Univ. Hino‐shi Jpn

• Shingyochi Koji

  Faculty of Social Science and Computer Science, Jumonji University

• Shingyochi Koji

  Faculty Of Social And Information Sciences Jumonji University

• Shingyochi Koji

  Faculty Of Social Science And Computer Science Jumonji University

• Yamamoto Hisashi

  Faculty Of System Design Tokyo Metropolitan University

関連論文

• An Efficient Branch and Bound Algorithm for the Optimal Arrangement Problem in the Linear Consecutive-k-out-of-r-from-n:F System(-Information and Operations Management)
• Calculating Method for the System State Distributions of Generalized Multi-State k-out-of-n : F Systems
• Recursive Formulas for the Reliability of Multi-State Consecutive-k-out-of-n:F System(-Information and Operations Management)
• A Study on the Design of Readjusting Method in the Production Seat System(-Information and Operations Management)
• An Efficient Algorithm for Solving Optimal Component Arrangement Problem in Circular Consecutive-k-out-of-n: F System(Optimization and Its Applications)
• Efficient Genetic Algorithm for Optimal Arrangement in a Linear Consecutive-k-out-of-n : F System
• Searching Pareto Solutions for Bi-objective Series k-out-of-N System Component Allocation Problems using the Breadth First Search Method(Theory and Methodology)
• An Evaluating Algorithm for System State Distributions of Generalized Multi-state k-out-of-n:F Systems

スポンサーリンク