Development of Algorithms for Robustness Supply Chain Network Design Problems
| Project/Area Number |
25350454
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Social systems engineering/Safety system
|
|---|
| Research Institution | Ryutsu Keizai University |
|---|
Principal Investigator |
Naoto Katayama 流通経済大学, 流通情報学部, 教授 (20194780)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
YURIMOTO SHIGERU 流通経済大学, 流通情報学部, 教授 (90129015)
|
|---|
| Project Period (FY) |
2013-04-01 – 2016-03-31
|
| Project Status |
Completed (Fiscal Year 2015)
|
| Budget Amount *help |
¥2,990,000 (Direct Cost: ¥2,300,000、Indirect Cost: ¥690,000)
Fiscal Year 2015: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2014: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2013: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
|
|---|
| Keywords | サプライチェーン / ネットワーク設計 / 最適化モデル / ロバストネス / シナリオ解析 |
|---|
| Outline of Final Research Achievements |
In this study, we have developed various supply chain network design models considering conditions exiting at the real world. For these models, we have developed the solution algorithms using a capacity scaling algorithm, restricted branch-and-bound, column generation and row generation. For the capacitated network design model, we proposed new fast greedy algorithms, which are combining the modified delete algorithm and the capacity scaling algorithm. We applied the fast new greedy algorithms to the probabilistic scenario analysis, and have developed the algorithm for the robustness supply chain network design model.
|
Report
(4 results)
Research Products
(17 results)
