Presentation 2018-07-27
Proposal of algorithm for optimal arrangement in connected-(r,s)-out-of-(m,n):F lattice system
Taishin Nakamura, Hisashi Yamamoto, Takashi Shinzato,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) One of the most significant problems in reliability theory is an optimal arrangement problem on the assumption that component reliabilities are given. The 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. In this paper, we develop an algorithm for efficiently finding the optimal arrangement of a connected-(r,s)-out-of-(m,n): F lattice system based on the depth-first branch-and-bound method. We evaluate the performance of the algorithm with the derived conditions by performing numerical experiments.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) connected-(r,s)-out-of-(m,n): F lattice system / optimal arrangement problem / combinatorial optimization / branch-and-bound method
Paper # R2018-13
Date of Issue 2018-07-20 (R)

Conference Information
Committee R
Conference Date 2018/7/27(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English) Reliability theory, Reliability for communication network, Overall reliability engineering
Chair Tetsushi Yuge(National Defense Academy)
Vice Chair Akira Asato(Fujitsu)
Secretary Akira Asato(Hosei Univ.)
Assistant Shinji Inoue(Kansai Univ.) / Hiroyuki Okamura(Hiroshima Univ.)

Paper Information
Registration To Technical Committee on Reliability
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Proposal of algorithm for optimal arrangement in connected-(r,s)-out-of-(m,n):F lattice system
Sub Title (in English)
Keyword(1) connected-(r,s)-out-of-(m,n): F lattice system
Keyword(2) optimal arrangement problem
Keyword(3) combinatorial optimization
Keyword(4) branch-and-bound method
1st Author's Name Taishin Nakamura
1st Author's Affiliation Tokyo Metropolitan University(Tokyo Met. Univ.)
2nd Author's Name Hisashi Yamamoto
2nd Author's Affiliation Tokyo Metropolitan University(Tokyo Met. Univ.)
3rd Author's Name Takashi Shinzato
3rd Author's Affiliation Tamagawa University(Tamagawa Univ.)
Date 2018-07-27
Paper # R2018-13
Volume (vol) vol.118
Number (no) R-161
Page pp.pp.13-18(R),
#Pages 6
Date of Issue 2018-07-20 (R)