| Project/Area Number |
23510204
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Social systems engineering/Safety system
|
|---|
| Research Institution | Tokyo Metropolitan University |
|---|
Principal Investigator |
YAMAMOTO Hisashi 首都大学東京, システムデザイン研究科, 教授 (60231677)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
SHINGYOCHI Koji 十文字学園女子大学, 人間生活学部, 准教授 (90267774)
秋葉 知昭 千葉工業大学, 公私立大学の部局等, 准教授 (60505767)
|
|---|
| Research Collaborator |
AKIBA Tomoaki 千葉工業大学, 社会システム科学部, 准教授 (60505767)
|
|---|
| Project Period (FY) |
2011 – 2013
|
| Project Status |
Completed (Fiscal Year 2013)
|
| Budget Amount *help |
¥5,330,000 (Direct Cost: ¥4,100,000、Indirect Cost: ¥1,230,000)
Fiscal Year 2013: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2012: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
Fiscal Year 2011: ¥2,210,000 (Direct Cost: ¥1,700,000、Indirect Cost: ¥510,000)
|
|---|
| Keywords | 信頼性工学 / システム評価・設計 / 連続型 k-システム / 信頼度 / アルゴリズム / 最適設計 |
|---|
| Research Abstract |
This study considered the optimal design problem (especially, optimal arrangement problem of components) of an applied consecutive-k system with dependent components.
We considered optimal component arrangement problem of a multi-state consecutive-k-out-of-n:F system, in which the expectation of system state are maximized. For these problems, we obtained 1) the conditions of making an arrangement optimal, developed 2) Meta-heuristic approach for pseudo-optimal arrangement by simulated-annealing. And, by utilizing results for 1) and 2), we can solve the following other theme: 3) Optimal assignment problem in a limited-cycle model with multiple periods. 4) Efficient algorithm for obtaining Pareto-solutions of multi-objective network problem.
|
