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

Shingyochi, Koji; Yamamoto, Hisashi

doi:10.1587/transfun.e92.a.1578

Cited by 6 publications

(3 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here, the optimal arrangements obtained by the PA are presented. For example, the optimal arrangements of the systems with 𝑛 = 24 in the large-variance, middle-variance, and small-variance cases using the PA are as follows: 9,19,5,13,24,8,12,18,4,14,21,7,15,20,3,11,23,6,16,22,2,10,17) Thus, it can be confirmed that the optimal arrangements depend on (the variance of) the component reliabilities.…”

Section: 2mentioning

confidence: 89%

“…Over the past 30 years, various heuristic and meta‐heuristic methods have been reported for solving the CAP for Con

/k/n

:F systems (1)Heuristic methods 6–8 (2)Meta‐heuristic methods, such as genetic algorithms, 9–12 simulated annealing, 13,14 and ant colony optimization 15,16 …”

Section: Literature Reviewmentioning

confidence: 99%

“…Meta‐heuristic methods have also been used to solve the CAP. Yamamoto 9 provided an efficient genetic algorithm to obtain the optimal arrangement of a Con

/k/n

:F system. In addition to the genetic algorithm, Shingyochi et al 14 .…”

Section: Literature Reviewmentioning

confidence: 99%

See 2 more Smart Citations

Branch‐and‐bound‐based algorithm for solving the multi‐type component assignment problem in a consecutive‐k$k$‐out‐of‐n$n$:F system

Nakamura

Yamamoto

2021

Quality & Reliability Eng

Self Cite

View full text Add to dashboard Cite

With the increasing scale and complexity of real‐world systems, it is crucial to improve system reliability in order to minimize occurrences of system failure. To achieve this, several prior studies have considered the component assignment problem for consecutive‐k$k$‐out‐of‐n$n$:F system models. This problem was extended to consider a system comprising multiple component types. This multi‐type component assignment problem (MCAP) aims to find an optimal component arrangement that achieves the maximum system reliability under the assumption that a component should be assigned only to a position of the same component type. A branch‐and‐bound (B&B) ‐based algorithm was developed to solve the MCAP in a consecutive‐k$k$‐out‐of‐n$n$:F system. The main principle of the proposed algorithm is the incorporation of the pruning conditions in the standard B&B framework to reduce the number of candidates for the optimal arrangement. It is experimentally demonstrated that the proposed algorithm can significantly improve the efficiency of the enumeration method in solving the MCAP. The proposed algorithm can obtain the optimal arrangement of a large system if the number of types is relatively large. The findings of this study can help in improving the reliability of any system that can be expressed as a consecutive‐k$k$‐out‐of‐n$n$:F system with multiple component types.

show abstract

Section: 2mentioning

confidence: 89%

“…Over the past 30 years, various heuristic and meta‐heuristic methods have been reported for solving the CAP for Con

/k/n

:F systems (1)Heuristic methods 6–8 (2)Meta‐heuristic methods, such as genetic algorithms, 9–12 simulated annealing, 13,14 and ant colony optimization 15,16 …”

Section: Literature Reviewmentioning

confidence: 99%