Efficient Genetic Algorithm for Optimal Arrangement in a Linear Consecutive-k-out-of-n : F System

スポンサーリンク

概要

• 論文の詳細を見る

• A linear consecutive-k-out-of-n: F system is an ordered sequence of n components. This system fails if, and only if, k or more consecutive components fail. Optimal arrangement is one of the main problems for such kind of system. In this problem, we want to obtain an optimal arrangement of components to maximize system reliability, when all components of the system need not have equal component failure probability and all components are mutually statistically independent. As n becomes large, however, the amount of calculation would be too much to solve within a reasonable computing time even by using a high-performance computer. Hanafusa and Yamamoto proposed applying Genetic Algorithm (GA) to obtain quasi optimal arrangement in a linear consecutive-k-out-of-n: F system. GA is known as a powerful tool for solving many optimization problems. They also proposed ordinal representation, which produces only arrangements satisfying the necessary conditions for optimal arrangements and eliminates redundant arrangements with same system reliabilities produced by reversal of certain arrangements. In this paper, we propose an efficient GA. We have modified the previous work mentioned above to allocate components with low failure probabilities, that is to say reliable components, at equal intervals, because such arrangements seem to have relatively high system reliabilities. Through the numerical experiments, we observed that our proposed GA with interval k provides better solutions than the previous work for the most cases.

• （社）電子情報通信学会の論文
• 2009-07-01

著者

• Shingyochi Koji

  Faculty Of Social And Information Sciences 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)

スポンサーリンク