| Budget Amount *help |
¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000)
Fiscal Year 2019: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2018: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2017: ¥1,950,000 (Direct Cost: ¥1,500,000、Indirect Cost: ¥450,000)
|
|---|
| Outline of Final Research Achievements |
The purpose of this study is to develop a new algorithm for huge scale combinatorial optimization problems. In our research, a new algorithm specialized for huge scale combinatorial optimization problems was proposed. The proposed algorithm was applied to Quadratic Assignment Problem (QAP) and Maximum Diversity Problem (MDP). In our experiments, the computational results showed that the proposed method outperformed previous methods for huge scale QAP and MDP.
|
