Algorithm for Solving Optimal Arrangement Problem in Connected- (r,s)-out-of- (m,n):F Lattice System

This paper considers the optimal arrangement problem in a connected-(r, s)-out-of-(m, n):F lattice system. This problem aims to find a component arrangement to maximize system reliability under the assumption that the component reliabilities are given. Although existing studies developed a few algor...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on reliability Ročník 69; číslo 2; s. 497 - 509
Hlavní autoři: Nakamura, Taishin, Yamamoto, Hisashi
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.06.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Branch-and-bound method
Component reliability
Computational complexity
connected-<inline-formula xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"> <tex-math notation="LaTeX"> (r
Decision trees
Lattices
n)</tex-math> </inline-formula>:F lattice system
optimal arrangement problem
Optimization
Reliability analysis
Reliability theory
s)</tex-math> </inline-formula>-out-of-<inline-formula xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"> <tex-math notation="LaTeX"> (m
System reliability
Thermal energy
ISSN:0018-9529, 1558-1721
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper considers the optimal arrangement problem in a connected-(r, s)-out-of-(m, n):F lattice system. This problem aims to find a component arrangement to maximize system reliability under the assumption that the component reliabilities are given. Although existing studies developed a few algorithms for finding the optimal arrangement of connected-(r, s)-out-of(m, n):F lattice systems, these existing algorithms can only find the optimal arrangement in the special cases. In this paper, we develop an improved algorithm for efficiently finding the optimal arrangement of general connected-(r, s)-out-of-(m, n):F lattice systems. It is based on the branch-and-bound method. First, we derive three conditions for pruning a branch based on the existing conditions for the optimal arrangement. The conditions can reduce the number of candidates for the optimal arrangement. Moreover, we improve the algorithm by incorporating the derived conditions as given by Omuraetal. In the improved algorithm, we compute the system reliability efficiently by memorizing the specific values and then utilizing them. The result of the numerical experiment shows the proposed algorithm is more efficient than the algorithm proposed by Omura et al. in terms of the computation time. The result shows that the proposed algorithm can find the optimal arrangement whereas the algorithm proposed by Nakamura et al. cannot find. The optimal arrangement and its system reliability, which the proposed algorithm provides can also be used to evaluate the quality of solutions obtained by (meta) heuristic algorithms.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9529
1558-1721
DOI:10.1109/TR.2019.2925142