2023 Fiscal Year Final Research Report
Design and development of a general-purpose solver for a variety of problem of asking assignment and ordering
| Project/Area Number |
19K04900
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Review Section |
Basic Section 25010:Social systems engineering-related
|
|---|
| Research Institution | Tokyo University of Marine Science and Technology |
|---|
Principal Investigator |
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
胡 艶楠 東京理科大学, 理学部第一部応用数学科, 講師 (00778326)
|
|---|
| Project Period (FY) |
2019-04-01 – 2024-03-31
|
| Keywords | 配送計画問題 / 配置問題 / 局所探索法 / メタ戦略 |
|---|
| Outline of Final Research Achievements |
Integer programming solvers, which are the most popular general-purpose solving methods for combinatorial optimization problems, are not good at problems that ask for assignments or ordering, and are difficult to solve even for small-scale problems. In this study, we analyzed the problem structure of typical problems that ask for such assignments and orders, and developed efficient local search methods, construction methods, and metaheuristics combining them.
|
| Free Research Field |
組合せ最適化
|
| Academic Significance and Societal Importance of the Research Achievements |
割当および順序を最適化したいという実務的な要求は多く，多種多様な問題がある．例えば，様々な制約条件の下で，複数の車両を用いて全ての客をちょうど1 回ずつ訪問するような経路の中で，コストが最小のものを求める配送計画問題がその一例である．しかし，これらの問題は整数計画ソルバでは小規模の問題しか求解することができない．本研究では，割当および順序を求める問題を対象として典型的な問題構造を持つ問題に対して効率的な解法の開発を行なった．
|
