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...

Full description

Bibliographic Details

Published in:	IEEE transactions on reliability Vol. 69; no. 2; pp. 497 - 509
Main Authors:	Nakamura, Taishin, Yamamoto, Hisashi
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.06.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!