Automated configuration of general-purpose optimization algorithms via machine learning techniques
| Project/Area Number |
26282085
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (B)
|
| Allocation Type | Partial Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Social systems engineering/Safety system
|
|---|
| Research Institution | Osaka University |
|---|
Principal Investigator |
Umetani Shunji 大阪大学, 情報科学研究科, 准教授 (80367820)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
河原 吉伸 大阪大学, 産業科学研究所, 准教授 (00514796)
|
|---|
| Project Period (FY) |
2014-04-01 – 2018-03-31
|
| Project Status |
Completed (Fiscal Year 2017)
|
| 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)
|
|---|
| Keywords | 組合せ最適化 / アルゴリズム / 機械学習 / 数理工学 / データマイニング |
|---|
| 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.
|
Report
(5 results)
Research Products
(20 results)
