The search functionality is under construction.

The search functionality is under construction.

An optimal arrangement problem involves finding a component arrangement to maximize system reliability, namely, the optimal arrangement. It is useful to obtain the optimal arrangement when we design a practical system. An existing study developed an algorithm for finding the optimal arrangement of a connected-(*r*, *s*)-out-of-(*m*, *n*): F lattice system with *r*=*m*-1 and *n<*2*s*. However, the algorithm is time-consuming to find the optimal arrangement of a system having many components. In this study, we develop an algorithm for efficiently finding the optimal arrangement of the system with *r*=*m*-1 and *s*=*n*-1 based on the depth-first branch-and-bound method. In the algorithm, before enumerating arrangements, we assign some components without computing the system reliability. As a result, we can find the optimal arrangement effectively because the number of components which must be assigned decreases. Furthermore, we develop an efficient method for computing the system reliability. The numerical experiment demonstrates the effectiveness of our proposed algorithm.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E101-A No.12 pp.2446-2453

- Publication Date
- 2018/12/01

- Publicized

- Online ISSN
- 1745-1337

- DOI
- 10.1587/transfun.E101.A.2446

- Type of Manuscript
- PAPER

- Category
- Reliability, Maintainability and Safety Analysis

Taishin NAKAMURA

Tokyo Metropolitan University

Hisashi YAMAMOTO

Tokyo Metropolitan University

Tomoaki AKIBA

Chiba Institute of Technology

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Taishin NAKAMURA, Hisashi YAMAMOTO, Tomoaki AKIBA, "Fast Algorithm for Optimal Arrangement in Connected-(m-1, n-1)-out-of-(m, n):F Lattice System" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 12, pp. 2446-2453, December 2018, doi: 10.1587/transfun.E101.A.2446.

Abstract: An optimal arrangement problem involves finding a component arrangement to maximize system reliability, namely, the optimal arrangement. It is useful to obtain the optimal arrangement when we design a practical system. An existing study developed an algorithm for finding the optimal arrangement of a connected-(*r*, *s*)-out-of-(*m*, *n*): F lattice system with *r*=*m*-1 and *n<*2*s*. However, the algorithm is time-consuming to find the optimal arrangement of a system having many components. In this study, we develop an algorithm for efficiently finding the optimal arrangement of the system with *r*=*m*-1 and *s*=*n*-1 based on the depth-first branch-and-bound method. In the algorithm, before enumerating arrangements, we assign some components without computing the system reliability. As a result, we can find the optimal arrangement effectively because the number of components which must be assigned decreases. Furthermore, we develop an efficient method for computing the system reliability. The numerical experiment demonstrates the effectiveness of our proposed algorithm.

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.2446/_p

Copy

@ARTICLE{e101-a_12_2446,

author={Taishin NAKAMURA, Hisashi YAMAMOTO, Tomoaki AKIBA, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={Fast Algorithm for Optimal Arrangement in Connected-(m-1, n-1)-out-of-(m, n):F Lattice System},

year={2018},

volume={E101-A},

number={12},

pages={2446-2453},

abstract={An optimal arrangement problem involves finding a component arrangement to maximize system reliability, namely, the optimal arrangement. It is useful to obtain the optimal arrangement when we design a practical system. An existing study developed an algorithm for finding the optimal arrangement of a connected-(*r*, *s*)-out-of-(*m*, *n*): F lattice system with *r*=*m*-1 and *n<*2*s*. However, the algorithm is time-consuming to find the optimal arrangement of a system having many components. In this study, we develop an algorithm for efficiently finding the optimal arrangement of the system with *r*=*m*-1 and *s*=*n*-1 based on the depth-first branch-and-bound method. In the algorithm, before enumerating arrangements, we assign some components without computing the system reliability. As a result, we can find the optimal arrangement effectively because the number of components which must be assigned decreases. Furthermore, we develop an efficient method for computing the system reliability. The numerical experiment demonstrates the effectiveness of our proposed algorithm.},

keywords={},

doi={10.1587/transfun.E101.A.2446},

ISSN={1745-1337},

month={December},}

Copy

TY - JOUR

TI - Fast Algorithm for Optimal Arrangement in Connected-(m-1, n-1)-out-of-(m, n):F Lattice System

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 2446

EP - 2453

AU - Taishin NAKAMURA

AU - Hisashi YAMAMOTO

AU - Tomoaki AKIBA

PY - 2018

DO - 10.1587/transfun.E101.A.2446

JO - IEICE TRANSACTIONS on Fundamentals

SN - 1745-1337

VL - E101-A

IS - 12

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - December 2018

AB - An optimal arrangement problem involves finding a component arrangement to maximize system reliability, namely, the optimal arrangement. It is useful to obtain the optimal arrangement when we design a practical system. An existing study developed an algorithm for finding the optimal arrangement of a connected-(*r*, *s*)-out-of-(*m*, *n*): F lattice system with *r*=*m*-1 and *n<*2*s*. However, the algorithm is time-consuming to find the optimal arrangement of a system having many components. In this study, we develop an algorithm for efficiently finding the optimal arrangement of the system with *r*=*m*-1 and *s*=*n*-1 based on the depth-first branch-and-bound method. In the algorithm, before enumerating arrangements, we assign some components without computing the system reliability. As a result, we can find the optimal arrangement effectively because the number of components which must be assigned decreases. Furthermore, we develop an efficient method for computing the system reliability. The numerical experiment demonstrates the effectiveness of our proposed algorithm.

ER -