| Project/Area Number |
25330024
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Mathematical informatics
|
|---|
| Research Institution | Chuo University (2015-2017)
Nagoya University (2013-2014) |
|---|
Principal Investigator |
|
|---|
| Co-Investigator(Renkei-kenkyūsha) |
YAGIURA Mutsunori 名古屋大学, 大学院情報研究科, 教授 (10263120)
HASHIMOTO Hideki 東京海洋大, 学術研究院, 准教授 (70548114)
UMETANI Shunji 大阪大学, 大学院情報科学研究科, 准教授 (80367820)
|
|---|
| Project Period (FY) |
2013-04-01 – 2018-03-31
|
| Project Status |
Completed (Fiscal Year 2017)
|
| Budget Amount *help |
¥4,940,000 (Direct Cost: ¥3,800,000、Indirect Cost: ¥1,140,000)
Fiscal Year 2016: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2015: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
Fiscal Year 2014: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2013: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
|
|---|
| Keywords | 数理情報 / アルゴリズム / 数理工学 / 組合せ最適化 / 配置問題 |
|---|
| Outline of Final Research Achievements |
Packing problem is a problem to place items into one/some large area. There are many applications in the world such as production, LSI design and container loading. In this research, we design many practical heuristic algorithms for this problem. We first design an algorithm for enumerating BL positions for rectangles. With this algorithm, three construction heuristic algorithms for the rectilinear packing problems were proposed. We also propose a practical algorithm for bitmap shapes.
We design some heuristic algorithms for a practical container loading problem, and we apply algorithms for packing problems to other optimization problems.
|
