| Budget Amount *help |
¥8,450,000 (Direct Cost: ¥6,500,000、Indirect Cost: ¥1,950,000)
Fiscal Year 2017: ¥2,080,000 (Direct Cost: ¥1,600,000、Indirect Cost: ¥480,000)
Fiscal Year 2016: ¥2,080,000 (Direct Cost: ¥1,600,000、Indirect Cost: ¥480,000)
Fiscal Year 2015: ¥2,340,000 (Direct Cost: ¥1,800,000、Indirect Cost: ¥540,000)
Fiscal Year 2014: ¥1,950,000 (Direct Cost: ¥1,500,000、Indirect Cost: ¥450,000)
|
|---|
| Outline of Final Research Achievements |
For most non-expert users suffers, it is desirable to formulate their real world problems into general-purpose combinatorial optimization model such as mixed integer programming problem (MIP) and constraint satisfaction problems (CSP) and solve them by the state-of-the-art algorithms. However, it would be certainly difficult to attain comparable results to those of the specially tailored algorithms, because the hardness of extracting the useful features for improving the efficiency of algorithms from the general form of MIP and CSP.
In this research project, in order to achieve a general-purpose algorithm with highest performance, we developed automated system that configures an metaheuristic algorithm for the instance to be solved by combining a wide variety of components and tuning program parameters at runtime.
|
