| Project/Area Number |
16K01241
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Social systems engineering/Safety system
|
|---|
| Research Institution | Kyoto Institute of Technology |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2016-04-01 – 2019-03-31
|
| Project Status |
Completed (Fiscal Year 2018)
|
| Budget Amount *help |
¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000)
Fiscal Year 2018: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2017: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2016: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
|
|---|
| Keywords | システム工学 / モデル化 / アルゴリズム |
|---|
| Outline of Final Research Achievements |
We formulated operational issues of repetitive packaging by multihead weighers as lexicographic optimization problems, and investigated their mathematical structures so that approximation algorithms with some performance guarantee were obtained. We presented a polynomial time approximation scheme for optimizing the total weight of a mixture package of two types of items, and also showed that a constant factor approximation solution exists for the optimal total weight of a mixture package of two types of items and the conditionally maximum of the total priority both. Further, we treated a special case of the cardinality constrained packaging problem, and proposed a pseudo-polynomial time algorithm by utilizing a lexicographic bi-criteria structure.
|
| Academic Significance and Societal Importance of the Research Achievements |
組合せ計量システムの反復的袋詰め操作の最適化モデルに対して，本研究で得られた近似アルゴリズムは，それら自身の重要性に加えて，多目的組合せ最適化問題に対する新しい精度評価方法も与えている．また，世界中で稼働する類の製造システムについては，インターネットを介した相互連携が探られているので，数理モデリングの観点から本研究で明らかになった組合せ計量システムの包括的な数理特性は，今後の立上作業の効率化等に結び付いていくことが期待される．
|
