| Budget Amount *help |
¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000)
Fiscal Year 2020: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2019: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
Fiscal Year 2018: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2017: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
|
|---|
| Outline of Final Research Achievements |
The packing problem is a combinatorial optimization problem in which several objects with 2D or 3D shapes are placed in a given region so that they do not overlap each other. Although this problem has many real-world applications, experts agree that it is very difficult to solve the problem with general-purpose mathematical optimization solvers (e.g., general-purpose solvers for mixed integer programming problems) and that it is necessary to design dedicated algorithms.
In this research project, we studied the design of new algorithms for packing problems and the use of existing algorithms for basic packing problems to packing problems with different objectives and constraints, and optimization problems with packing constraints such as delivery planning and scheduling.
|
